3 citations · 7 across the 5 of their papers we have counts for
6 papers · 1 filter
Peer Selection with Noisy Assessments
Omer Lev, Nicholas Mattei, Paolo Turrini +1
In the peer selection problem a group of agents must select a subset of themselves as winners for, e.g., peer-reviewed grants or prizes. Here, we take a Condorcet view of this aggr…
The Price is (Probably) Right: Learning Market Equilibria from Samples
Vignesh Viswanathan, Omer Lev, Neel Patel +1
Equilibrium computation in markets usually considers settings where player valuation functions are known. We consider the setting where player valuations are unknown; using a PAC l…
Selecting Voting Locations for Fun and Profit
Zack Fitzsimmons, Omer Lev
While manipulative attacks on elections have been well-studied, only recently has attention turned to attacks that account for geographic information, which are extremely common in…
Heuristic Voting as Ordinal Dominance Strategies
Omer Lev, Reshef Meir, Svetlana Obraztsova +1
Decision making under uncertainty is a key component of many AI settings, and in particular of voting scenarios where strategic agents are trying to reach a joint decision. The com…
Agent Failures in All-Pay Auctions
Yoad Lewenberg, Omer Lev, Yoram Bachrach +1
All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the a…
An Axiomatic Approach to Routing
Omer Lev, Moshe Tennenholtz, Aviv Zohar
Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner. The delivery of information in such mul…