Georgios Piliouras
Cited by
Cited by
First-order methods almost always avoid saddle points
JD Lee, I Panageas, G Piliouras, M Simchowitz, MI Jordan, B Recht
arXiv preprint arXiv:1710.07406, 2017
Multiplicative updates outperform generic no-regret learning in congestion games
R Kleinberg, G Piliouras, … Tardos
Proceedings of the forty-first annual ACM symposium on Theory of computing†…, 2009
Gradient descent converges to minimizers: The case of non-isolated critical points
I Panageas, G Piliouras
Proceedings of the 2017 ACM Conference on Innovations in Theoretical†…, 2016
Cycles in adversarial regularized learning
P Mertikopoulos, C Papadimitriou, G Piliouras
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018., 2017
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
M Panayotis, B Lecouat, H Zenati, CS Foo, V Chandrasekhar, G Piliouras
ICLR, 2019
Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos
G Palaiopanos, I Panageas, G Piliouras
31st Annual Conference on Neural Information Processing Systems, 2017
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincarť Recurrence
G Piliouras, JS Shamma
ACM-SIAM Symposium on Discrete Algorithms (SODA 14), 2014
Risk sensitivity of price of anarchy under uncertainty
G Piliouras, E Nikolova, JS Shamma
ACM Transactions on Economics and Computation (TEAC) 5 (1), 1-27, 2016
Multiplicative Weights Update in Zero-Sum Games
JP Bailey, G Piliouras
Proceedings of the 2018 ACM Conference on Economics and Computation, 321-338, 2018
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]
R Mehta, I Panageas, G Piliouras
Proceedings of the 2015 Conference on Innovations in Theoretical Computer†…, 2015
Beyond the Nash equilibrium barrier
R Kleinberg, K Ligett, G Piliouras, E Tardos
Symposium on Innovations in Computer Science (ICS), 2011
Load balancing without regret in the bulletin board model
R Kleinberg, G Piliouras, … Tardos
Distributed Computing 24 (1), 21-29, 2011
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
C Papadimitriou, G Piliouras
Entropy 20 (10), 782, 2018
{\alpha}-Rank: Multi-Agent Evaluation by Evolution
S Omidshafiei, C Papadimitriou, G Piliouras, K Tuyls, M Rowland, ...
Scientific Reports (9), 2019
Persistent patterns: multi-agent learning beyond equilibrium and utility
G Piliouras, C Nieto-Granda, HI Christensen, JS Shamma
Proceedings of the 2014 international conference on Autonomous agents and†…, 2014
Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction
I Panageas, G Piliouras
Proceedings of the 2016 ACM Conference on Economics and Computation, 703-720, 2016
No regret learning in oligopolies: cournot vs. bertrand
U Nadav, G Piliouras
International Symposium on Algorithmic Game Theory, 300-311, 2010
Incentives in Ethereum's Hybrid Casper Protocol
V Buterin, D Reijsbergen, S Leonardos, G Piliouras
IEEE International Conference on Blockchain and Cryptocurrency (ICBC) 2019, 2019
Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)
B Monnot, F Benita, G Piliouras
Conference on Web and Internet Economics (WINE), 2017., 2017
Coalition formation and price of anarchy in Cournot oligopolies
N Immorlica, E Markakis, G Piliouras
International Workshop on Internet and Network Economics, 270-281, 2010
The system can't perform the operation now. Try again later.
Articles 1–20