Every choice correspondence is backwards-induction rationalizable
Year of publication: |
2014
|
---|---|
Authors: | Rehbeck, John |
Published in: |
Games and economic behavior. - Amsterdam : Elsevier, ISSN 0899-8256, ZDB-ID 1002944-8. - Vol. 88.2014, p. 207-210
|
Subject: | Revealed preference | Backwards-induction | Rationalizability | Offenbarte Präferenzen | Revealed preferences | Rationalität | Rationality | Präferenztheorie | Theory of preferences | Entscheidungstheorie | Decision theory |
-
Every random choice rule is backwards-induction rationalizable
Li, Jiangtao, (2017)
-
Backwards-induction rationalizability of choice functions over an arbitrary set
Ma, Wei, (2024)
-
Rationalizable choice functions
Yang, Yi-You, (2020)
- More ...
-
Identification With Additively Separable Heterogeneity
Allen, Roy, (2019)
-
Assessing misspecification and aggregation for structured preferences
Allen, Roy E., (2019)
-
Revealed statistical consumer theory
Allen, Roy, (2019)
- More ...