A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Computing Equilibria in Discounted 2 x 2 Supergames
Tekijät: Berg K, Kitti M
Kustantaja: SPRINGER
Julkaisuvuosi: 2013
Journal: Computational Economics
Tietokannassa oleva lehden nimi: COMPUTATIONAL ECONOMICS
Lehden akronyymi: COMPUT ECON
Vuosikerta: 41
Numero: 1
Aloitussivu: 71
Lopetussivu: 88
Sivujen määrä: 18
ISSN: 0927-7099
DOI: https://doi.org/10.1007/s10614-011-9308-5
Tiivistelmä
This article examines the subgame perfect pure strategy equilibrium paths and payoff sets of discounted supergames with perfect monitoring. The main contribution is to provide methods for computing and tools for analyzing the equilibrium paths and payoffs in repeated games. We introduce the concept of a first-action feasible path, which simplifies the computation of equilibria. These paths can be composed into a directed multigraph, which is a useful representation for the equilibrium paths. We examine how the payoffs, discount factors and the properties of the multigraph affect the possible payoffs, their Hausdorff dimension, and the complexity of the equilibrium paths. The computational methods are applied to the 12 symmetric strictly ordinal 2 x 2 games. We find that these games can be classified into three groups based on the complexity of the equilibrium paths.
This article examines the subgame perfect pure strategy equilibrium paths and payoff sets of discounted supergames with perfect monitoring. The main contribution is to provide methods for computing and tools for analyzing the equilibrium paths and payoffs in repeated games. We introduce the concept of a first-action feasible path, which simplifies the computation of equilibria. These paths can be composed into a directed multigraph, which is a useful representation for the equilibrium paths. We examine how the payoffs, discount factors and the properties of the multigraph affect the possible payoffs, their Hausdorff dimension, and the complexity of the equilibrium paths. The computational methods are applied to the 12 symmetric strictly ordinal 2 x 2 games. We find that these games can be classified into three groups based on the complexity of the equilibrium paths.
Turun yliopiston Tutkimustietojärjestelmän portaali