The maximum and the addition of assignment games

  1. S. Miquel 1
  2. M. Núñez 2
  1. 1 Universidad de LLeida, España
  2. 2 Universidad de Barcelona, España
Revista:
Top

ISSN: 1863-8279 1134-5764

Año de publicación: 2011

Volumen: 19

Número: 1

Páginas: 189-212

Tipo: Artículo

Otras publicaciones en: Top

Resumen

In the framework of two-sided assignment markets, we first consider that, with several markets available, the players may choose where to trade. It is shown that the corresponding game, represented by the maximum of a finite set of assignment games, may not be balanced. Some conditions for balancedness are provided and, in that case, properties of the core are analyzed. Secondly, we consider that players may trade simultaneously in more than one market and then add up the profits. The corresponding game, represented by the sum of a finite set of assignment games, is balanced. Moreover, under some conditions, the sum of the cores of two assignment games coincides with the core of the sum game.

Información de financiación

Acknowledgements The authors thank Carles Rafels for his very helpful comments. Support from Min-isterio de Educación y Ciencia, under grant MTM 2005-09362-C03-02 is acknowledged by the first author. Support from Ministerio de Educación y Ciencia and FEDER, under grant ECO2008-02344/ECON, and of Generalitat de Catalunya, under grant 2005SGR00984, is acknowledged by the second author.

Financiadores