Fast computation of the leastcore and prenucleolus of cooperative games - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

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.
Fichier principal
Vignette du fichier
RR-5956.pdf (265.77 Ko) Télécharger le fichier

Dates and versions

inria-00087029 , version 1 (21-07-2006)
inria-00087029 , version 2 (01-08-2006)

Identifiers

  • HAL Id : inria-00087029 , version 2

Cite

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⟩
98 View
268 Download

Share

Gmail Facebook Twitter LinkedIn More