| Year |
Citation |
Score |
| 2024 |
Bielawski J, Chotibut T, Falniowski F, Misiurewicz M, Piliouras G. Memory loss can prevent chaos in games dynamics. Chaos (Woodbury, N.Y.). 34. PMID 38285720 DOI: 10.1063/5.0184318 |
0.302 |
|
| 2023 |
Milionis J, Papadimitriou C, Piliouras G, Spendlove K. An impossibility theorem in game dynamics. Proceedings of the National Academy of Sciences of the United States of America. 120: e2305349120. PMID 37796988 DOI: 10.1073/pnas.2305349120 |
0.414 |
|
| 2020 |
Leonardos S, Reijsbergen D, Piliouras G. PREStO: A Systematic Framework for Blockchain Consensus Protocols Ieee Transactions On Engineering Management. 1-17. DOI: 10.1109/Tem.2020.2981286 |
0.309 |
|
| 2020 |
Chotibut T, Falniowski F, Misiurewicz M, Piliouras G. Family of chaotic maps from game theory Dynamical Systems-An International Journal. 1-16. DOI: 10.1080/14689367.2020.1795624 |
0.357 |
|
| 2020 |
Leonardos S, Reijsbergen D, Piliouras G. Weighted voting on the blockchain: Improving consensus in proof of stake protocols International Journal of Network Management. 30. DOI: 10.1002/Nem.2093 |
0.327 |
|
| 2019 |
Omidshafiei S, Papadimitriou C, Piliouras G, Tuyls K, Rowland M, Lespiau JB, Czarnecki WM, Lanctot M, Perolat J, Munos R. α-Rank: Multi-Agent Evaluation by Evolution. Scientific Reports. 9: 9937. PMID 31289288 DOI: 10.1038/S41598-019-45619-9 |
0.435 |
|
| 2019 |
Koki C, Leonardos S, Piliouras G. Do Cryptocurrency Prices Camouflage Latent Economic Effects? A Bayesian Hidden Markov Approach Future Internet. 12: 59. DOI: 10.3390/Fi12030059 |
0.337 |
|
| 2019 |
Papadimitriou CH, Piliouras G. Game dynamics as the meaning of a game Sigecom Exchanges. 16: 53-63. DOI: 10.1145/3331041.3331048 |
0.416 |
|
| 2019 |
Lee JD, Panageas I, Piliouras G, Simchowitz M, Jordan MI, Recht B. First-order methods almost always avoid strict saddle points Mathematical Programming. 176: 311-337. DOI: 10.1007/S10107-019-01374-3 |
0.324 |
|
| 2018 |
Papadimitriou C, Piliouras G. From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory. Entropy (Basel, Switzerland). 20. PMID 33265870 DOI: 10.3390/E20100782 |
0.484 |
|
| 2018 |
Yang G, Basanta D, Piliouras G. Bifurcation Mechanism Design—From Optimal Flat Taxes to Better Cancer Treatments Games. 9: 21. DOI: 10.3390/G9020021 |
0.348 |
|
| 2017 |
Monnot B, Piliouras G. Limits and limitations of no-regret learning in games Knowledge Engineering Review. 32. DOI: 10.1017/S0269888917000133 |
0.466 |
|
| 2016 |
Panageas I, Piliouras G. Average case performance of replicator dynamics in potential games via computing regions of attraction Ec 2016 - Proceedings of the 2016 Acm Conference On Economics and Computation. 703-720. DOI: 10.1145/2940716.2940784 |
0.414 |
|
| 2016 |
Papadimitriou C, Piliouras G. From Nash Equilibria to chain recurrent sets: Solution concepts and topology Itcs 2016 - Proceedings of the 2016 Acm Conference On Innovations in Theoretical Computer Science. 227-235. DOI: 10.1145/2840728.2840757 |
0.41 |
|
| 2015 |
Barman S, Ligett K, Piliouras G. Approximating nash equilibria in tree polymatrix games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9347: 285-296. DOI: 10.1007/978-3-662-48433-3_22 |
0.36 |
|
| 2014 |
Piliouras G, Nieto-Granda C, Christensent HI, Shamma JS. Persistent patterns: Multi-agent learning beyond equilibrium and utility 13th International Conference On Autonomous Agents and Multiagent Systems, Aamas 2014. 1: 181-188. |
0.336 |
|
| 2014 |
Piliouras G, Shamma JS. Optimization despite chaos: Convex relaxations to complex limit sets via poincaré recurrence Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 861-873. |
0.364 |
|
| 2013 |
Piliouras G, Nikolova E, Shamma JS. Risk sensitivity of price of anarchy under uncertainty Proceedings of the Acm Conference On Electronic Commerce. 715-732. |
0.337 |
|
| 2012 |
Piliouras G, Valla T, Végh LA. LP-based covering games with low price of anarchy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7695: 184-197. DOI: 10.1007/S00224-014-9587-Z |
0.39 |
|
| 2011 |
ligett K, Piliouras G. Beating the best Nash without regret Sigecom Exchanges. 10: 23-26. DOI: 10.1145/1978721.1978727 |
0.426 |
|
| 2011 |
Kleinberg R, Piliouras G, Tardos E. Load balancing without regret in the bulletin board model Distributed Computing. 24: 21-29. DOI: 10.1007/S00446-011-0129-5 |
0.477 |
|
| 2009 |
Kleinberg R, Piliouras G, Tardos E. Multiplicative updates outperform generic no-regret learning in congestion games Proceedings of the Annual Acm Symposium On Theory of Computing. 533-542. DOI: 10.1145/1536414.1536487 |
0.442 |
|
| Show low-probability matches. |