Item

Simple and three-valued simple coloring games

Musegaas,Marieke
; 
Borm,Peter
; 
Quant,Marieke
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.
Description
Date
2016-10
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
minimum coloring games, simple games, three-valued simple games
Citation
Musegaas, M, Borm, P & Quant, M 2016, 'Simple and three-valued simple coloring games', Mathematical Methods of Operations Research, vol. 84, no. 2, pp. 239-258. https://doi.org/10.1007/s00186-016-0542-4
URI
https://hdl.handle.net/20.500.14602/65709
Embedded videos