Next Article in Journal
Coevolution of Cooperation, Response to Adverse Social Ties and Network Structure
Next Article in Special Issue
Partial Cooperative Equilibria: Existence and Characterization
Previous Article in Journal / Special Issue
Coalition Formation among Farsighted Agents
Games 2010, 1(3), 299-316; doi:10.3390/g1030299

Universally Balanced Combinatorial Optimization Games

1 Paris School of Economics, 48 bd Jourdan, 75014 Paris, France 2 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 / Revised: 18 August 2010 / Accepted: 23 August 2010 / Published: 13 September 2010
(This article belongs to the Special Issue Coalition Formation)
View Full-Text   |   Download PDF [223 KB, uploaded 13 September 2010]


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 combinatorial cooperative games; balanced; blocking; core; integrality
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Demange, G.; Deng, X. Universally Balanced Combinatorial Optimization Games. Games 2010, 1, 299-316.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert