Computing an element in the lexicographic kernel of a game

Share/Save/Bookmark

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2006) Computing an element in the lexicographic kernel of a game. Mathematical methods of operations research, 63 (3). pp. 427-433. ISSN 1432-2994

[img]PDF
Restricted to UT campus only
: Request a copy
113Kb
Abstract:The lexicographic kernel of a game lexicographically maximizes the surplusses $s_{ij}$ (rather than the excesses as would the nucleolus). We show that an element in the lexicographic kernel can be computed efficiently, provided we can efficiently compute the surplusses $s_{ij}(x)$ corresponding to a given allocation $x$. This approach improves the results in Faigle et al. (in Int J Game Theory 30:79–98, 2001) and allows us to determine a kernel element without appealing to Maschler transfers in the execution of the algorithm.

Item Type:Article
Copyright:© 2006 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63649
Official URL:http://dx.doi.org/10.1007/s00186-006-0065-5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238281