@book{cdddba1f4ace4bddb22a934383879e96,

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 previously obtained results and allows us to determine a kernel element without appealing to Maschler transfers in the execution of the algorithm.",

keywords = "MSC-90C27, IR-65849, EWI-3483, MSC-90D12",

author = "U. Faigle and Walter Kern and J. Kuipers",

note = "Imported from MEMORANDA",

year = "2002",

language = "Undefined",

series = "Memorandum / Faculty of Mathematical Sciences",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1663",

}