cs.GT · 2026-07-14 · No. 53
Computer Science and Game Theory, 2026-07-14.
1 new papers in cs.GT. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
Paradoxes of Game Theoretic Equilibria and Price of Anarchy
Georgios Piliouras, Ian Gemp, Siqi Liu, Luke Marris
cs.GT · cs.LG · cs.MA · math.DS · math.OC
For decades, static solution concepts (Nash, Correlated, and Coarse Correlated Equilibria) and the Price of Anarchy (PoA) have formed the bedrock of algorithmic game theory, with no-regret learning proving fast convergence to such game-theoretic equilibria. We show that reducing multi-agent learning to static equilibrium and black-box regret analysis obscures underlying dynamic disequilibrium and game theoretic bounds. First, interior Nash...
This edition is part of The Daily Abstract — cs.GT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.