Stochastically Stable States for Perturbed Repeated Play of Coordination Games
Anderson, Mark Daniel
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/86794
Description
Title
Stochastically Stable States for Perturbed Repeated Play of Coordination Games
Author(s)
Anderson, Mark Daniel
Issue Date
2002
Doctoral Committee Chair(s)
Muncaster, Robert G.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Economics, Theory
Language
eng
Abstract
Perturbed repeated play of a two-player two-move coordination game is modeled as an irreducible Markov process on a set of history states describing the most recent m stages of play. At every stage, each player draws a sample from the history state to forecast his opponent's behavior and either moves to maximize his single-stage expected payoff or commits an error. As the error rate approaches zero the stationary distributions converge to a stationary distribution for the unperturbed process. Stochastically stable states, which comprise the support of the limiting distribution, are identified by finding minimum-weight spanning trees of a weighted directed graph on the set of recurrent classes for the unperturbed process. When the sample size equals the memory length m, cycles may be present in the unperturbed process. Necessary and sufficient conditions for the existence of stochastically stable cycle states are provided. The stochastically stable states are identified, for sufficiently large sample sizes and memory lengths, as those states representing repeated play of a risk-dominant Nash equilibrium. Finally, five coordination conditions are introduced to characterize N-player coordination games.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
