Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/98563 
Erscheinungsjahr: 
2010
Quellenangabe: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 1 [Issue:] 3 [Publisher:] MDPI [Place:] Basel [Year:] 2010 [Pages:] 299-316
Verlag: 
MDPI, Basel
Zusammenfassung: 
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.
Schlagwörter: 
combinatorial cooperative games
balanced
blocking
core
integrality
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Erscheint in der Sammlung:

Datei(en):
Datei
Größe
222.6 kB





Publikationen in EconStor sind urheberrechtlich geschützt.