Advanced Search
MyIDEAS: Login to save this paper or follow this series

Monotonic Stable Solutions for Minimum Coloring Games

Contents:

Author Info

  • Hamers, H.J.M.
  • Miquel, S.
  • Norde, H.W.

    (Tilburg University, Center for Economic Research)

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://arno.uvt.nl/show.cgi?fid=113917
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2011-016.

as in new window
Length:
Date of creation: 2011
Date of revision:
Handle: RePEc:dgr:kubcen:2011016

Contact details of provider:
Web page: http://center.uvt.nl

Related research

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

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Platz, Trine Tornøe & Hamers, Herbert, 2012. "On games arising from multi-depot Chinese postman problems," Discussion Papers of Business and Economics 24/2012, Department of Business and Economics, University of Southern Denmark.
  2. Hamers, H.J.M. & Josune Albizuri, M., 2013. "Graphs Inducing Totally Balanced and Submodular Chinese Postman Games," Discussion Paper 2013-006, Tilburg University, Center for Economic Research.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:2011016. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.