IDEAS home Printed from https://ideas.repec.org/p/ewp/wpaper/357web.html
   My bibliography  Save this paper

Multi-sided assignment games on m-partite graphs

Author

Listed:
  • Ata Atay

    (Universitat de Barcelona)

  • Marina Núñez

    (Universitat de Barcelona)

Abstract

We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c) the worth of a basic coalition is the addition of the weights of all its pairs that belong to connected sectors. We provide a sufficient condition on the weights to guarantee balancedness of the related multi-sided assignment game. Moreover, when the graph on the sectors is cycle-free, we prove the game is strongly balanced and the core is described by means of the cores of the underlying two-sided assignment games associated with the edges of this graph. Moreover, once selected a spanning tree of the cycle-free graph on the sectors, the equivalence between core and competitive equilibria is established.

Suggested Citation

  • Ata Atay & Marina Núñez, 2017. "Multi-sided assignment games on m-partite graphs," UB School of Economics Working Papers 2017/357, University of Barcelona School of Economics.
    • Handle: RePEc:ewp:wpaper:357web
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/2445/106002
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    2. Le Breton, M & Owen, G & Weber, S, 1992. "Strongly Balanced Cooperative Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 419-427.
    3. Stuart, Harborne Jr, 1997. "The supplier-firm-buyer game and its m-sided generalization," Mathematical Social Sciences, Elsevier, vol. 34(1), pages 21-27, August.
    4. M. Grabisch & A. Skoda, 2012. "Games induced by the partitioning of a graph," Annals of Operations Research, Springer, vol. 201(1), pages 229-249, December.
    5. Quint, Thomas, 1991. "The core of an m-sided assignment game," Games and Economic Behavior, Elsevier, vol. 3(4), pages 487-503, November.
    6. repec:hal:pseose:hal-00830291 is not listed on IDEAS
    7. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    8. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    9. John William Hatfield & Scott Duke Kominers, 2012. "Matching in Networks with Bilateral Contracts," American Economic Journal: Microeconomics, American Economic Association, vol. 4(1), pages 176-208, February.
    10. Khmelnitskaya, Anna & Talman, Dolf, 2014. "Tree, web and average web values for cycle-free directed graph games," European Journal of Operational Research, Elsevier, vol. 235(1), pages 233-246.
    11. Alvin E. Roth, 1985. "Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions," Mathematics of Operations Research, INFORMS, vol. 10(3), pages 379-389, August.
    12. Xiaotie Deng & Toshihide Ibaraki & Hiroshi Nagamochi, 1999. "Algorithmic Aspects of the Core of Combinatorial Optimization Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 751-766, August.
    13. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008. "Core stability in chain-component additive games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 116-139, January.
    15. Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(2), pages 119-143.
    16. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-479, June.
    17. Daniel Granot & Frieda Granot, 1992. "On Some Network Flow Games," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 792-841, November.
    18. Michael Ostrovsky, 2008. "Stability in Supply Chain Networks," American Economic Review, American Economic Association, vol. 98(3), pages 897-923, June.
    19. Kaneko, Mamoru & Wooders, Myrna Holtz, 1982. "Cores of partitioning games," Mathematical Social Sciences, Elsevier, vol. 3(4), pages 313-327, December.
    20. Ata Atay & Francesc Llerena & Marina Núñez, 2016. "Generalized three-sided assignment markets: core consistency and competitive prices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 572-593, October.
    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. Trudeau, Christian, 2018. "From the bankruptcy problem and its Concede-and-Divide solution to the assignment problem and its Fair Division solution," Games and Economic Behavior, Elsevier, vol. 108(C), pages 225-238.
    2. Martínez-de-Albéniz, F. Javier & Rafels, Carlos & Ybern, Neus, 2020. "Assortative multisided assignment games: The extreme core points," Games and Economic Behavior, Elsevier, vol. 120(C), pages 144-153.
    3. Ata Atay & Eric Bahel & Tamás Solymosi, 2023. "Matching markets with middlemen under transferable utility," Annals of Operations Research, Springer, vol. 322(2), pages 539-563, March.
    4. Atay, Ata & Solymosi, Tamás, 2018. "On bargaining sets of supplier-firm-buyer games," Economics Letters, Elsevier, vol. 167(C), pages 99-103.
    5. Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).

    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. Ata Atay & Eric Bahel & Tamás Solymosi, 2023. "Matching markets with middlemen under transferable utility," Annals of Operations Research, Springer, vol. 322(2), pages 539-563, March.
    2. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    3. O. Tejada & M. Álvarez-Mozos, 2016. "Vertical syndication-proof competitive prices in multilateral assignment markets," Review of Economic Design, Springer;Society for Economic Design, vol. 20(4), pages 289-327, December.
    4. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    5. Oriol Tejada & Marina Núñez, 2012. "The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(2), pages 199-220, April.
    6. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    7. Tamás Solymosi, 2008. "Bargaining sets and the core in partitioning games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 425-440, December.
    8. Atay, Ata & Solymosi, Tamás, 2018. "On bargaining sets of supplier-firm-buyer games," Economics Letters, Elsevier, vol. 167(C), pages 99-103.
    9. Ata Atay & Francesc Llerena & Marina Núñez, 2016. "Generalized three-sided assignment markets: core consistency and competitive prices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 572-593, October.
    10. Oriol Tejada & Carles Rafels, 2010. "Symmetrically multilateral-bargained allocations in multi-sided assignment markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 249-258, March.
    11. Streekstra, Leanne & Trudeau, Christian, 2020. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 7/2020, University of Southern Denmark, Department of Economics.
    12. Atay, Ata & Núñez, Marina, 2019. "A note on the relationship between the core and stable sets in three-sided markets," Mathematical Social Sciences, Elsevier, vol. 98(C), pages 10-14.
    13. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    14. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    15. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    16. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    17. Alexandre Skoda, 2019. "Convexity of graph-restricted games induced by minimum partitions," Post-Print halshs-01617023, HAL.
    18. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    19. René Brink, 2012. "On hierarchies and communication," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 721-735, October.
    20. Marina Núñez & Carles Rafels, 2006. "A Canonical Representation for the Assignment Game: the Kernel and the Nucleolus," Working Papers 279, Barcelona School of Economics.
    21. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Post-Print halshs-02967120, HAL.

    More about this item

    Keywords

    Cooperative games; multi-sided assignment games; core; competitive equilibria.;
    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:ewp:wpaper:357web. 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: University of Barcelona School of Economics (email available below). General contact details of provider: https://edirc.repec.org/data/feubaes.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.