| Publication | Date of Publication | Type |
|---|
Improved bounds for single-nomination impartial selection
Mathematics of Operations Research | 2026-06-12 | Paper |
| Unknown i.i.d. prophets: better bounds, streaming algorithms, and a new impossibility (extended abstract) | 2026-04-15 | Paper |
Nontruthful position auctions are more robust to misspecification
Mathematics of Operations Research | 2024-06-27 | Paper |
Impartial selection with additive guarantees via iterated deletion
Games and Economic Behavior | 2024-04-30 | Paper |
Optimal impartial correspondences
Web and Internet Economics | 2023-08-04 | Paper |
Prophet inequalities for independent and identically distributed random variables from an unknown distribution
Mathematics of Operations Research | 2022-06-27 | Paper |
| Weighted tournament solutions | 2020-11-12 | Paper |
Expressiveness and robustness of first-price position auctions
Mathematics of Operations Research | 2020-03-12 | Paper |
Expressiveness and robustness of first-price position auctions
Mathematics of Operations Research | 2020-03-12 | Paper |
On index policies for stochastic minsum scheduling
Operations Research Letters | 2020-02-10 | Paper |
Impartial Selection and the Power of up to Two Choices
Web and Internet Economics | 2016-01-08 | Paper |
Possible and necessary winners of partial tournaments
Journal of Artificial Intelligence Research | 2016-01-07 | Paper |
Optimal impartial selection
SIAM Journal on Computing | 2015-11-04 | Paper |
Optimal impartial selection
SIAM Journal on Computing | 2015-11-04 | Paper |
Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
Games and Economic Behavior | 2015-06-08 | Paper |
Minimal retentive sets in tournaments
Social Choice and Welfare | 2014-12-15 | Paper |
On the rate of convergence of fictitious play
Theory of Computing Systems | 2013-10-21 | Paper |
The complexity of computing minimal unidirectional covering sets
Theory of Computing Systems | 2013-10-21 | Paper |
| Communication attitudes: a formal approach to ostensible intentions, and individual and group opinions | 2013-10-07 | Paper |
| On iterated dominance, matrix elimination, and matched paths | 2012-01-23 | Paper |
On the complexity of iterated weak dominance in constant-sum games
Theory of Computing Systems | 2011-11-23 | Paper |
The computational complexity of weak saddles
Theory of Computing Systems | 2011-11-23 | Paper |
A new perspective on implementation by voting trees
Random Structures & Algorithms | 2011-08-09 | Paper |
Equilibria of graphical games with symmetries
Theoretical Computer Science | 2011-02-21 | Paper |
On the rate of convergence of fictitious play
Algorithmic Game Theory | 2010-10-19 | Paper |
Incentive compatible regression learning
Journal of Computer and System Sciences | 2010-10-07 | Paper |
| scientific article; zbMATH DE number 5764824 (Why is no real title available?) | 2010-08-06 | Paper |
The complexity of computing minimal unidirectional covering sets
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A computational analysis of the tournament equilibrium set
Social Choice and Welfare | 2010-04-21 | Paper |
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Information Processing Letters | 2010-01-29 | Paper |
On the complexity of iterated weak dominance in constant-sum games
Algorithmic Game Theory | 2009-12-01 | Paper |
The computational complexity of weak saddles
Algorithmic Game Theory | 2009-12-01 | Paper |
Ranking games
Artificial Intelligence | 2009-08-31 | Paper |
The Computational Complexity of Choice Sets
Mathematical Logic Quarterly | 2009-08-14 | Paper |
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences | 2009-03-02 | Paper |
Computing the minimal covering set
Mathematical Social Sciences | 2008-09-10 | Paper |
On the Hardness and Existence of Quasi-Strict Equilibria
Algorithmic Game Theory | 2008-05-02 | Paper |
Symmetries and the Complexity of Pure Nash Equilibrium
STACS 2007 | 2007-09-03 | Paper |
