J. Puerto Albandoz, F. Perea Rojas-Marcos
This paper introduces a row and column generation algorithm for finding
the nucleolus, based on a linear programming model proposed in an earlier
research. Since this approach cannot return an allocation for large games, we
also propose a heuristic approach, which is based on sampling the coalitions
space. Experiments over games with 12 players show that the proposed
heuristic finds allocations which are close to the true nucleolus, in a reasonable
amount of time. Experiments over 100-player games show that the proposed
heuristic can be applied to games of large size.
Palabras clave: Nucleolus, Game Theory, Linear Programming, Heuristic
Programado
GT2-2 MA-2 Teoría de Juegos. Homenaje a Marco Antonio López
5 de septiembre de 2019 12:00
I3L8. Edificio Georgina Blanes