Computing an element in the lexicographic kernel of a game

Ulrich Faigle; Walter Kern; Jeroen Kuipers

Computing an element in the lexicographic kernel of a game

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Discrete Mathematics and Mathematical Programming

Research output: Book/Report › Report › Professional

63 Downloads (Pure)

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.

Original language	English
Place of Publication	Enschede
Publisher	University of Twente, Department of Applied Mathematics
Number of pages	6
Publication status	Published - 2002

Publication series

Name	Memorandum / Faculty of Mathematical Sciences
Publisher	Department of Applied Mathematics, University of Twente
No.	1663
ISSN (Print)	0169-2690

Keywords

MSC-90C27
MSC-90D12

Access to Document

Faigle2002computingFinal published version, 134 KB

1 Article

Computing an element in the lexicographic kernel of a game
Faigle, U., Kern, W. & Kuipers, J., Jul 2006, In: Mathematical methods of operations research. 63, p. 427-433 7 p.
Research output: Contribution to journal › Article › Academic › peer-review
4 Citations (Scopus)

Cite this

@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, MSC-90D12",

author = "Ulrich Faigle and Walter Kern and Jeroen Kuipers",

year = "2002",

language = "English",

series = "Memorandum / Faculty of Mathematical Sciences",

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

number = "1663",

}

TY - BOOK

T1 - Computing an element in the lexicographic kernel of a game

AU - Faigle, Ulrich

AU - Kern, Walter

AU - Kuipers, Jeroen

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - MSC-90C27

KW - MSC-90D12

M3 - Report

T3 - Memorandum / Faculty of Mathematical Sciences

BT - Computing an element in the lexicographic kernel of a game

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -