IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v1y2010i3p299-316d9554.html
   My bibliography  Save this article

Universally Balanced Combinatorial Optimization Games

Author

Listed:
  • Gabrielle Demange

    (Paris School of Economics, 48 bd Jourdan, 75014 Paris, France)

  • Xiaotie Deng

    (Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong)

Abstract

This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no matter what are the admissible values assigned to the parameters defining these programs. We call such classes universally balanced. We present characterization and complexity results on the universally balancedness property for some classes of interesting combinatorial optimization games. In particular, we focus on the algorithmic properties for identifying universally balancedness for the games under discussion.

Suggested Citation

  • Gabrielle Demange & Xiaotie Deng, 2010. "Universally Balanced Combinatorial Optimization Games," Games, MDPI, vol. 1(3), pages 1-18, September.
    • Handle: RePEc:gam:jgames:v:1:y:2010:i:3:p:299-316:d:9554
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/1/3/299/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2073-4336/1/3/299/
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Discussion Paper 2005-118, Tilburg University, Center for Economic Research.
    3. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Other publications TiSEM 68df1061-50bc-43bf-b79c-a, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. Estevez-Fernandez, Arantza & Borm, Peter & Hamers, Herbert, 2006. "On the core of multiple longest traveling salesman games," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1816-1827, November.
    3. Boros, E. & Gurvich, V. & Vasin, A., 1997. "Stable families of coalitions and normal hypergraphs1," Mathematical Social Sciences, Elsevier, vol. 34(2), pages 107-123, October.
    4. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Tvede, Mich & Østerdal, Lars Peter, 2017. "Sharing the proceeds from a hierarchical venture," Games and Economic Behavior, Elsevier, vol. 102(C), pages 98-110.
    5. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Other publications TiSEM 2bddbf5c-c56d-4b10-ba47-5, Tilburg University, School of Economics and Management.
    6. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    7. Fan‐Chin Kung, 2006. "An Algorithm for Stable and Equitable Coalition Structures with Public Goods," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 8(3), pages 345-355, August.
    8. 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.
    9. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    10. 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.
    11. 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.
    12. Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005. "Strongly essential coalitions and the nucleolus of peer group games," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 447-460, September.
    13. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    14. Fan-Chin Kung, 2015. "Sorting out single-crossing preferences on networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(3), pages 663-672, March.
    15. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Discussion Paper 2007-40, Tilburg University, Center for Economic Research.
    16. 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.
    17. Demange, Gabrielle, 2024. "Stable outcomes in simple cooperative games," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    18. Philip Reny & Eyal Winter & Myrna Wooders, 2012. "The partnered core of a game with side payments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 521-536, July.
    19. 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.
    20. Haimanko, Ori & Le Breton, Michel & Weber, Shlomo, 2004. "Voluntary formation of communities for the provision of public projects," Journal of Economic Theory, Elsevier, vol. 115(1), pages 1-34, March.
    21. 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.

    More about this item

    Keywords

    combinatorial cooperative games; balanced; blocking; core; integrality;
    All these keywords.

    JEL classification:

    • C - Mathematical and Quantitative Methods
    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    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:gam:jgames:v:1:y:2010:i:3:p:299-316:d:9554. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.