| Publication | Date of Publication | Type |
|---|
| Exponentially many steps for finding a Nash equilibrium in a bimatrix game | 2026-05-29 | Paper |
| A faster algorithm for finding Tarski fixed points | 2026-04-21 | Paper |
| Tree polymatrix games are PPAD-hard | 2026-03-18 | Paper |
| Two choices are enough for P-LCPs, USOs, and colorful tangents | 2026-01-14 | Paper |
The complexity of computing KKT solutions of quadratic programs
Journal of the ACM | 2025-11-27 | Paper |
The complexity of gradient descent: CLS = PPAD \(\cap\) pls
Journal of the ACM | 2024-07-04 | Paper |
| The complexity of gradient descent (invited talk) | 2024-02-05 | Paper |
The complexity of gradient descent: CLS = PPAD ∩ PLS
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
The complexity of gradient descent: CLS = PPAD ∩ PLS
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
A Faster Algorithm for Finding Tarski Fixed Points
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Unique End of Potential Line | 2022-07-21 | Paper |
| Reachability Switching Games | 2021-07-28 | Paper |
Reachability switching games
(available as arXiv preprint) | 2021-05-25 | Paper |
| Reachability switching games | 2021-05-25 | Paper |
One-Clock Priced Timed Games are PSPACE-hard
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Hedonic games | 2020-11-12 | Paper |
Unique end of potential line
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Unique end of potential line
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
Mathematics of Operations Research | 2020-04-30 | Paper |
Distributed methods for computing approximate equilibria
Algorithmica | 2019-03-11 | Paper |
The complexity of all-switches strategy improvement
(available as arXiv preprint) | 2018-11-02 | Paper |
Inapproximability results for constrained approximate Nash equilibria
Information and Computation | 2018-09-27 | Paper |
Unit vector games
International Journal of Economic Theory | 2018-09-04 | Paper |
Unit vector games
International Journal of Economic Theory | 2018-09-04 | Paper |
Space debris removal: a game theoretic analysis
Games | 2018-08-01 | Paper |
The complexity of all-switches strategy improvement
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computing constrained approximate equilibria in polymatrix games
(available as arXiv preprint) | 2018-02-13 | Paper |
Computing approximate Nash equilibria in polymatrix games
Algorithmica | 2017-03-03 | Paper |
Inapproximability results for approximate Nash equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Approximate well-supported Nash equilibria below two-thirds
Algorithmica | 2016-10-21 | Paper |
| Learning equilibria of games via payoff queries | 2016-02-19 | Paper |
Learning equilibria of games via payoff queries
(available as arXiv preprint) | 2016-02-19 | Paper |
The complexity of the simplex method
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Game Theory Explorer: software for the applied game theorist
Computational Management Science | 2015-07-29 | Paper |
Game Theory Explorer: software for the applied game theorist
Computational Management Science | 2015-07-29 | Paper |
Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3
Web and Internet Economics | 2015-01-12 | Paper |
Computing approximate Nash equilibria in polymatrix games
Web and Internet Economics | 2015-01-07 | Paper |
The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On the approximation performance of fictitious play in finite games
International Journal of Game Theory | 2013-11-11 | Paper |
Approximate well-supported Nash equilibria below two-thirds
Lecture Notes in Computer Science | 2013-03-13 | Paper |
On the approximation performance of fictitious play in finite games
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Computing Stable Outcomes in Hedonic Games
Algorithmic Game Theory | 2010-10-19 | Paper |
Enumeration of Nash equilibria for two-player games
Economic Theory | 2010-02-19 | Paper |
Linear complementarity algorithms for infinite games
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Power Indices in Spanning Connectivity Games
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Good neighbors are hard to find: Computational complexity of network formation
Review of Economic Design | 2008-07-31 | Paper |
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Hard-to-Solve Bimatrix Games
Econometrica | 2006-09-25 | Paper |
