Evolutionary Stable Solution Concepts for the Initial Play

Terje Lensberg and Klaus Schenk-Hoppé

Economics Discussion Paper Series from Economics, The University of Manchester

Abstract: We model initial play in bimatrix games by a large population of agents. The agents have individual solution concepts (maps from games to strategy profiles) that they use to solve games. In contrast to evolutionary game theory, where the agents play the same game indefinitely, we consider a setting where they never play the same game twice. Individual solution concepts are represented as computer programs which develop over time by a process of natural selection. We derive an aggregate solution concept (ASC), which converges to a stochastically stable state where the population mean behavior remains constant. The logic and performance of the evolutionary stable ASC is examined in detail, and its solutions to many well-known games are held up against the theoretical and empirical evidence. For example, the ASC selects the “right” solution to traveler’s dilemma games, and predicts that the responder will get 40% of the pie in ultimatum games.

JEL-codes: C63 C73 C90 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://hummedia.manchester.ac.uk/schools/soss/eco ... npapers/EDP-1916.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:man:sespap:1916

Access Statistics for this paper

More papers in Economics Discussion Paper Series from Economics, The University of Manchester Contact information at EDIRC.
Bibliographic data for series maintained by Patrick Macnamara ().