Connectivity and equilibrium in random games

DOI10.1214/10-AAP715zbMath1229.91079arXivmath/0703902OpenAlexW3103177970MaRDI QIDQ549865

Alexandros G. Dimakis, Constantinos Daskalakis, Elchanan Mossel

Publication date: 19 July 2011

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703902

zbMATH Keywords

random graphsgraphical gamesrandom gamespure Nash equilibria

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Phase transitions (general) in equilibrium statistical mechanics (82B26) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Best-response dynamics, playing sequences, and convergence to equilibrium in random games ⋮ The probability of nontrivial common knowledge ⋮ Pure Nash Equilibria and Best-Response Dynamics in Random Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypertree decompositions and tractable queries
• Two moments suffice for Poisson approximations: The Chen-Stein method
• On the number of pure strategy Nash equilibria in random games
• Bounding the inefficiency of equilibria in nonatomic congestion games
• A note on the probability of \(k\) pure Nash equilibria in matrix games
• Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
• Evolutionarily stable strategies of random games, and the vertices of random polygons
• On the Desirability of Acyclic Database Schemes
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Selfish traffic allocation for server farms
• The threshold for random k-SAT is 2 ^k (ln 2 - O(k))
• Sharp thresholds of graph properties, and the $k$-sat problem
• Stackelberg Scheduling Strategies
• The probability of an equilibrium point
• Probability of a pure equilibrium point in n-person games
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology
• On the probability of existence of pure equilibria in matrix games

This page was built for publication: Connectivity and equilibrium in random games