Open AccessThis article is
- freely available
Universally Balanced Combinatorial Optimization Games
Paris School of Economics, 48 bd Jourdan, 75014 Paris, France
Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong
* Author to whom correspondence should be addressed.
Received: 27 May 2010; in revised form: 18 August 2010 / Accepted: 23 August 2010 / Published: 13 September 2010
Abstract: This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no matter what are the admissible values assigned to the parameters defining these programs. We call such classes universally balanced. We present characterization and complexity results on the universally balancedness property for some classes of interesting combinatorial optimization games. In particular, we focus on the algorithmic properties for identifying universally balancedness for the games under discussion.
Keywords: combinatorial cooperative games; balanced; blocking; core; integrality
Citations to this Article
Cite This Article
MDPI and ACS Style
Demange, G.; Deng, X. Universally Balanced Combinatorial Optimization Games. Games 2010, 1, 299-316.
Demange G, Deng X. Universally Balanced Combinatorial Optimization Games. Games. 2010; 1(3):299-316.
Demange, Gabrielle; Deng, Xiaotie. 2010. "Universally Balanced Combinatorial Optimization Games." Games 1, no. 3: 299-316.