Stable Games


Abstract
We introduce a new class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising players are switching are always exceeded by the improvements in the payoffs of strategies which revising players are abandoning. We show that stable games subsume many well-known classes of examples, including zero-sum games, games with an interior ESS, wars of attrition, and concave potential games. We prove that the set of Nash equilibria of any stable game is convex, and offer an elementary proof of existence of equilibrium. Finally, we show that the set of Nash equilibria of a stable game is globally asymptotically stable under a variety of evolutionary dynamics. These convergence results are proved by constructing Lyapunov functions defined in terms of revision potentials—that is, potential functions for the protocols agents follow when they consider switching strategies
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,464
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2010-08-19

Total views
68 ( #170,562 of 2,520,426 )

Recent downloads (6 months)
1 ( #405,718 of 2,520,426 )

How can I increase my downloads?

Downloads

My notes