| Publication | Date of Publication | Type |
|---|
The complexity of gradient descent: CLS = PPAD \(\cap\) pls
Journal of the ACM | 2024-07-04 | Paper |
Constant inapproximability for PPA
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | 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 |
Efficient parallel strategy improvement for parity games
(available as arXiv preprint) | 2022-08-12 | Paper |
| Unique End of Potential Line | 2022-07-21 | Paper |
| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem | 2022-07-21 | Paper |
Approximating the existential theory of the reals
Journal of Computer and System Sciences | 2022-01-31 | 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 |
| Playing Muller games in a hurry | 2021-02-16 | Paper |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
Journal of Computer and System Sciences | 2021-02-02 | 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 |
Lipschitz continuity and approximate equilibria
Algorithmica | 2020-10-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 |
Approximating the existential theory of the reals
Web and Internet Economics | 2020-06-18 | Paper |
Hiring secretaries over time: the benefit of concurrent employment
Mathematics of Operations Research | 2020-04-30 | Paper |
Distributed methods for computing approximate equilibria
Algorithmica | 2019-03-11 | 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 |
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 |
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 |
Lipschitz continuity and approximate equilibria
Algorithmic Game Theory | 2016-09-29 | Paper |
Efficient approximation of optimal control for continuous-time Markov games
Information and Computation | 2016-03-10 | 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 |
Synthesis of succinct systems
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Reachability in two-clock timed automata is PSPACE-complete
Information and Computation | 2015-06-09 | Paper |
Computing approximate Nash equilibria in polymatrix games
Web and Internet Economics | 2015-01-07 | Paper |
Reachability in two-clock timed automata is PSPACE-complete
Automata, Languages, and Programming | 2013-08-07 | Paper |
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
Logical Methods in Computer Science | 2013-06-20 | Paper |
Approximate well-supported Nash equilibria below two-thirds
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Bounded satisfiability for PCTL
(available as arXiv preprint) | 2012-11-22 | Paper |
Synthesis of succinct systems
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Time and parallelizability results for parity games with bounded treewidth
Automata, Languages, and Programming | 2012-11-01 | Paper |
Efficient approximation of optimal control for continuous-time Markov games
(available as arXiv preprint) | 2012-08-31 | Paper |
Playing Muller games in a hurry
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Parity Games on Graphs with Medium Tree-Width
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Non-oblivious strategy improvement
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Exponential lower bounds for policy iteration
Automata, Languages and Programming | 2010-09-07 | Paper |
Linear complementarity algorithms for infinite games
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
