KNAW

Publicatie

Monotonic Stable Solutions for Minimum Coloring Games (2011) Open access

Pagina-navigatie:
Titel Monotonic Stable Solutions for Minimum Coloring Games
Gepubliceerd in CentER Discussion Paper, Vol. 2011-016.
Auteur Hamers, H.J.M.; Miquel, S.; Norde, H.W.
Datum 2011
Trefwoord(en) Minimum coloring game, population monotonic allocation scheme, (P4, 2K2)-free graph, quasi-threshold graph, Minimum coloring game, population monotonic allocation scheme, (P4, 2K2)-free graph, quasi-threshold graph
Taal Engels
Type Working paper
Uitgever Tilburg University. Center for Economic Research
Samenvatting 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.
Publicatie http://repository.uvt.nl/id/ir-uvt-nl:oai:wo.uvt.nl:4572426
Persistent Identifier urn:nbn:nl:ui:12-4572426
Metadata XML
Repository Tilburg University

Omhoog
Ga terug naar de inhoud
Ga terug naar de site navigatie