| Publication | Date of Publication | Type |
|---|
| A proof of the Nisan-Ronen conjecture | 2024-05-08 | Paper |
Resource-Aware Cost-Sharing Methods for Scheduling Games
Operations Research | 2024-03-20 | Paper |
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
Mathematics of Operations Research | 2024-02-23 | Paper |
Impartial selection with additive approximation guarantees
Theory of Computing Systems | 2022-06-21 | Paper |
| The price of stability of weighted congestion games | 2021-07-28 | Paper |
On the Nisan-Ronen conjecture for submodular valuations
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Impartial selection with additive approximation guarantees
Algorithmic Game Theory | 2020-02-04 | Paper |
Impartial selection with additive approximation guarantees
Algorithmic Game Theory | 2020-02-04 | Paper |
The price of stability of weighted congestion games
SIAM Journal on Computing | 2019-11-08 | Paper |
The price of stability of weighted congestion games
SIAM Journal on Computing | 2019-11-08 | Paper |
Designing networks with good equilibria under uncertainty
SIAM Journal on Computing | 2019-09-02 | Paper |
Designing cost-sharing methods for Bayesian games
Theory of Computing Systems | 2019-03-21 | Paper |
Strategic contention resolution in multiple channels
(available as arXiv preprint) | 2019-01-15 | Paper |
| Short paper: Strategic contention resolution in multiple channels with limited feedback | 2018-11-08 | Paper |
An improved envy-free cake cutting protocol for four agents
(available as arXiv preprint) | 2018-11-08 | Paper |
| An improved envy-free cake cutting protocol for four agents | 2018-11-08 | Paper |
Strategic Contention Resolution in Multiple Channels
(available as arXiv preprint) | 2018-10-10 | Paper |
Bayesian combinatorial auctions
Journal of the ACM | 2018-08-02 | Paper |
Designing networks with good equilibria under uncertainty
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An improved upper bound for the universal TSP on the grid
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the efficiency of all-pay mechanisms
Algorithmica | 2018-05-23 | Paper |
Strategic contention resolution with limited feedback
(available as arXiv preprint) | 2018-03-02 | Paper |
A 3-player protocol preventing persistence in strategic contention with limited feedback
(available as arXiv preprint) | 2018-02-13 | Paper |
On the efficiency of the proportional allocation mechanism for divisible resources
Theory of Computing Systems | 2017-02-01 | Paper |
Designing cost-sharing methods for Bayesian games
Algorithmic Game Theory | 2016-09-29 | Paper |
Mechanisms for scheduling with single-bit private values
Theory of Computing Systems | 2016-01-13 | Paper |
On the efficiency of all-pay mechanisms
Algorithms - ESA 2015 | 2015-11-19 | Paper |
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
Algorithmic Game Theory | 2015-11-04 | Paper |
Contention resolution under selfishness
Algorithmica | 2015-01-19 | Paper |
| A lower bound for scheduling mechanisms | 2014-12-18 | Paper |
Mechanism design for fractional scheduling on unrelated machines
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| scientific article; zbMATH DE number 6297764 (Why is no real title available?) | 2014-05-22 | Paper |
A truthful constant approximation for maximizing the minimum load on related machines
Theoretical Computer Science | 2013-12-19 | Paper |
A deterministic truthful PTAS for scheduling related machines
SIAM Journal on Computing | 2013-11-14 | Paper |
Price of stability in polynomial congestion games
Automata, Languages, and Programming | 2013-08-07 | Paper |
Mechanisms for scheduling with single-bit private values
Algorithmic Game Theory | 2013-03-13 | Paper |
Convergence and approximation in potential games
Theoretical Computer Science | 2012-08-08 | Paper |
Improving the price of anarchy for selfish routing via coordination mechanisms
Lecture Notes in Computer Science | 2011-09-16 | Paper |
On the performance of approximate equilibria in congestion games
Algorithmica | 2011-08-16 | Paper |
| scientific article; zbMATH DE number 5842466 (Why is no real title available?) | 2011-01-28 | Paper |
Contention resolution under selfishness
Automata, Languages and Programming | 2010-09-07 | Paper |
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the price of stability for undirected network design
Approximation and Online Algorithms | 2010-05-11 | Paper |
On the Performance of Approximate Equilibria in Congestion Games
Lecture Notes in Computer Science | 2009-10-29 | Paper |
A lower bound for scheduling mechanisms
Algorithmica | 2009-10-23 | Paper |
Coordination mechanisms
Theoretical Computer Science | 2009-08-21 | Paper |
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the entrainment coefficient in negatively buoyant jets
Journal of Fluid Mechanics | 2009-02-09 | Paper |
A Characterization of 2-Player Mechanisms for Scheduling
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Bayesian Combinatorial Auctions
Automata, Languages and Programming | 2008-08-28 | Paper |
Convergence and Approximation in Potential Games
STACS 2006 | 2008-03-19 | Paper |
Mechanism Design for Fractional Scheduling on Unrelated Machines
Automata, Languages and Programming | 2007-11-28 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 1023468 (Why is no real title available?) | 1998-03-30 | Paper |
