| Publication | Date of Publication | Type |
|---|
Solving strong-substitutes product-mix auctions
Mathematics of Operations Research | 2024-11-07 | Paper |
| Consensus division in an arbitrary ratio | 2024-09-25 | Paper |
The complexity of gradient descent: CLS = PPAD \(\cap\) pls
Journal of the ACM | 2024-07-04 | Paper |
| The frontier of intractability for EFX with two agents | 2024-05-29 | Paper |
PPAD-complete approximate pure Nash equilibria in Lipschitz games
Theoretical Computer Science | 2023-11-17 | 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 |
Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy
Algorithmic Game Theory | 2023-07-28 | Paper |
PPAD-complete pure approximate Nash equilibria in Lipschitz games
Algorithmic Game Theory | 2023-07-28 | Paper |
Lower bounds for the query complexity of equilibria in Lipschitz games
Theoretical Computer Science | 2023-06-01 | Paper |
| Consensus halving for sets of items | 2023-03-21 | Paper |
Learning strong substitutes demand via queries
(available as arXiv preprint) | 2023-03-21 | Paper |
Consensus Halving for Sets of Items
Mathematics of Operations Research | 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
(available as arXiv preprint) | 2022-06-01 | Paper |
The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
SIAM Journal on Computing | 2022-03-11 | Paper |
The Hairy Ball problem is PPAD-complete
Journal of Computer and System Sciences | 2021-09-17 | Paper |
The Hairy Ball problem is PPAD-complete
Journal of Computer and System Sciences | 2021-09-17 | Paper |
Hardness results for consensus-halving
(available as arXiv preprint) | 2021-08-04 | Paper |
| Towards a Unified Complexity Theory of Total Functions | 2021-06-15 | Paper |
Contiguous cake cutting: hardness results and approximation algorithms
Journal of Artificial Intelligence Research | 2020-11-03 | Paper |
Learning convex partitions and computing game-theoretic equilibria from best response queries
(available as arXiv preprint) | 2020-06-18 | Paper |
The complexity of splitting necklaces and bisecting ham sandwiches
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The complexity of splitting necklaces and bisecting ham sandwiches
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Multi-unit Bayesian auction with demand or budget constraints
Computational Intelligence | 2019-11-27 | Paper |
Consensus halving is PPA-complete
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Logarithmic query complexity for approximate Nash computation in large games
Theory of Computing Systems | 2019-03-21 | Paper |
Fixed price approximability of the optimal gain from trade
Web and Internet Economics | 2019-01-30 | Paper |
Equilibria in sequential allocation
(available as arXiv preprint) | 2018-10-25 | Paper |
Towards a unified complexity theory of total functions
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Query complexity of approximate equilibria in anonymous games
Journal of Computer and System Sciences | 2017-09-15 | Paper |
TFNP: an update
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Approximate well-supported Nash equilibria below two-thirds
Algorithmica | 2016-10-21 | Paper |
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Algorithmic Game Theory | 2016-09-29 | Paper |
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Algorithmic Game Theory | 2016-09-29 | Paper |
Revenue maximization for market intermediation with correlated priors
Algorithmic Game Theory | 2016-09-29 | Paper |
Decentralized dynamics for finite opinion games
Theoretical Computer Science | 2016-09-12 | Paper |
On revenue maximization with sharp multi-unit demands
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
On revenue maximization with sharp multi-unit demands
Journal of Combinatorial Optimization | 2016-04-13 | 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 |
Query complexity of approximate equilibria in anonymous games
Web and Internet Economics | 2016-01-08 | Paper |
Auction design with a revenue target
Algorithmic Game Theory | 2015-11-04 | Paper |
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | 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 |
Revenue maximization in a Bayesian double auction market
Theoretical Computer Science | 2014-06-06 | Paper |
On the communication complexity of approximate Nash equilibria
Games and Economic Behavior | 2014-04-01 | Paper |
On the approximation performance of fictitious play in finite games
International Journal of Game Theory | 2013-11-11 | Paper |
Pricing ad slots with consecutive multi-unit demand
Algorithmic Game Theory | 2013-10-23 | Paper |
Shortest Paths with Bundles and Non-additive Weights Is Hard
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Ranking games that have competitiveness-based strategies
Theoretical Computer Science | 2013-04-17 | Paper |
Revenue maximization in a Bayesian double auction market
Algorithms and Computation | 2013-03-21 | Paper |
Decentralized dynamics for finite opinion games
Algorithmic Game Theory | 2013-03-13 | Paper |
Commodity auctions and frugality ratios
Algorithmic Game Theory | 2013-03-13 | Paper |
Approximate well-supported Nash equilibria below two-thirds
Lecture Notes in Computer Science | 2013-03-13 | Paper |
On the communication complexity of approximate Nash equilibria
Lecture Notes in Computer Science | 2013-03-13 | Paper |
| scientific article; zbMATH DE number 5957329 (Why is no real title available?) | 2011-10-12 | Paper |
On the approximation performance of fictitious play in finite games
Lecture Notes in Computer Science | 2011-09-16 | Paper |
| scientific article; zbMATH DE number 5942357 (Why is no real title available?) | 2011-08-24 | Paper |
Uncoordinated two-sided matching markets
SIAM Journal on Computing | 2011-05-17 | Paper |
How do you like your equilibrium selection problems? Hard, or very hard?
Algorithmic Game Theory | 2010-10-19 | Paper |
Distributed selfish load balancing
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A unified approach to congestion games and two-sided markets
Internet Mathematics | 2010-07-09 | Paper |
The complexity of computing a Nash equilibrium
SIAM Journal on Computing | 2010-03-17 | Paper |
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence | 2010-03-15 | Paper |
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
Mathematical Logic Quarterly | 2009-08-14 | Paper |
Distributed Selfish Load Balancing
SIAM Journal on Computing | 2008-08-14 | Paper |
Distributed Selfish Load Balancing
SIAM Journal on Computing | 2008-08-14 | Paper |
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Theoretical Computer Science | 2007-12-19 | Paper |
A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Utilitarian resource assignment
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
| scientific article; zbMATH DE number 2087058 (Why is no real title available?) | 2004-08-11 | Paper |
Learning fixed-dimension linear thresholds from fragmented data
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1827089 (Why is no real title available?) | 2002-11-12 | Paper |
| scientific article; zbMATH DE number 1804110 (Why is no real title available?) | 2002-09-22 | Paper |
The complexity of gene placement
Journal of Algorithms | 2002-07-08 | Paper |
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1305428 (Why is no real title available?) | 1999-09-15 | Paper |
Exact Learning of Discretized Geometric Concepts
SIAM Journal on Computing | 1998-09-21 | Paper |
Constructing Computer Virus Phylogenies
Journal of Algorithms | 1998-02-09 | Paper |
Minimizing phylogenetic number to find good evolutionary trees
Discrete Applied Mathematics | 1998-02-02 | Paper |
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Machine Learning | 1995-10-29 | Paper |
