| Publication | Date of Publication | Type |
|---|
| Optimality despite chaos in fee markets | 2024-07-17 | Paper |
Memory loss can prevent chaos in games dynamics
Chaos | 2024-05-25 | Paper |
Market Equilibria and Risk Diversification in Blockchain Mining Economies
Mathematical Research for Blockchain Economy | 2024-02-15 | Paper |
Griefing Factors and Evolutionary In-Stabilities in Blockchain Mining Games
Mathematical Research for Blockchain Economy | 2024-02-15 | Paper |
A stochastic variant of replicator dynamics in zero-sum games and its invariant measures
Physica D | 2023-11-17 | Paper |
Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
Algorithmic Game Theory | 2023-07-28 | Paper |
Data-driven models of selfish routing: why price of anarchy does depend on network topology
(available as arXiv preprint) | 2023-03-21 | Paper |
| Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps | 2023-01-10 | Paper |
Evolutionary Dynamics and Phi-Regret Minimization in Games
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
Wealth Inequality and the Price of Anarchy
(available as arXiv preprint) | 2022-07-18 | Paper |
Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory
Artificial Intelligence | 2022-03-02 | Paper |
Broken detailed balance and non-equilibrium dynamics in noisy social learning models
Physica A | 2022-01-18 | Paper |
Family of chaotic maps from game theory
Dynamical Systems | 2021-06-22 | Paper |
Learning dynamics and the co-evolution of competing sexual species
(available as arXiv preprint) | 2021-06-15 | Paper |
Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory
(available as arXiv preprint) | 2020-12-05 | Paper |
From Darwin to Poincaré and von Neumann: recurrence and cycles in evolutionary and algorithmic game theory
(available as arXiv preprint) | 2020-06-30 | Paper |
Oceanic Games: Centralization Risks and Incentives in Blockchain Mining
Mathematical Research for Blockchain Economy | 2020-06-29 | Paper |
First-order methods almost always avoid strict saddle points
Mathematical Programming. Series A. Series B | 2019-06-26 | Paper |
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| First-order methods almost always avoid saddle points: the case of vanishing step-sizes | 2019-06-18 | Paper |
Routing games in the wild: efficiency, equilibration and regret. Large-scale field experiments in Singapore
Web and Internet Economics | 2019-01-30 | Paper |
| Multiplicative Weights Update as a Distributed Constrained Optimization Algorithm: Convergence to Second-order Stationary Points Almost Always | 2018-10-12 | Paper |
Bifurcation mechanism design -- from optimal flat taxes to better cancer treatments
Games | 2018-07-10 | Paper |
Mutation, Sexual Reproduction and Survival in Dynamic Environments
(available as arXiv preprint) | 2018-05-03 | Paper |
Gradient descent only converges to minimizers: non-isolated critical points and invariant regions
(available as arXiv preprint) | 2018-05-03 | Paper |
| Cycles in adversarial regularized learning | 2018-03-15 | Paper |
Cycles in adversarial regularized learning
(available as arXiv preprint) | 2018-03-15 | Paper |
The computational complexity of genetic diversity
(available as arXiv preprint) | 2018-03-02 | Paper |
From Nash equilibria to chain recurrent sets: solution concepts and topology
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Approximating Nash equilibria in tree polymatrix games
Algorithmic Game Theory | 2015-11-04 | Paper |
Approximating Nash equilibria in tree polymatrix games
Algorithmic Game Theory | 2015-11-04 | Paper |
LP-based covering games with low price of anarchy
Theory of Computing Systems | 2015-09-04 | Paper |
LP-based covering games with low price of anarchy
Theory of Computing Systems | 2015-09-04 | Paper |
Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics | 2014-08-26 | Paper |
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Load balancing without regret in the bulletin board model
Distributed Computing | 2012-02-06 | Paper |
No regret learning in oligopolies: Cournot vs. Bertrand
Algorithmic Game Theory | 2010-10-19 | Paper |
