Advanced Search
MyIDEAS: Login to save this paper or follow this series

A Characterization of Sequential Rationalizability

Contents:

Author Info

  • Jose Apesteguia
  • Miguel A. Ballester

Abstract

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rationalizable choice. Further, our characterization result provides a novel tool with which to study how other behavioral concepts are related to sequential rationalizability, and establish a priori unexpected implications. In particular, we show that the concept of rationalizability by game trees, which, in principle, had little to do with sequential rationalizability, is a refinement of the latter. Every choice function that is rationalizable by a game tree is also sequentially rationalizable. Finally, we show that some prominent voting mechanisms are also sequentially rationalizable.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://research.barcelonagse.eu/tmp/working_papers/345.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Barcelona Graduate School of Economics in its series Working Papers with number 345.

as in new window
Length:
Date of creation: May 2008
Date of revision:
Handle: RePEc:bge:wpaper:345

Contact details of provider:
Postal: Ramon Trias Fargas, 25-27, 08005 Barcelona
Phone: +34 93 542-1222
Fax: +34 93 542-1223
Email:
Web page: http://www.barcelonagse.eu
More information through EDIRC

Related research

Keywords: Individual rationality; Rationalizability; Consistency; Bounded rationality; Behavioral economics; Voting.;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
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.:
as in new window
  1. Dutta, Bhaskar & Jackson, Matthew O. & Le Breton, Michel, 2002. "Voting by Successive Elimination and Strategic Candidacy," Journal of Economic Theory, Elsevier, vol. 103(1), pages 190-218, March.
  2. Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
  3. Rubinstein, Ariel & Salant, Yuval, 2006. "A model of choice from lists," Theoretical Economics, Econometric Society, vol. 1(1), pages 3-17, March.
  4. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Discussion Paper Series dp278, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  5. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Xu, Yongsheng & Yoshihara, Naoki, 2011. "Proportional Nash solutions - A new and procedural analysis of nonconvex bargaining problems," CCES Discussion Paper Series 42, Center for Research on Contemporary Economic Systems, Graduate School of Economics, Hitotsubashi University.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bge:wpaper:345. 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: (Bruno Guallar).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.