IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v16y2008i4p425-440.html
   My bibliography  Save this article

Bargaining sets and the core in partitioning games

Author

Listed:
  • Tamás Solymosi

Abstract

Partitioning games are useful on two counts: first, in modeling situations with restricted cooperative possibilities between the agents; second, as a general framework for many unrestricted cooperative games generated by combinatorial optimization problems.We show that the family of partitioning games defined on a fixed basic collection is closed under the strategic equivalence of games, and also for taking the monotonic cover of games. Based on these properties we establish the coincidence of the Mas-Colell, the classical, the semireactive, and the reactive bargaining setswith the core for interesting balanced subclasses of partitioning games, including assignment games, tree-restricted superadditive games, and simple network games. Copyright Springer-Verlag 2008

Suggested Citation

  • 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.
    • Handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:425-440
    DOI: 10.1007/s10100-008-0070-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-008-0070-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-008-0070-2?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. Peter Sudhölter & Jos A. M. Potters, 2001. "The semireactive bargaining set of a cooperative game," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(1), pages 117-139.
    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. Solymosi, T. & Raghavan, T.E.S. & Tijs, S.H., 2003. "Bargaining sets and the core in permutation games," Other publications TiSEM a14f6955-62c4-4bf0-8a54-f, Tilburg University, School of Economics and Management.
    4. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    5. Mas-Colell, Andreu, 1989. "An equivalence theorem for a bargaining set," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 129-139, April.
    6. Ehud Kalai & Eitan Zemel, 1982. "Generalized Network Problems Yielding Totally Balanced Games," Operations Research, INFORMS, vol. 30(5), pages 998-1008, October.
    7. Potters, Jos & Reijnierse, Hans, 1995. "Gamma-Component Additive Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(1), pages 49-56.
    8. TamÂs Solymosi, 1999. "On the bargaining set, kernel and core of superadditive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(2), pages 229-240.
    9. Daniel Granot & Frieda Granot, 1992. "On Some Network Flow Games," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 792-841, November.
    10. Kaneko, Mamoru & Wooders, Myrna Holtz, 1982. "Cores of partitioning games," Mathematical Social Sciences, Elsevier, vol. 3(4), pages 313-327, 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. R. Arribillaga, 2015. "Convergence of the approximate cores to the aspiration core in partitioning games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 521-534, July.
    2. 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.
    3. Josep Maria Izquierdo & Carles Rafels, 2018. "The core and the steady bargaining set for convex games," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 35-54, March.
    4. Ferenc Forgó & László Kóczy & Miklós Pintér, 2015. "Editorial," 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. 23(4), pages 723-725, December.
    5. Atay, Ata & Solymosi, Tamás, 2018. "On bargaining sets of supplier-firm-buyer games," Economics Letters, Elsevier, vol. 167(C), pages 99-103.
    6. Jesús Getán & Josep Izquierdo & Jesús Montes & Carles Rafels, 2015. "The bargaining set for almost-convex games," Annals of Operations Research, Springer, vol. 225(1), pages 83-89, February.
    7. Josep M. Izquierdo & Carles Rafels, 2010. "On the coincidence between the Shimomuras bargaining sets and the core," Working Papers in Economics 241, Universitat de Barcelona. Espai de Recerca en Economia.

    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 & Marina Núñez, 2019. "Multi-sided assignment games on m-partite graphs," Annals of Operations Research, Springer, vol. 279(1), pages 271-290, August.
    2. Atay, Ata & Solymosi, Tamás, 2018. "On bargaining sets of supplier-firm-buyer games," Economics Letters, Elsevier, vol. 167(C), pages 99-103.
    3. E. Algaba & J.M. Bilbao & J.J. López, 2001. "A unified approach to restricted games," Theory and Decision, Springer, vol. 50(4), pages 333-345, June.
    4. 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.
    5. Josep M. Izquierdo & Carles Rafels, 2010. "On the coincidence between the Shimomuras bargaining sets and the core," Working Papers in Economics 241, Universitat de Barcelona. Espai de Recerca en Economia.
    6. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    7. Herings, P. Jean-Jacques & van der Laan, Gerard & Talman, Dolf, 2007. "The socially stable core in structured transferable utility games," Games and Economic Behavior, Elsevier, vol. 59(1), pages 85-104, April.
    8. Massimiliano Amarante & Luigi Montrucchio, 2010. "The bargaining set of a large game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(3), pages 313-349, June.
    9. 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.
    10. 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.
    11. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    12. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    13. 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.
    14. Massimiliano Amarante & Luigi Montrucchio, 2007. "Mas-Colell Bargaining Set of Large Games," Carlo Alberto Notebooks 63, Collegio Carlo Alberto.
    15. Mishra, D. & Talman, A.J.J., 2009. "A Characterization of the Average Tree Solution for Cycle-Free Graph Games," Discussion Paper 2009-17, Tilburg University, Center for Economic Research.
    16. Dai, Zhuang & Liu, Xiaoyue Cathy & Chen, Zhuo & Guo, Renyong & Ma, Xiaolei, 2019. "A predictive headway-based bus-holding strategy with dynamic control point selection: A cooperative game theory approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 29-51.
    17. Perea, F. & Puerto, J. & Fernández, F.R., 2009. "Modeling cooperation on a class of distribution problems," European Journal of Operational Research, Elsevier, vol. 198(3), pages 726-733, November.
    18. Heinz, S. & Krumke, S.O. & Megow, N. & Rambau, J. & Tuscherer, A. & Vredeveld, T., 2005. "The online target date assignment problem," Research Memorandum 056, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    19. Kovalenkov, A. & Holtz Wooders, M., 1997. "Epsilon Cores of Games and Economies With Limited Side Payments," UFAE and IAE Working Papers 392.97, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    20. 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.

    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:spr:cejnor:v:16:y:2008:i:4:p:425-440. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.