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

Stability properties of the core in a generalized assignment problem

Author

Listed:
  • Bando, Keisuke
  • Kawasaki, Ryo

Abstract

We show that the core of a generalized assignment problem satisfies two types of stability properties. First, the core is the unique stable set defined using the weak domination relation when outcomes are restricted to individually rational and pairwise feasible ones. Second, the core is the unique stable set with respect to a sequential domination relation that is defined by a sequence of weak domination relations that satisfy outsider independence. An equivalent way of stating this result is that the core satisfies the property commonly stated as the existence of a path to stability. These results add to the importance of the core in an assignment problem where agents' preferences may not be quasilinear.

Suggested Citation

  • Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
  • Handle: RePEc:eee:gamebe:v:130:y:2021:i:c:p:211-223
    DOI: 10.1016/j.geb.2021.08.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825621001147
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.geb.2021.08.007?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
    ---><---

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

    References listed on IDEAS

    as
    1. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    2. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2013. "An optimal bound to access the core in TU-games," Games and Economic Behavior, Elsevier, vol. 80(C), pages 1-9.
    3. Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
    4. Koczy, Laszlo A. & Lauwers, Luc, 2007. "The minimal dominant set is a non-empty core-extension," Games and Economic Behavior, Elsevier, vol. 61(2), pages 277-298, November.
    5. Thomas Demuynck & P. Jean‐Jacques Herings & Riccardo D. Saulle & Christian Seel, 2019. "The Myopic Stable Set for Social Environments," Econometrica, Econometric Society, vol. 87(1), pages 111-138, January.
    6. E. Inarra & C. Larrea & E. Molis, 2008. "Random paths to P-stability in the roommate problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 461-471, March.
    7. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    8. Feldman, Allan M, 1974. "Recontracting Stability," Econometrica, Econometric Society, vol. 42(1), pages 35-44, January.
    9. Klaus, Bettina & Klijn, Flip, 2007. "Paths to stability for matching markets with couples," Games and Economic Behavior, Elsevier, vol. 58(1), pages 154-171, January.
    10. Chen, Bo & Fujishige, Satoru & Yang, Zaifu, 2016. "Random decentralized market processes for stable job matchings with competitive salaries," Journal of Economic Theory, Elsevier, vol. 165(C), pages 25-36.
    11. Nax, Heinrich H. & Pradelski, Bary S. R., 2015. "Evolutionary dynamics and equitable core selection in assignment games," LSE Research Online Documents on Economics 65428, London School of Economics and Political Science, LSE Library.
    12. Green, Jerry R, 1974. "The Stability of Edgeworth's Recontracting Process," Econometrica, Econometric Society, vol. 42(1), pages 21-34, January.
    13. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
    14. Hiroki Saitoh & Shigehiro Serizawa, 2008. "Vickrey allocation rule with income effect," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 35(2), pages 391-401, May.
    15. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-888, July.
    16. Debraj Ray & Rajiv Vohra, 2015. "The Farsighted Stable Set," Econometrica, Econometric Society, vol. 83(3), pages 977-1011, May.
    17. Ryosuke Sakai & Shigehiro Serizawa, 2020. "Strategy-proof mechanism design with non-quasilinear preferences: Ex-post revenue maximization for an arbitrary number of objects," ISER Discussion Paper 1107, Institute of Social and Economic Research, Osaka University.
    18. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    19. Kaneko, Mamoru, 1982. "The central assignment game and the assignment markets," Journal of Mathematical Economics, Elsevier, vol. 10(2-3), pages 205-232, September.
    20. Diamantoudi, Effrosyni & Miyagawa, Eiichi & Xue, Licun, 2004. "Random paths to stability in the roommate problem," Games and Economic Behavior, Elsevier, vol. 48(1), pages 18-28, July.
    21. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
    22. Núñez, Marina & Rafels, Carles, 2013. "Von Neumann–Morgenstern solutions in the assignment market," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1282-1291.
    23. Ehlers, Lars, 2007. "Von Neumann-Morgenstern stable sets in matching problems," Journal of Economic Theory, Elsevier, vol. 134(1), pages 537-547, May.
    24. Koczy, Laszlo A., 2006. "The core can be accessed with a bounded number of blocks," Journal of Mathematical Economics, Elsevier, vol. 43(1), pages 56-64, December.
    25. Alkan, Ahmet & Gale, David, 1990. "The core of the matching game," Games and Economic Behavior, Elsevier, vol. 2(3), pages 203-212, September.
    26. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    27. Toyotaka Sakai, 2008. "Second price auctions on general preference domains: two characterizations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 37(2), pages 347-356, November.
    28. Jean-Jacques Herings, P. & Mauleon, Ana & Vannetelbosch, Vincent, 2017. "Stable sets in matching problems with coalitional sovereignty and path dominance," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 14-19.
    29. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    30. Mitsunobu Miyake, 1998. "On the incentive properties of multi-item auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(1), pages 1-19.
    31. Dezső Bednay, 2014. "Stable sets in one-seller assignment games," Annals of Operations Research, Springer, vol. 222(1), pages 143-152, November.
    32. , & ,, 2015. "Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule," Theoretical Economics, Econometric Society, vol. 10(2), May.
    33. Jean-Jacques HERINGS & Ana MAULEON & Vincent VANNETELBOSCH, 2017. "Stable sets in matching problems with coalitional sovereignty path dominance," LIDAM Reprints CORE 2861, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    34. Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 187-202, October.
    35. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
    36. Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-1480, November.
    37. Heinrich Nax & Bary Pradelski, 2015. "Evolutionary dynamics and equitable core selection in assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 903-932, November.
    38. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    39. Fuhito Kojima & M. Ünver, 2008. "Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 473-488, March.
    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. Núñez, Marina & Vidal-Puga, Juan, 2022. "Stable cores in information graph games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 353-367.

    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. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    2. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    3. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, July.
    4. Klaus, Bettina & Newton, Jonathan, 2016. "Stochastic stability in assignment problems," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 62-74.
    5. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.
    6. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    7. Jean-Jacques Herings, P. & Mauleon, Ana & Vannetelbosch, Vincent, 2017. "Stable sets in matching problems with coalitional sovereignty and path dominance," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 14-19.
    8. Péter Szikora, 2013. "Introduction into the literature of cooperative game theory with special emphasis on dynamic games and the core," Proceedings- 11th International Conference on Mangement, Enterprise and Benchmarking (MEB 2013),, Óbuda University, Keleti Faculty of Business and Management.
    9. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    10. Yuya Wakabayashi & Ryosuke Sakai & Shigehiro Serizawa, 2022. "A Characterization of the Minimum Price Walrasian Rule with Reserve Prices for an Arbitrary Number of Agents and Objects," ISER Discussion Paper 1161, Institute of Social and Economic Research, Osaka University.
    11. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Matching with myopic and farsighted players," Journal of Economic Theory, Elsevier, vol. 190(C).
    12. Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 187-202, October.
    13. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    14. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
    15. Malik, Komal & Mishra, Debasis, 2021. "Pareto efficient combinatorial auctions: Dichotomous preferences without quasilinearity," Journal of Economic Theory, Elsevier, vol. 191(C).
    16. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    17. Heinrich Nax & Bary Pradelski, 2015. "Evolutionary dynamics and equitable core selection in assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 903-932, November.
    18. Ryosuke Sakai & Shigehiro Serizawa, 2020. "Strategy-proof mechanism design with non-quasilinear preferences: Ex-post revenue maximization for an arbitrary number of objects," ISER Discussion Paper 1107, Institute of Social and Economic Research, Osaka University.
    19. Yu Zhou & Shigehiro Serizawa, 2016. "Strategy-Proofness and Efficiency for Non-quasi-linear Common-Tiered-Object Preferences: Characterization of Minimum Price Rule," ISER Discussion Paper 0971, Institute of Social and Economic Research, Osaka University.
    20. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1021-1040, November.

    More about this item

    Keywords

    Generalized assignment problem; Core; Stable set; Path to stability;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • 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:130:y:2021:i:c:p:211-223. 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.