Georgios Piliouras

According to our database1, Georgios Piliouras authored at least 33 papers between 2009 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Wealth Inequality and the Price of Anarchy.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Bifurcation Mechanism Design - From Optimal Flat Taxes to Better Cancer Treatments.
Games, 2018

From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory.
Entropy, 2018

Cycles in Adversarial Regularized Learning.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Multiplicative Weights Update in Zero-Sum Games.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Learning Dynamics and the Co-Evolution of Competing Sexual Species.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Learning Agents in Financial Markets: Consensus Dynamics on Volatility.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Three Body Problems in Evolutionary Game Dynamics: Convergence, Periodicity and Limit Cycles.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Limits and limitations of no-regret learning in games.
Knowledge Eng. Review, 2017

Routing Games in the Wild: Efficiency, Equilibration and Regret - Large-Scale Field Experiments in Singapore.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Bifurcation Mechanism Design - from Optimal Flat Taxes to Improved Cancer Treatments.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Mutation, Sexual Reproduction and Survival in Dynamic Environments.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

From Nash Equilibria to Chain Recurrent Sets: Solution Concepts and Topology.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

The Computational Complexity of Genetic Diversity.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Inferring Activities and Optimal Trips: Lessons From Singapore's National Science Experiment.
Proceedings of the Complex Systems Design & Management Asia - Smart Nations, 2016

2015
Approximating Nash Equilibria in Tree Polymatrix Games.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract].
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Near-Optimality in Covering Games by Exposing Global Information.
ACM Trans. Economics and Comput., 2014

Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Persistent patterns: multi-agent learning beyond equilibrium and utility.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Risk sensitivity of price of anarchy under uncertainty.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
LP-Based Covering Games with Low Price of Anarchy.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Minimally invasive mechanism design: Distributed covering with carefully chosen advice.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
Beating the best Nash without regret.
SIGecom Exchanges, 2011

Beyond the Nash Equilibrium Barrier.
Proceedings of the Innovations in Computer Science, 2011

Game couplings: Learning dynamics and applications.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
Coalition Formation and Price of Anarchy in Cournot Oligopolies.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

No Regret Learning in Oligopolies: Cournot vs. Bertrand.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Load balancing without regret in the bulletin board model.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009


  Loading...