IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/425c90bb-c6c6-4561-ad44-111883cd7bc4.html
   My bibliography  Save this paper

Simple and Three-Valued Simple Minimum Coloring Games

Author

Listed:
  • Musegaas, Marieke

    (Tilburg University, School of Economics and Management)

  • Borm, Peter

    (Tilburg University, School of Economics and Management)

  • Quant, Marieke

    (Tilburg University, School of Economics and Management)

Abstract

In this paper minimum coloring games are considered. We characterize the class of conflict graphs inducing simple or three-valued simple minimum coloring games. We provide an upper bound on the number of maximum cliques of conflict graphs inducing such games. Moreover, a characterization of the core is provided in terms of the underlying conflict graph. In particular, in case of a perfect conflict graph the core of an induced three-valued simple minimum coloring game equals the vital core.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Musegaas, Marieke & Borm, Peter & Quant, Marieke, 2015. "Simple and Three-Valued Simple Minimum Coloring Games," Other publications TiSEM 425c90bb-c6c6-4561-ad44-1, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:425c90bb-c6c6-4561-ad44-111883cd7bc4
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/6994535/2015_032.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    2. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    3. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    4. Shapley, L. S. & Shubik, Martin, 1954. "A Method for Evaluating the Distribution of Power in a Committee System," American Political Science Review, Cambridge University Press, vol. 48(3), pages 787-792, September.
    5. 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.
    6. Yoshio Okamoto, 2003. "Submodularity of some classes of the combinatorial optimization games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(1), pages 131-139, September.
    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. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    2. Miles, Sandra Jeanquart & McCamey, Randy, 2018. "The candidate experience: Is it damaging your employer brand?," Business Horizons, Elsevier, vol. 61(5), pages 755-764.

    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. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    2. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    3. Sergei Dotsenko & Vladimir Mazalov, 2021. "A Cooperative Network Packing Game with Simple Paths," Mathematics, MDPI, vol. 9(14), pages 1-18, July.
    4. Algaba, Encarnación & Béal, Sylvain & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Relationship between labeled network games and other cooperative games arising from attributes situations," Economics Letters, Elsevier, vol. 185(C).
    5. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    6. Stefano Moretti & Henk Norde, 2022. "Some new results on generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 87-118, March.
    7. Westerink-Duijzer, L.E. & Schlicher, L.P.J. & Musegaas, M., 2019. "Fair allocations for cooperation problems in vaccination," Econometric Institute Research Papers EI2019-06, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Boram Park & Suh-Ryung Kim & Hye Kyung Kim, 2013. "On the cores of games arising from integer edge covering functions of graphs," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 786-798, November.
    9. Lotty E. Westerink‐Duijzer & Loe P. J. Schlicher & Marieke Musegaas, 2020. "Core Allocations for Cooperation Problems in Vaccination," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1720-1737, July.
    10. Bergantiños, Gustavo & Gómez-Rúa, María & Llorca, Natividad & Pulido, Manuel & Sánchez-Soriano, Joaquín, 2020. "Allocating costs in set covering problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1074-1087.
    11. Herbert Hamers & Nayat Horozoglu & Henk Norde & Trine Tornøe Platz, 2022. "On the properties of weighted minimum colouring games," Annals of Operations Research, Springer, vol. 318(2), pages 963-983, November.
    12. Shellshear, Evan & Sudhölter, Peter, 2009. "On core stability, vital coalitions, and extendability," Games and Economic Behavior, Elsevier, vol. 67(2), pages 633-644, November.
    13. Eric Bahel & Christian Trudeau, 2022. "Minimum coloring problems with weakly perfect graphs," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 211-231, June.
    14. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
    15. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    16. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2020. "Efficient computation of the Shapley value for large-scale linear production games," Annals of Operations Research, Springer, vol. 287(2), pages 761-781, April.
    17. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB School of Economics Working Papers 2015/333, University of Barcelona School of Economics.
    18. Luis A. Guardiola & Ana Meca & Justo Puerto, 2021. "Enforcing fair cooperation in production-inventory settings with heterogeneous agents," Annals of Operations Research, Springer, vol. 305(1), pages 59-80, October.
    19. Hamers, Herbert & Horozoglu, Nayat & Norde, Henk & Platz, Trine Tornoe, 2022. "On the properties of weighted minimum colouring games," Other publications TiSEM ee84d5e4-08d7-4154-9521-2, Tilburg University, School of Economics and Management.
    20. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision 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:tiu:tiutis:425c90bb-c6c6-4561-ad44-111883cd7bc4. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.