Monotonic stable solutions for minimum coloring games

• 成果类型: Article
• 署名作者: Hamers, H.; Miquel, S.; Norde, H.
• 署名单位: Tilburg University; Tilburg University; Universitat de Lleida
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-013-0655-y
• 发表日期: 2014
• 页码: 509-529
• 关键词: combinatorial optimization games; production-inventory games; core; graphs; point

摘要

For the class of minimum coloring games (introduced by Deng et al. Math Oper Res, 24:751-766, 1999) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont Games Econ Behav 2:378-394, 1990). We show that a minimum coloring game on a graph has a population monotonic allocation scheme if and only if is -free (or, equivalently, if its complement graph is quasi-threshold). Moreover, we provide a procedure that for these graphs always selects an integer population monotonic allocation scheme.