Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen:
https://hdl.handle.net/10419/56815
Kompletter Metadatensatz
DublinCore-Feld | Wert | Sprache |
---|---|---|
dc.contributor.author | Levínský, René | en |
dc.contributor.author | Neyman, Abraham | en |
dc.contributor.author | Zelený, Miroslav | en |
dc.date.accessioned | 2010-12-08 | - |
dc.date.accessioned | 2012-04-11T09:26:45Z | - |
dc.date.available | 2012-04-11T09:26:45Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://hdl.handle.net/10419/56815 | - |
dc.description.abstract | In this paper we offer a new approach to modeling strategies of bounded complexity, the so-called factor-based strategies. In our model, the strategy of a player in the multi-stage game does not directly map the set of histories H to the set of her actions. Instead, the player's perception of H is represented by a factor [...] where X reflects the cognitive complexity of the player. Formally, mapping [...] sends each history to an element of a factor space X that represents its equivalence class. The play of the player can then be conditioned just on the elements of the set X. From the perspective of the original multi-stage game we say that a function [...] from H to X is a factor of a strategy [...] if there exists a function [...] from X to the set of actions of the player such that [...]. In this case we say that the strategy [...] is [...]-factor-based. Stationary strategies and strategies played by finite automata and strategies with bounded recall are the most prominent examples of factor-based strategies. In the discounted infinitely repeated game with perfect monitoring, a best reply to a profile of [...]-factor-base strategies need not be a [...]-factor-base strategy. However, if the factor [...] is recursive, namely its value [...] on a finite string of action profiles [...] is a function of [...] and [...], then for every profile of factor-based strategies there is a best reply that is a pure factor-based strategy. We also study factor-based strategies in the more general case of stochastic games.. | en |
dc.language.iso | eng | en |
dc.publisher | |aFriedrich Schiller University Jena and Max Planck Institute of Economics |cJena | en |
dc.relation.ispartofseries | |aJena Economic Research Papers |x2010,082 | en |
dc.subject.jel | C73 | en |
dc.subject.ddc | 330 | en |
dc.subject.keyword | bounded rationality | en |
dc.subject.keyword | factor-based | en |
dc.subject.keyword | strategies bounded | en |
dc.subject.keyword | recall strategies | en |
dc.subject.keyword | finite automata | en |
dc.subject.stw | Dynamisches Spiel | en |
dc.subject.stw | Beschränkte Rationalität | en |
dc.subject.stw | Wiederholte Spiele | en |
dc.subject.stw | Theorie | en |
dc.title | Should i remember more than you? On the best response to factor-based strategies | - |
dc.type | Working Paper | en |
dc.identifier.ppn | 641290454 | en |
dc.rights | http://www.econstor.eu/dspace/Nutzungsbedingungen | en |
Datei(en):
Publikationen in EconStor sind urheberrechtlich geschützt.