IDEAS home Printed from https://ideas.repec.org/p/sce/scecf9/1122.html
   My bibliography  Save this paper

Computability and Robustness of Equilibrium in Finite Games

Author

Listed:
  • Kislaya Prasad

    (Florida State University)

Abstract

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.

Suggested Citation

  • Kislaya Prasad, 1999. "Computability and Robustness of Equilibrium in Finite Games," Computing in Economics and Finance 1999 1122, Society for Computational Economics.
  • Handle: RePEc:sce:scecf9:1122
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:1122. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.