Publications

Wealth Inequality and the Price of Anarchy
with Elias Koutsoupias, Barnabé Monnot and Christos Papadimitriou.
In submission, 2017.
Games are Algorithms: Game Dynamics, Chain Components and Markov-Conley Chains.
with Christos Papadimitriou.
In submission, 2017.
Learning Dynamics and the Co-evolution of Competing Sexual Species
with Leonard Schulman.
In submission, 2017.
Cycles in Adversarial Regularized Learning
with Panayotis Mertikopoulos and Christos Papadimitriou
In submission, 2017.
Learning Agents in Black-Scholes Financial Markets: Consensus Dynamics and Volatility Smiles
with Tushar Vaidya and Carlos Murguia.
In submission, 2017.
Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)
with Barnabé Monnot and Francisco Benita.
In submission, 2017.
Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos
with Gerasimos Palaiopanos and Ioannis Panageas.
NIPS spotlight paper, 2017.
Bifurcation Mechanism Design: From Optimal Flat Taxes to Improved Cancer Treatments
with Ger Yang and David Basanta.
ACM Conference on Economics and Computation (EC), 2017.
Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions
with Ioannis Panageas.
Innovations in Theoretical Computer Science (ITCS), 2017.
Modeling and analysis of modular structure in diverse biological networks
with Bader Al-Anzi, Sherif Gerges, Noah Olsman, Christopher Ormerod, John Ormerod, Kai Zinn.
Journal of Theoretical Biology 422(7), pages 18-30, 2017.
Approximating Nash Equilibria in Tree Polymatrix Games
with Siddharth Barman and Katrina Ligett.
In journal submission, 2017.
Mutation, Sexual Reproduction and Survival in Dynamic Environments
with Ruta Mehta, Ioannis Panageas, Prasad Tetali and Vijay V. Vazirani.
Innovations in Theoretical Computer Science (ITCS), 2017.
The Computational Complexity of Genetic Diversity
with Ruta Mehta, Ioannis Panageas and Sadra Yazdanbod.
European Symposium on Algorithms (ESA), 2016.
Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction
with Ioannis Panageas.
ACM Conference on Economics and Computation (EC), 2016.
Risk Sensitivity of Price of Anarchy under Uncertainty
Georgios Piliouras, Evdokia Nikolova and Jeff S. Shamma.
ACM Transactions of Economics and Computation 5(1), 2016.
Limits and Limitations of No-Regret Learning in Games
with Barnabé Monnot.
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), Adaptive Learning Agents (ALA) Workshop, 2016. Invited to Appear in The Knowledge Engineering Review, Cambridge Univ. Press, 2017.
From Nash equilibria to chain recurrent sets: Solution concepts and topology
with Christos Papadimitriou.
Innovations in Theoretical Computer Science (ITCS), 2016. Invited to Entropy Journal Special Issue on "Information Theory in Game Theory".
Inferring Activities and Optimal Trips: Lessons from Singapore's National Science Experiment
Barnabé Monnot, Erik Wilhelm, Georgios Piliouras, Yuren Zhou, Daniel Dahlmeier, Hai Yun Lu, Wang Jin.
Complex Systems Design & Management Asia, Advances in Intelligent Systems and Computing Vol. 426, pp 247-264, 2016.
Approximating Nash Equilibria in Tree Polymatrix Games
with Siddharth Barman and Katrina Ligett.
International Symposium on Algorithmic Game Theory (SAGT), 2015.
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics
with Ruta Mehta, and Ioannis Panageas.
Innovations in Theoretical Computer Science (ITCS), 2015.
LP-based Covering Games with Low Price of Anarchy
with Tomas Valla and Laszlo A. Vegh.
Theory of Computing Systems, October 2014, pages 1-23.
Near optimality in covering games by exposing global information
with Nina Balcan, Sara Krehbiel and Jinwoo Shin.
ACM Transactions of Economics and Computation, Volume 2 Issue 4, October 2014.
Persistent Patterns: Multi-Agent Learning beyond Equilibrium and Utility
with Henrik Christensen, Carlos Nieto-Granda, and Jeff S. Shamma.
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2014.
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
with Jeff S. Shamma.
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014.
Risk Sensitivity of Price of Anarchy under Uncertainty
Georgios Piliouras, Evdokia Nikolova and Jeff S. Shamma.
ACM Conference on Electronic Commerce (EC), 2013.
LP-based Covering Games with Low Price of Anarchy
with Tomas Valla and Laszlo A. Vegh.
Workshop on Internet & Network Economics (WINE), 2012.
Near optimality in covering and packing games by exposing global information
with Nina Balcan, Sara Krehbiel and Jinwoo Shin.
IEEE Conference on Decision and Control (CDC), 2012.
Medium and long-run properties of linguistic community evolution
with Michael J. Fox and Jeff S. Shamma.
International Conference on the Evolution of Language (Evolang IX), 2012.
Game Couplings: Learning Dynamics and Applications
with Nina Balcan, Florin Constantin and Jeff S. Shamma.
IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), 2011.
Beating the best Nash without regret
with Katrina Ligett.
SIGecom Exchanges 10, 2011.
Beyond the Nash equilibrium barrier
with Bobby Kleinberg, Katrina Ligett and Éva Tardos.
Symposium on Innovations in Computer Science (ICS), 2011.
Coalition formation and price of anarchy in Cournot oligopolies
with Nicole Immorlica and Vangelis Markakis.
Workshop on Internet & Network Economics (WINE), 2010.
No regret learning in oligopolies: Cournot vs Bertrand
with Uri Nadav.
International Symposium on Algorithmic Game Theory (SAGT), 2010.
Load balancing without regret in the billboard model
with Bobby Kleinberg and Éva Tardos.
Invited to the Special Issue of the Principles of Distributed Computing vol. 24, 2011.
Symposium on Principles of Distributed Computing (PODC), 2009.
Multiplicative updates outperform generic no-regret learning in congestion games
with Bobby Kleinberg and Éva Tardos.
ACM Symposium on Theory of Computing (STOC), 2009.