Universally Balanced Combinatorial Optimization Games - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue Games Année : 2010

Universally Balanced Combinatorial Optimization Games

Résumé

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.
Fichier non déposé

Dates et versions

halshs-00670891 , version 1 (16-02-2012)

Identifiants

  • HAL Id : halshs-00670891 , version 1
  • PRODINRA : 245616

Citer

Gabrielle Demange, Xiaotie Deng. Universally Balanced Combinatorial Optimization Games. Games, 2010, 1 (3), pp.299-316. ⟨halshs-00670891⟩
168 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More