A sequentially rationalizable choice function is a choice function that can be retrieved by applying sequentially to each choice problem the same fixed set of asymmetric binary relations (rationales) to remove inferior alternatives. These concepts translate into economic language some human choice heuristics studied in psychology and explain cyclical patterns of choice observed in experiments. We study some properties of sequential rationalizability and provide a full characterization of choice functions rationalizable by two and three rationales. (JEL D01).
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).
Related research
Keywords:
Cited by: (explanations, 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.)
Paola Manzini & Marco Mariotti, 2007.
"Choice Over Time,"
IZA Discussion Papers
2993, Institute for the Study of Labor (IZA).
[Downloadable!]
Other versions:
Paola Manzini & Marco Mariotti, 2007.
"Choice over Time,"
Working Papers
605, Queen Mary, University of London, Department of Economics.
[Downloadable!]