Combinatorial Aspects of Parker’s Model

Chris Cannings ()

Dynamic Games and Applications, 2015, vol. 5, issue 2, 263-274

Abstract: Parker’s model under rare mutation is considered when there is a finite set of available strategies. The question of when all of those strategies are present in the stationary distribution, i.e., the Markov chain is irreducible, is addressed, via graph theoretic and combinatorial entities. Specific cases for $$n=3,4,5,6$$ n = 3 , 4 , 5 , 6 are addressed, in the first three cases all the feasible cases are specified, and for $$n=6$$ n = 6 a superset of the feasible cases (possibly the set itself) is given. Copyright Springer Science+Business Media New York 2015

Keywords: Evolutionarily stable strategy (ESS); Parker’s model; Stationary distribution; Irreducible; Catalan numbers; Dyck words (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s13235-014-0103-5 (text/html)
Access to full text is restricted to subscribers.

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:spr:dyngam:v:5:y:2015:i:2:p:263-274

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/13235

DOI: 10.1007/s13235-014-0103-5

Access Statistics for this article

Dynamic Games and Applications is currently edited by Georges Zaccour

More articles in Dynamic Games and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().