Computing an element in the lexicographic kernel of a game

U. Faigle, Walter Kern, Jeroen Kuipers

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)


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.
Original languageUndefined
Article number10.1007/s00186-006-0065-5
Pages (from-to)427-433
Number of pages7
JournalMathematical methods of operations research
Issue number06EX1521/3
Publication statusPublished - Jul 2006


  • MSC-90C27
  • MSC-90D12
  • METIS-238281
  • EWI-8032
  • Computational Complexity
  • Kernel
  • lexicographic
  • IR-63649

Cite this