Computability and Robustness of Equilibrium in Finite Games
This paper considers finite games in strategic form. It is shown that, when payoffs are computable, every game has a Nash equilibrium in which each player uses a strategy which is computable. There can, however, exist no algorithm that is guaranteed to find an equilibrium for every instance of a game with computable payoffs. In contrast, an approximate equilibrium is always computable (this is what Scarf type algorithms find). This paper develops the relationship between notions of robustness (or stability) of games and computability. The emphasis here is on notions of evolutionary stability, such as ESS. For finite symmetric games, in a model where players know only their own payoffs and form beliefs about the distribution of play of others, the two concepts are essentially identical.
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Mar 1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://fmwww.bc.edu/CEF99/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:1122. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.