A Stochastic Search Algorithm for the Computation of Perfect and Proper Equilibria
Stuart McDonald () and
No 480, Discussion Papers Series from University of Queensland, School of Economics
This paper shows that stochastic search algorithms can be used to compute the perfect and proper equilibria of finite games. These type of equilibria use perturbations as a means of escape from local equilibria. Intuitively, there is always a small probability that an agent will select alternative strategy, even if that strategy is sub-optimal. This allows agents to escape from local equilibria in much the same way that stochastic search algorithms (like genetic algorithms and simulated annealing, for example) escape from local equilibria. This paper constructs a possibility result showing that if this equilibrium exists, then it can be found by using a stochastic search algorithm. This paper also shows by example, using the three player extensive game "Selten's Horse", that stochastic search can be used to locate a perfect equilibrium in an extensive form game.
Keywords: Perfect and proper equilibria; computational methods; stochastic search (search for similar items in EconPapers)
JEL-codes: C72 C73 C62 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp, nep-gth and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:qld:uq2004:480
Access Statistics for this paper
More papers in Discussion Papers Series from University of Queensland, School of Economics Contact information at EDIRC.
Bibliographic data for series maintained by SOE IT ().