Endogenous preferences in games with type indeterminate players
The Type Indeterminacy model is a theoretical framework that uses some elements of quantum formalism to model the constructive preference perspective suggested by Kahneman and Tversky. In this paper we extend the TI-model from simple to strategic decision-making and show that TI-games open a new field of strategic interaction. We first establish an equivalence result between static games of incomplete information and static TI-games. We next develop a new solution concept for non-commuting dynamic TI-games. The updating rule captures the novelty brought about by Type Indeterminacy namely that in addition to affecting information and payoffs, the action of a player impacts on the profile of types. We provide an example showing that TI-game predictions cannot be obtained as Bayes Nash equilibrium of the corresponding classical game.
|Date of creation:||Jun 2010|
|Date of revision:|
|Note:||View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-00564895|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Danilov, V.I. & Lambert-Mogiliansky, A., 2008.
"Measurable systems and behavioral sciences,"
Mathematical Social Sciences,
Elsevier, vol. 55(3), pages 315-340, May.
- Pierfrancesco La Mura, 2003. "Correlated Equilibria of Classical Strategic Games with Quantum Signals," Game Theory and Information 0309001, EconWPA.
When requesting a correction, please mention this item's handle: RePEc:hal:psewpa:halshs-00564895. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.