| Publication | Date of Publication | Type |
|---|
| The complexity of gradient descent: CLS = PPAD \(\cap\) pls | 2024-07-04 | Paper |
| Constant inapproximability for PPA | 2023-12-08 | Paper |
| The complexity of gradient descent: CLS = PPAD ∩ PLS | 2023-11-14 | Paper |
| A Faster Algorithm for Finding Tarski Fixed Points | 2023-10-31 | Paper |
| Efficient parallel strategy improvement for parity games | 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 | 2022-01-31 | Paper |
| Reachability Switching Games | 2021-07-28 | 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 | 2021-02-02 | Paper |
| One-Clock Priced Timed Games are PSPACE-hard | 2021-01-21 | Paper |
| Lipschitz continuity and approximate equilibria | 2020-10-12 | Paper |
| Unique end of potential line | 2020-09-07 | Paper |
| Approximating the existential theory of the reals | 2020-06-18 | Paper |
| Hiring secretaries over time: the benefit of concurrent employment | 2020-04-30 | Paper |
| Distributed methods for computing approximate equilibria | 2019-03-11 | Paper |
| An improved envy-free cake cutting protocol for four agents | 2018-11-08 | Paper |
| The complexity of all-switches strategy improvement | 2018-11-02 | Paper |
| Inapproximability results for constrained approximate Nash equilibria | 2018-09-27 | Paper |
| The complexity of all-switches strategy improvement | 2018-07-16 | Paper |
| Computing constrained approximate equilibria in polymatrix games | 2018-02-13 | Paper |
| Computing approximate Nash equilibria in polymatrix games | 2017-03-03 | Paper |
| Inapproximability results for approximate Nash equilibria | 2017-02-10 | Paper |
| Distributed Methods for Computing Approximate Equilibria | 2017-02-10 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2016-10-21 | Paper |
| Lipschitz continuity and approximate equilibria | 2016-09-29 | Paper |
| Efficient approximation of optimal control for continuous-time Markov games | 2016-03-10 | Paper |
| Learning equilibria of games via payoff queries | 2016-02-19 | Paper |
| The complexity of the simplex method | 2015-08-21 | Paper |
| Synthesis of succinct systems | 2015-07-13 | Paper |
| Reachability in two-clock timed automata is PSPACE-complete | 2015-06-09 | Paper |
| Computing approximate Nash equilibria in polymatrix games | 2015-01-07 | Paper |
| Reachability in two-clock timed automata is PSPACE-complete | 2013-08-07 | Paper |
| Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width | 2013-06-20 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2013-03-13 | Paper |
| Bounded satisfiability for PCTL | 2012-11-22 | Paper |
| Synthesis of succinct systems | 2012-11-21 | Paper |
| Time and parallelizability results for parity games with bounded treewidth | 2012-11-01 | Paper |
| Efficient approximation of optimal control for continuous-time Markov games | 2012-08-31 | Paper |
| Playing Muller games in a hurry | 2012-08-30 | Paper |
| Parity Games on Graphs with Medium Tree-Width | 2011-08-17 | Paper |
| Non-oblivious strategy improvement | 2011-01-07 | Paper |
| Exponential lower bounds for policy iteration | 2010-09-07 | Paper |
| Linear complementarity algorithms for infinite games | 2010-01-28 | Paper |
