| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187016 | 2024-02-05 | 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 |
| Unique End of Potential Line | 2022-07-21 | Paper |
| Reachability Switching Games | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4989405 | 2021-05-25 | Paper |
| One-Clock Priced Timed Games are PSPACE-hard | 2021-01-21 | Paper |
| Hedonic Games | 2020-11-12 | Paper |
| Unique end of potential line | 2020-09-07 | Paper |
| Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games | 2020-04-30 | Paper |
| Distributed methods for computing approximate equilibria | 2019-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553289 | 2018-11-02 | Paper |
| Inapproximability results for constrained approximate Nash equilibria | 2018-09-27 | Paper |
| Unit vector games | 2018-09-04 | Paper |
| Space debris removal: a game theoretic analysis | 2018-08-01 | 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 |
| Distributed Methods for Computing Approximate Equilibria | 2017-02-10 | Paper |
| Inapproximability Results for Approximate Nash Equilibria | 2017-02-10 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2016-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5744805 | 2016-02-19 | Paper |
| The Complexity of the Simplex Method | 2015-08-21 | Paper |
| Game Theory Explorer: software for the applied game theorist | 2015-07-29 | Paper |
| Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 | 2015-01-12 | Paper |
| Computing Approximate Nash Equilibria in Polymatrix Games | 2015-01-07 | Paper |
| The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions | 2014-07-30 | Paper |
| On the approximation performance of fictitious play in finite games | 2013-11-11 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2013-03-13 | Paper |
| On the approximation performance of fictitious play in finite games | 2011-09-16 | Paper |
| Computing Stable Outcomes in Hedonic Games | 2010-10-19 | Paper |
| Enumeration of Nash equilibria for two-player games | 2010-02-19 | Paper |
| Linear Complementarity Algorithms for Infinite Games | 2010-01-28 | Paper |
| Power Indices in Spanning Connectivity Games | 2009-07-02 | Paper |
| Good neighbors are hard to find: Computational complexity of network formation | 2008-07-31 | Paper |
| A Simple P-Matrix Linear Complementarity Problem for Discounted Games | 2008-06-19 | Paper |
| Hard-to-Solve Bimatrix Games | 2006-09-25 | Paper |
