![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Joel Oren
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c16]Eitan Kosman, Joel Oren, Dotan Di Castro:
LSP: Acceleration of Graph Neural Networks via Locality Sensitive Pruning of Graphs. ICDM (Workshops) 2022: 690-697 - [c15]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. WSDM 2022: 37-47 - 2021
- [c14]Ohad Rozen, Joel Oren, Ariel Raviv:
Predicting User Demography and Device from News Comments. SIGIR 2021: 1995-1999 - [c13]Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel:
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems. SOCS 2021: 97-105 - [i9]Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Christian Daniel, Dotan Di Castro:
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems. CoRR abs/2104.01646 (2021) - [i8]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. CoRR abs/2110.13324 (2021) - [i7]Eitan Kosman, Joel Oren, Dotan Di Castro:
LSP : Acceleration and Regularization of Graph Neural Networks via Locality Sensitive Pruning of Graphs. CoRR abs/2111.05694 (2021)
2010 – 2019
- 2019
- [j4]Yoram Bachrach, Ian A. Kash, Peter B. Key, Joel Oren:
Strategic behavior and learning in all-pay auctions: an empirical study using crowdsourced data. Auton. Agents Multi Agent Syst. 33(1-2): 192-215 (2019) - [j3]Yuval Filmus
, Joel Oren, Yair Zick
, Yoram Bachrach:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. Theory Comput. Syst. 63(1): 150-174 (2019) - [c12]Weiwei Zhang, Jackie Chi Kit Cheung, Joel Oren:
Generating Character Descriptions for Automatic Summarization of Fiction. AAAI 2019: 7476-7483 - [i6]Dotan Di Castro, Joel Oren, Shie Mannor:
Practical Risk Measures in Reinforcement Learning. CoRR abs/1908.08379 (2019) - 2017
- [j2]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof Mechanisms for Competitive Influence in Networks. Algorithmica 78(2): 425-452 (2017) - 2016
- [b1]Joel Oren:
Multi-Winner Social Choice: Algorithmic and Game-theoretic Approaches. University of Toronto, Canada, 2016 - [c11]Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick:
A Characterization of Voting Power for Discrete Weight Distributions. IJCAI 2016: 74-80 - [c10]Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick
:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. SAGT 2016: 169-181 - [i5]Yuval Filmus, Joel Oren, Kannan Soundararajan:
Shapley Values in Weighted Voting Games with Random Weights. CoRR abs/1601.06223 (2016) - 2015
- [c9]Omer Lev, Joel Oren, Craig Boutilier, Jeffrey S. Rosenschein:
The Pricing War Continues: On Competitive Multi-Item Pricing. AAAI 2015: 972-978 - [c8]Brendan Lucier, Joel Oren, Yaron Singer:
Influence at Scale: Distributed Computation of Complex Contagion in Networks. KDD 2015: 735-744 - 2014
- [c7]Craig Boutilier, Jérôme Lang, Joel Oren, Héctor Palacios:
Robust Winners and Winner Determination Policies under Candidate Uncertainty. AAAI 2014: 1391-1397 - [c6]Joel Oren, Brendan Lucier:
Online (Budgeted) Social Choice. AAAI 2014: 1456-1462 - [c5]Joel Oren, Nina Narodytska, Craig Boutilier:
A Game-Theoretic Analysis of Catalog Optimization. AAAI 2014: 1463-1470 - [c4]Yuval Filmus, Joel Oren:
Efficient voting via the top-k elicitation scheme: a probabilistic approach. EC 2014: 295-312 - [i4]Omer Lev, Joel Oren, Craig Boutilier, Jeffrey S. Rosenschein:
The Pricing War Continues: On Competitive Multi-Item Pricing. CoRR abs/1408.0258 (2014) - [i3]Joel Oren, Yuval Filmus, Yair Zick, Yoram Bachrach:
Power Distribution in Randomized Weighted Voting: the Effects of the Quota. CoRR abs/1408.0442 (2014) - 2013
- [c3]Joel Oren, Yuval Filmus, Craig Boutilier:
Efficient Vote Elicitation under Candidate Uncertainty. IJCAI 2013: 309-316 - [c2]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof mechanisms for competitive influence in networks. WWW 2013: 141-150 - 2012
- [i2]Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Truthful Mechanisms for Competing Submodular Processes. CoRR abs/1202.2097 (2012) - 2011
- [i1]Siavosh Benabbas, Hyun Chul Lee, Joel Oren, Yuli Ye:
Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm. CoRR abs/1108.1751 (2011) - 2010
- [c1]Allan Borodin, Yuval Filmus, Joel Oren:
Threshold Models for Competitive Influence in Social Networks. WINE 2010: 539-550
1990 – 1999
- 1993
- [j1]Gowri Ramanathan, Joel Oren:
Survey of commercial parallel machines. SIGARCH Comput. Archit. News 21(3): 13-33 (1993)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint