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. © 2010 by the authors; licensee MDPI Basel, Switzerland.
| Original language | English |
|---|---|
| Pages (from-to) | 299-316 |
| Journal | Games |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Sept 2010 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Balanced
- Blocking
- Combinatorial cooperative games
- Core
- Integrality
Publisher's Copyright Statement
- This full text is made available under CC-BY 3.0. https://creativecommons.org/licenses/by/3.0/
Fingerprint
Dive into the research topics of 'Universally balanced combinatorial optimization games'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver