Simple and three-valued simple minimum coloring games

Marieke Musegaas*, P.E.M. Borm, M. Quant

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

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.
Original languageEnglish
Pages (from-to)239-258
Number of pages20
JournalMathematical Methods of Operations Research
Volume84
DOIs
Publication statusPublished - 27 Apr 2016
Externally publishedYes

Fingerprint

Dive into the research topics of 'Simple and three-valued simple minimum coloring games'. Together they form a unique fingerprint.

Cite this