Monotonic Stable Solutions for Minimum Coloring Games

Research output: Working paperDiscussion paperOther research output

248 Downloads (Pure)

Abstract

For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is (P4, 2K2)-free (or, equivalently, if its complement graph G is quasi-threshold). Moreover, we provide a procedure that for these graphs always selects an integer population monotonic allocation scheme.
Original languageEnglish
Place of PublicationTilburg
PublisherOrganisation
Volume2011-016
Publication statusPublished - 2011

Publication series

NameCentER Discussion Paper
Volume2011-016

Keywords

  • Minimum coloring game
  • population monotonic allocation scheme
  • (P4
  • 2K2)-free graph
  • quasi-threshold graph

Fingerprint Dive into the research topics of 'Monotonic Stable Solutions for Minimum Coloring Games'. Together they form a unique fingerprint.

  • Cite this

    Hamers, H. J. M., Miquel, S., & Norde, H. W. (2011). Monotonic Stable Solutions for Minimum Coloring Games. (CentER Discussion Paper; Vol. 2011-016). Organisation.