@article{b82fc6ad5a9f4648bf468c9df1526f10,
title = "Computing an element in the lexicographic kernel of a game",
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.",
keywords = "MSC-90C27, MSC-90D12, Computational Complexity, Kernel, Lexicographic",
author = "Ulrich Faigle and Walter Kern and Jeroen Kuipers",
year = "2006",
month = jul,
doi = "10.1007/s00186-006-0065-5",
language = "English",
volume = "63",
pages = "427--433",
journal = "Mathematical methods of operations research",
issn = "1432-2994",
publisher = "Springer",
}