| Publication | Date of Publication | Type |
|---|
| PPAD-complete approximate pure Nash equilibria in Lipschitz games | 2023-11-17 | Paper |
| The complexity of gradient descent: CLS = PPAD ∩ PLS | 2023-11-14 | Paper |
| Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy | 2023-07-28 | Paper |
| PPAD-complete pure approximate Nash equilibria in Lipschitz games | 2023-07-28 | Paper |
| Lower bounds for the query complexity of equilibria in Lipschitz games | 2023-06-01 | Paper |
| Consensus halving for sets of items | 2023-03-21 | Paper |
| Learning strong substitutes demand via queries | 2023-03-21 | Paper |
| Consensus Halving for Sets of Items | 2023-01-09 | Paper |
| The Hairy Ball Problem is PPAD-Complete. | 2022-07-21 | Paper |
| Lower bounds for the query complexity of equilibria in Lipschitz games | 2022-06-01 | Paper |
| The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich | 2022-03-11 | Paper |
| The Hairy Ball problem is PPAD-complete | 2021-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005124 | 2021-08-04 | Paper |
| Towards a Unified Complexity Theory of Total Functions | 2021-06-15 | Paper |
| Contiguous Cake Cutting: Hardness Results and Approximation Algorithms | 2020-11-03 | Paper |
| Learning convex partitions and computing game-theoretic equilibria from best response queries | 2020-06-18 | Paper |
| The complexity of splitting necklaces and bisecting ham sandwiches | 2020-01-30 | Paper |
| Multi‐Unit Bayesian Auction with Demand or Budget Constraints | 2019-11-27 | Paper |
| Consensus halving is PPA-complete | 2019-08-22 | Paper |
| Logarithmic query complexity for approximate Nash computation in large games | 2019-03-21 | Paper |
| Fixed Price Approximability of the Optimal Gain from Trade | 2019-01-30 | Paper |
| Equilibria in sequential allocation | 2018-10-25 | Paper |
| Towards a unified complexity theory of total functions | 2018-04-18 | Paper |
| Query complexity of approximate equilibria in anonymous games | 2017-09-15 | Paper |
| TFNP: An Update | 2017-07-21 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2016-10-21 | Paper |
| Logarithmic Query Complexity for Approximate Nash Computation in Large Games | 2016-09-29 | Paper |
| Revenue Maximization for Market Intermediation with Correlated Priors | 2016-09-29 | Paper |
| Decentralized dynamics for finite opinion games | 2016-09-12 | Paper |
| On revenue maximization with sharp multi-unit demands | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5744805 | 2016-02-19 | Paper |
| Query Complexity of Approximate Equilibria in Anonymous Games | 2016-01-08 | Paper |
| Auction Design with a Revenue Target | 2015-11-04 | Paper |
| Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game | 2015-08-03 | Paper |
| Reducibility among equilibrium problems | 2014-11-25 | Paper |
| The complexity of computing a Nash equilibrium | 2014-11-25 | Paper |
| The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions | 2014-07-30 | Paper |
| Revenue maximization in a Bayesian double auction market | 2014-06-06 | Paper |
| On the communication complexity of approximate Nash equilibria | 2014-04-01 | Paper |
| On the approximation performance of fictitious play in finite games | 2013-11-11 | Paper |
| Pricing Ad Slots with Consecutive Multi-unit Demand | 2013-10-23 | Paper |
| Shortest Paths with Bundles and Non-additive Weights Is Hard | 2013-06-07 | Paper |
| Ranking games that have competitiveness-based strategies | 2013-04-17 | Paper |
| Revenue Maximization in a Bayesian Double Auction Market | 2013-03-21 | Paper |
| Approximate well-supported Nash equilibria below two-thirds | 2013-03-13 | Paper |
| On the communication complexity of approximate Nash equilibria | 2013-03-13 | Paper |
| Decentralized Dynamics for Finite Opinion Games | 2013-03-13 | Paper |
| Commodity Auctions and Frugality Ratios | 2013-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093345 | 2011-10-12 | Paper |
| On the approximation performance of fictitious play in finite games | 2011-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089367 | 2011-08-24 | Paper |
| Uncoordinated Two-Sided Matching Markets | 2011-05-17 | Paper |
| How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? | 2010-10-19 | Paper |
| Distributed selfish load balancing | 2010-08-16 | Paper |
| A Unified Approach to Congestion Games and Two-Sided Markets | 2010-07-09 | Paper |
| The Complexity of Computing a Nash Equilibrium | 2010-03-17 | Paper |
| On the computational complexity of weighted voting games | 2010-03-15 | Paper |
| A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications | 2009-08-14 | Paper |
| Distributed Selfish Load Balancing | 2008-08-14 | Paper |
| PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance | 2007-12-19 | Paper |
| A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment | 2007-05-22 | Paper |
| Utilitarian resource assignment | 2007-02-14 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737705 | 2004-08-11 | Paper |
| Learning fixed-dimension linear thresholds from fragmented data | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4781227 | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148812 | 2002-09-22 | Paper |
| The Complexity of Gene Placement | 2002-07-08 | Paper |
| Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252311 | 1999-09-15 | Paper |
| Exact Learning of Discretized Geometric Concepts | 1998-09-21 | Paper |
| Constructing Computer Virus Phylogenies | 1998-02-09 | Paper |
| Minimizing phylogenetic number to find good evolutionary trees | 1998-02-02 | Paper |
| Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers | 1995-10-29 | Paper |
