IDEAS home Printed from https://ideas.repec.org/p/mtl/montde/2005-20.html

Top-Cycle Rationalizability

Author

Listed:
  • 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.

Suggested Citation

  • SPRUMONT, Yves & EHLERS, Lars, 2005. "Top-Cycle Rationalizability," Cahiers de recherche 2005-20, Universite de Montreal, Departement de sciences economiques.
    • Handle: RePEc:mtl:montde:2005-20
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1866/549
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. John Duggan, 2007. "A systematic approach to the construction of non-empty choice sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(3), pages 491-506, April.
    2. Georges Bordes, 1976. "Consistency, Rationality and Collective Choice," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 43(3), pages 451-457.
    3. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
    4. Loomes, Graham & Starmer, Chris & Sugden, Robert, 1991. "Observing Violations of Transitivity by Experimental Methods," Econometrica, Econometric Society, vol. 59(2), pages 425-439, March.
    5. Deb, Rajat, 1977. "On Schwartz's rule," Journal of Economic Theory, Elsevier, vol. 16(1), pages 103-110, October.
    6. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November.
    7. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
    8. Paola Manzini & Marco Mariotti, 2004. "Rationalizing Boundedly Rational Choice," Microeconomics 0407005, University Library of Munich, Germany, revised 21 Dec 2005.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ehlers, Lars & Sprumont, Yves, 2008. "Weakened WARP and top-cycle choice rules," Journal of Mathematical Economics, Elsevier, vol. 44(1), pages 87-94, January.
    2. Tyson, Christopher J., 2008. "Cognitive constraints, contraction consistency, and the satisficing criterion," Journal of Economic Theory, Elsevier, vol. 138(1), pages 51-70, January.
    3. Michele Lombardi, 2008. "Uncovered set choice rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(2), pages 271-279, August.
    4. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    5. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    6. Wilfried Youmbi, 2024. "Nonparametric Analysis of Random Utility Models Robust to Nontransitive Preferences," Papers 2406.13969, arXiv.org.
    7. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    8. Joseph, Rémy-Robert, 2010. "Making choices with a binary relation: Relative choice axioms and transitive closures," European Journal of Operational Research, Elsevier, vol. 207(2), pages 865-877, December.
    9. Fuad Aleskerov & Andrey Subochev, 2016. "Matrix-vector representation of various solution concepts," Papers 1607.02378, arXiv.org.
    10. Apesteguia, Jose & Ballester, Miguel A., 2013. "Choice by sequential procedures," Games and Economic Behavior, Elsevier, vol. 77(1), pages 90-99.
    11. repec:hal:pseose:hal-00756696 is not listed on IDEAS
    12. Houy Nicolas, 2007. "Rationality and Order-Dependent Sequential Rationality," Theory and Decision, Springer, vol. 62(2), pages 119-134, March.
    13. Jose Apesteguia & Miguel A. Ballester, 2008. "A characterization of sequential rationalizability," Economics Working Papers 1089, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Stewart, Rush T., 2020. "Weak pseudo-rationalizability," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 23-28.
    15. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    16. Niels Boissonnet & Alexis Ghersengorin, 2025. "Grabbing the Forbidden Fruit: Restriction-Sensitive Choice," Papers 2509.11673, arXiv.org.
    17. Subochev, Andrey, 2008. "Dominant, weakly stable, uncovered sets: properties and extensions," MPRA Paper 53421, University Library of Munich, Germany.
    18. B. Douglas Bernheim & Antonio Rangel, 2009. "Beyond Revealed Preference: Choice-Theoretic Foundations for Behavioral Welfare Economics," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 124(1), pages 51-104.
    19. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    20. Walter Bossert & Yves Sprumont, 2009. "Non‐Deteriorating Choice," Economica, London School of Economics and Political Science, vol. 76(302), pages 337-363, April.
    21. Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/demtlca.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.