|
|
|
|
||||
|
||||
Monotonic Stable Solutions for Minimum Coloring GamesHerbert HamersTilburg University - Center for Economic Research (CentER); Tilburg University - Department of Econometrics & Operations Research Sylvia MiquelUniversity of Lleida - Department of Mathematics Henk NordeTilburg University - Center For Economic Research; Tilburg University - Department of Econometrics & Operations Research February 17, 2011 CentER Discussion Paper No. 2011-016 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.
Number of Pages in PDF File: 20 Keywords: Minimum Coloring Game, Population Monotonic Allocation Scheme JEL Classification: C71 working papers seriesDate posted: February 19, 2011Suggested CitationContact Information
|
|
||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo5 in 1.938 seconds
