Fast computation of the leastcore and prenucleolus of cooperative games

Abstract : The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among $N$ players. It has, however, the drawback being a linear programming problem with $2^N-2$ constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially continuous coalitions. We also study the computation of prenucleolus, and display encouraging numerical results.
Type de document :
Rapport
[Research Report] RR-5956, INRIA. 2006, pp.15
Liste complète des métadonnées

https://hal.inria.fr/inria-00087029
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 1 août 2006 - 15:45:38
Dernière modification le : vendredi 25 mai 2018 - 12:02:04
Document(s) archivé(s) le : lundi 20 septembre 2010 - 16:01:35

Fichiers

Identifiants

  • HAL Id : inria-00087029, version 2

Collections

Citation

J. Frederic Bonnans, Matthieu Andre. Fast computation of the leastcore and prenucleolus of cooperative games. [Research Report] RR-5956, INRIA. 2006, pp.15. 〈inria-00087029v2〉

Partager

Métriques

Consultations de la notice

256

Téléchargements de fichiers

212