Advanced Search
MyIDEAS: Login

Top-Cycle Rationalizability

Contents:

Author Info

  • SPRUMONT, Yves
  • EHLERS, Lars

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

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://hdl.handle.net/1866/549
Download Restriction: no

Bibliographic Info

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

as in new window
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

Related research

Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports:

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. Paola Manzini & Marco Mariotti, 2004. "Rationalizing Boundedly Rational Choice," Microeconomics 0407005, EconWPA, revised 21 Jul 2005.
  2. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
  3. Deb, Rajat, 1977. "On Schwartz's rule," Journal of Economic Theory, Elsevier, vol. 16(1), pages 103-110, October.
  4. Bordes, Georges, 1976. "Consistency, Rationality and Collective Choice," Review of Economic Studies, Wiley Blackwell, vol. 43(3), pages 451-57, October.
  5. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
  6. Gil Kalai & Ariel Rubenstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Economics Working Papers 0010, Institute for Advanced Study, School of Social Science.
  7. 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.
  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.
Full references (including those not matched with items on IDEAS)

Citations

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:mtl:montde:2005-20. 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: (Sharon BREWER).

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.