IDEAS home Printed from https://ideas.repec.org/a/bla/ijethy/v16y2020i3p349-354.html
   My bibliography  Save this article

Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence

Author

Listed:
  • Antonio Romero‐Medina
  • Matteo Triossi

Abstract

We prove that group strategy‐proofness and strategy‐proofness are equivalent requirements on stable mechanisms in priority‐based resource allocation problems with multi‐unit demand. The result extends to the model with contracts.

Suggested Citation

  • Antonio Romero‐Medina & Matteo Triossi, 2020. "Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence," International Journal of Economic Theory, The International Society for Economic Theory, vol. 16(3), pages 349-354, September.
    • Handle: RePEc:bla:ijethy:v:16:y:2020:i:3:p:349-354
    DOI: 10.1111/ijet.12214
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/ijet.12214
    Download Restriction: no
    File URL: https://libkey.io/10.1111/ijet.12214?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. James Schummer & Rakesh V. Vohra, 2013. "Assignment of Arrival Slots," American Economic Journal: Microeconomics, American Economic Association, vol. 5(2), pages 164-185, May.
    3. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    4. Bird, Charles G., 1984. "Group incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 14(4), pages 309-313.
    5. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    6. Schummer, James & Abizada, Azar, 2017. "Incentives in landing slot problems," Journal of Economic Theory, Elsevier, vol. 170(C), pages 29-55.
    7. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 557-567.
    8. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    9. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    10. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
    11. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2016. "Group Strategy-Proofness in Private Good Economies," American Economic Review, American Economic Association, vol. 106(4), pages 1073-1099, April.
    12. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    13. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
    14. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
    15. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    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. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.

    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. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
    2. Jörgen Kratz, 2017. "Overlapping multiple object assignments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 723-753, March.
    3. Chen, Yajing & Jiao, Zhenhua & Zhang, Yang & Zhao, Fang, 2021. "Resource allocation on the basis of priorities under multi-unit demand," Economics Letters, Elsevier, vol. 202(C).
    4. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    5. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    6. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    7. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    8. Papai, Szilvia, 2007. "Exchange in a general market with indivisible goods," Journal of Economic Theory, Elsevier, vol. 132(1), pages 208-235, January.
    9. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
    10. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    11. Doğan, Battal, 2016. "Responsive affirmative action in school choice," Journal of Economic Theory, Elsevier, vol. 165(C), pages 69-105.
    12. Antonio Romero-Medina & Matteo Triossi, 2017. "(Group) Strategy-proofness and stability in many-to many marching markets," Documentos de Trabajo 332, Centro de Economía Aplicada, Universidad de Chile.
    13. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
    14. Honda, Edward, 2021. "A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    15. Bettina Klaus & Alexandru Nichifor, 2020. "Serial dictatorship mechanisms with reservation prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 665-684, October.
    16. Jiao, Zhenhua & Tian, Guoqiang & Chen, Songqing & Yang, Fei, 2016. "The blocking lemma and group incentive compatibility for matching with contracts," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 65-71.
    17. Madhav Raghavan, 2017. "Serial Priority in Project Allocation: A Characterisation," Cahiers de Recherches Economiques du Département d'économie 17.17, Université de Lausanne, Faculté des HEC, Département d’économie.
    18. Martínez, Ruth & Massó, Jordi & Neme, Alejandro & Oviedo, Jorge, 2010. "The Blocking Lemma for a many-to-one matching model," Journal of Mathematical Economics, Elsevier, vol. 46(5), pages 937-949, September.
    19. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation," Working Papers 33, Barcelona School of Economics.
    20. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.

    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:bla:ijethy:v:16:y:2020:i:3:p:349-354. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=1742-7355 .

    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.