Connectivity and equilibrium in random games (Q549865)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectivity and equilibrium in random games |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity and equilibrium in random games |
scientific article |
Statements
Connectivity and equilibrium in random games (English)
0 references
19 July 2011
0 references
The article analyzes the effect of connectivity in a random graph, captured by the edge probability, on existence or non-existence of pure Nash equilibria for games on the graph with random payoffs. This takes the form of a Poisson approximation for the number of such equilibria for the high connectivity case, and upper, resp. lower bounds for the existence of such equilibria for medium and low connectivity cases. Complementary results on probability bounds for non-existence of pure Nash equilibria are also given.
0 references
graphical games
0 references
random games
0 references
pure Nash equilibria
0 references
random graphs
0 references
0 references
0.8550140261650085
0 references
0.8170107007026672
0 references
0.8154630064964294
0 references
0.8079639077186584
0 references
0.8060742020606995
0 references
