Universally Balanced Combinatorial Optimization Games
AbstractThis 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by MDPI, Open Access Journal in its journal Games.
Volume (Year): 1 (2010)
Issue (Month): 3 (September)
Contact details of provider:
Web page: http://www.mdpi.com/
combinatorial cooperative games; balanced; blocking; core; integrality;
Find related papers by JEL classification:
- C - Mathematical and Quantitative Methods
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Le Breton,Michel & Owen,Guillermo & Weber,Shlomo, 1991.
"Strongly balanced cooperative games,"
Discussion Paper Serie A
338, University of Bonn, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (XML Conversion Team).
If references are entirely missing, you can add them using this form.