Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347869 | Computers & Operations Research | 2013 | 6 Pages |
Abstract
In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n) constraints whose coefficients belong to {â1,0,1}. We discuss the need of having all these constraints and empirically prove that they can be reduced to O(kmax2n), where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Justo Puerto, Federico Perea,