IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v58y2007i2p231-245.html
   My bibliography  Save this article

Counting combinatorial choice rules

Author

Listed:
  • Echenique, Federico

Abstract

I count the number of combinatorial choice rules that satisfy certain properties: Kelso-Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties. The rules are a small, and asymptotically vanishing, fraction of all choice rules. But they are still exponentially more than the preference relations over individual agents- --which has positive implications for the Gale-Shapley algorithm of matching theory.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Echenique, Federico, 2007. "Counting combinatorial choice rules," Games and Economic Behavior, Elsevier, vol. 58(2), pages 231-245, February.
    • Handle: RePEc:eee:gamebe:v:58:y:2007:i:2:p:231-245
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(06)00043-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Roth,Alvin E. & Sotomayor,Marilda A. Oliveira, 1992. "Two-Sided Matching," Cambridge Books, Cambridge University Press, number 9780521437882, Enero-Abr.
    2. Kim, Taesung & Richter, Marcel K., 1986. "Nontransitive-nontotal consumer theory," Journal of Economic Theory, Elsevier, vol. 38(2), pages 324-363, April.
    3. Bevia, Carmen & Quinzii, Martine & Silva, Jose A., 1999. "Buying several indivisible goods," Mathematical Social Sciences, Elsevier, vol. 37(1), pages 1-23, January.
    4. Ralph W. Bailey, 1998. "The number of weak orderings of a finite set," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 15(4), pages 559-562.
    5. Charles Blair, 1988. "The Lattice Structure of the Set of Stable Matchings with Multiple Partners," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 619-628, November.
    6. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
    7. Moulin,Hervi, 1991. "Axioms of Cooperative Decision Making," Cambridge Books, Cambridge University Press, number 9780521424585, June.
    8. Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
    9. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
    10. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    11. John W. Hatfield & Paul Milgrom, 2005. "Auctions, Matching and the Law of Aggregate Demand," Levine's Bibliography 122247000000000780, UCLA Department of Economics.
    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


    Cited by:

    1. Samson Alva & Battal Dou{g}an, 2021. "Choice and Market Design," Papers 2110.15446, arXiv.org, revised Nov 2021.
    2. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    3. Hans Peters & Panos Protopapas, 2021. "Set and revealed preference axioms for multi-valued choice," Theory and Decision, Springer, vol. 90(1), pages 11-29, February.
    4. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
    5. Juan F. Fung & Chia-Ling Hsu, 2021. "A cumulative offer process for supply chain networks," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 93-109, June.
    6. Koji Yokote & Isa E. Hafalir & Fuhito Kojima & M. Bumin Yenmez, 2023. "Rationalizing Path-Independent Choice Rules," Papers 2303.00892, arXiv.org, revised May 2024.
    7. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.
    8. Battal Dou{g}an & Kenzo Imamura & M. Bumin Yenmez, 2022. "Market Design with Deferred Acceptance: A Recipe for Policymaking," Papers 2209.06777, arXiv.org.
    9. M. Bumin Yenmez, 2014. "College Admissions," GSIA Working Papers 2014-E24, Carnegie Mellon University, Tepper School of Business.
    10. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    11. Orhan Aygün & Tayfun Sönmez, 2012. "The Importance of Irrelevance of Rejected Contracts in Matching under Weakened Substitutes Conditions," Boston College Working Papers in Economics 805, Boston College Department of Economics.
    12. Mehmet Ekmekci & M. Bumin Yenmez, "undated". "Integrating Schools for Centralized Admissions," GSIA Working Papers 2014-E20, Carnegie Mellon University, Tepper School of Business.
    13. Tam'as Fleiner & Zsuzsanna Jank'o & Ildik'o Schlotter & Alexander Teytelboym, 2018. "Complexity of Stability in Trading Networks," Papers 1805.08758, arXiv.org, revised Feb 2019.
    14. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
    15. Doğan, Battal & Yenmez, M. Bumin, 2019. "Unified versus divided enrollment in school choice: Improving student welfare in Chicago," Games and Economic Behavior, Elsevier, vol. 118(C), pages 366-373.
    16. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    17. Erdil, Aytek & Kumano, Taro, 2019. "Efficiency and stability under substitutable priorities with ties," Journal of Economic Theory, Elsevier, vol. 184(C).
    18. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
    19. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.
    20. Stefano Vannucci, 2011. "Widwast Choice," Department of Economics University of Siena 629, Department of Economics, University of Siena.
    21. Christopher En & Yuri Faenza, 2025. "Non-distributive Lattices, Stable Matchings, and Linear Optimization," Papers 2504.17916, arXiv.org.

    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. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    2. Ning Sun & Zaifu Yang, 2008. "A Double-Track Auction for Substitutes and Complements," KIER Working Papers 656, Kyoto University, Institute of Economic Research.
    3. Kazuo Murota & Yu Yokoi, 2015. "On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 460-473, February.
    4. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    5. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    6. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    7. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    8. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    9. Satoru Fujishige & Zaifu Yang, 2002. "Existence of an Equilibrium in a General Competitive Exchange Economy with Indivisible Goods and Money," Annals of Economics and Finance, Society for AEF, vol. 3(1), pages 135-147, May.
    10. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    11. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    12. Ma, Jinpeng & Nie, Fusheng, 2003. "Walrasian equilibrium in an exchange economy with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 159-192, October.
    13. Hatfield, John William & Immorlica, Nicole & Kominers, Scott Duke, 2012. "Testing substitutability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 639-645.
    14. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
    15. Sotomayor, Marilda, 2007. "Connecting the cooperative and competitive structures of the multiple-partners assignment game," Journal of Economic Theory, Elsevier, vol. 134(1), pages 155-174, May.
    16. Aron Matskin & Daniel Lehmann, 2009. "General Matching: Lattice Structure of the Set of Agreements," Discussion Paper Series dp501, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    17. Klaus, Bettina & Walzl, Markus, 2009. "Stable many-to-many matchings with contracts," Journal of Mathematical Economics, Elsevier, vol. 45(7-8), pages 422-434, July.
    18. John W. Hatfield & Paul Milgrom, 2005. "Auctions, Matching and the Law of Aggregate Demand," Levine's Bibliography 122247000000000780, UCLA Department of Economics.
    19. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
    20. Ma, Jinpeng, 2001. "Job Matching and Coalition Formation with Utility or Disutility of Co-workers," Games and Economic Behavior, Elsevier, vol. 34(1), pages 83-103, January.

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:eee:gamebe:v:58:y:2007:i:2:p:231-245. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.