Probabilistic Techniques in Algorithmic Game Theory

DOI10.1007/978-3-540-74871-7_4MaRDI QIDQ3608497zbMATH OpenOpenAlexFDO

Authors Spyros Kontogiannis, P. G. Spirakis

Publication date 5 March 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74871-7_4

zbMATH Keywords

coalitionsgame theoryconvergence to equilibriaprice of anarchyatomic congestion games

Mathematics Subject Classification ID

Games involving graphs (91A43) Experimental studies (91A90)

Recommendations

• Nash equilibria in random games
• Approximate Nash Equilibria for Multi-player Games
• Computing equilibria in multi-player games
• Nash Equilibria: Where We Stand
• The complexity of pure Nash equilibria

Cited in

(2)

• A library for algorithmic game theory in \textsf{Ssreflect/Coq}
• Probabilistic analysis of simulation-based games

This page was built for publication: Probabilistic Techniques in Algorithmic Game Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608497)