Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/108356
Authors: 
Núñez, Marina
Solymosi, Tamás
Year of Publication: 
2014
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2014/25
Abstract: 
We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationships between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationships. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.
Subjects: 
Assignment game
extreme core payoff
Alexia value
JEL: 
C71
ISBN: 
978-615-5447-44-0
Document Type: 
Working Paper

Files in This Item:
File
Size
454.02 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.