Computing an element in the lexicographic kernel of a game

Share/Save/Bookmark

Faigle, U. and Kern, W. and Kuipers, J. (2002) Computing an element in the lexicographic kernel of a game. [Report]

[img]
Preview
PDF
133Kb
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 previously obtained results and allows us to determine a kernel element without appealing to Maschler transfers in the execution of the algorithm.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65849
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page