Simple and Three-Valued Simple Minimum Coloring Games

Marieke Musegaas, Peter Borm, Marieke Quant

Research output: Working paperDiscussion paperOther research output

896 Downloads (Pure)

Abstract

In this paper minimum coloring games are considered. We characterize the type
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
Place of PublicationTilburg
PublisherCentER, Center for Economic Research
Number of pages18
Volume2015-032
Publication statusPublished - 24 Jun 2015

Publication series

NameCentER Discussion Paper
Volume2015-032

    Fingerprint

Keywords

  • Minimum coloring game
  • three-valued simple games

Cite this

Musegaas, M., Borm, P., & Quant, M. (2015). Simple and Three-Valued Simple Minimum Coloring Games. (CentER Discussion Paper; Vol. 2015-032). Tilburg: CentER, Center for Economic Research.