A. Meca, L. A. Guardiola Alcalá, J. Puerto Albandoz

Production-inventory games were introduced in Guardiola et al. (2009) as a new class of totally balanced combinatorial optimization games. From among all core-allocation, the Owen point was proposed as a specifically appealing solution. In this talk we analyze the structure of the core for these games, checking their algorithmic complexity. Specifically, we prove that the number of extreme point of its core is exponential in the number of players. In addition, we study alternative core-allocations that recognize the contribution of the essential players in the cost savings of the grand coalition.

Keywords: Production-Inventory games, core, totally balanced, combinatorial optimization games, extreme points

Scheduled

GT2-1 MA-1 Game Theory. Tribute to Marco Antonio López
September 5, 2019  10:40 AM
I3L8. Georgina Blanes building


Other papers in the same session

Allocating fixed cost in transport systems

M. T. Estañ Pereña, N. Llorca Pascual, R. Martinez, J. Sánchez Soriano

Harsanyi power solutions on winning coalition structures

E. Algaba, S. Béal, E. Rémila, P. Solal

Merge-proofness in shortest path games

E. Bahel, M. Gómez Rúa, J. Vidal-Puga


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.