This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Top-Cycle Rationalizability

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
SPRUMONT, Yves
EHLERS, Lars

Additional information is available for the following registered author(s):

Abstract

We identify necessary and sufficient conditions for the choice set from every subset A of a (finite) universal set X to coincide with the top cycle in A of some fixed tournament on X.

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 page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/1866/549
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2005-20.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 11 pages
Date of creation: 2005
Date of revision:
Handle: RePEc:mtl:montde:2005-20

Contact details of provider:
Postal: CP 6128, Succ. Centre-Ville, Montr�al, Qu�bec, H3C 3J7
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Sharon BREWER).

Related research
Keywords:

This paper has been announced in the following NEP Reports:

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.:
  1. Paola Manzini & Marco Mariotti, 2004. "Rationalizing Boundedly Rational Choice," Microeconomics 0407005, EconWPA, revised 21 Jul 2005. [Downloadable!]
  2. Deb, Rajat, 1977. "On Schwartz's rule," Journal of Economic Theory, Elsevier, vol. 16(1), pages 103-110, October. [Downloadable!] (restricted)
  3. Bordes, Georges, 1976. "Consistency, Rationality and Collective Choice," Review of Economic Studies, Blackwell Publishing, vol. 43(3), pages 451-57, October. [Downloadable!] (restricted)
  4. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November. [Downloadable!] (restricted)
    Other versions:
  5. John Duggan, 2007. "A systematic approach to the construction of non-empty choice sets," Social Choice and Welfare, Springer, vol. 28(3), pages 491-506, April. [Downloadable!] (restricted)
  6. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May. [Downloadable!] (restricted)
  7. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February. [Downloadable!] (restricted)
  8. Loomes, Graham & Starmer, Chris & Sugden, Robert, 1991. "Observing Violations of Transitivity by Experimental Methods," Econometrica, Econometric Society, vol. 59(2), pages 425-39, March. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? About 2700 working paper series are listed on RePEc.

This page was last updated on 2009-11-1.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.