Computing an element in the lexicographic kernel of a game

U. Faigle, Walter Kern, J. Kuipers

Research output: Book/ReportReportOther research output

32 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 languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2002

Publication series

NameMemorandum / Faculty of Mathematical Sciences
PublisherDepartment of Applied Mathematics, University of Twente
No.1663
ISSN (Print)0169-2690

Keywords

  • MSC-90C27
  • IR-65849
  • EWI-3483
  • MSC-90D12

Cite this

Faigle, U., Kern, W., & Kuipers, J. (2002). Computing an element in the lexicographic kernel of a game. (Memorandum / Faculty of Mathematical Sciences; No. 1663). Enschede: University of Twente, Department of Applied Mathematics.
Faigle, U. ; Kern, Walter ; Kuipers, J. / Computing an element in the lexicographic kernel of a game. Enschede : University of Twente, Department of Applied Mathematics, 2002. (Memorandum / Faculty of Mathematical Sciences; 1663).
@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",

}

Faigle, U, Kern, W & Kuipers, J 2002, Computing an element in the lexicographic kernel of a game. Memorandum / Faculty of Mathematical Sciences, no. 1663, University of Twente, Department of Applied Mathematics, Enschede.

Computing an element in the lexicographic kernel of a game. / Faigle, U.; Kern, Walter; Kuipers, J.

Enschede : University of Twente, Department of Applied Mathematics, 2002. (Memorandum / Faculty of Mathematical Sciences; No. 1663).

Research output: Book/ReportReportOther research output

TY - BOOK

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

AU - Faigle, U.

AU - Kern, Walter

AU - Kuipers, J.

N1 - Imported from MEMORANDA

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 - IR-65849

KW - EWI-3483

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 -

Faigle U, Kern W, Kuipers J. Computing an element in the lexicographic kernel of a game. Enschede: University of Twente, Department of Applied Mathematics, 2002. (Memorandum / Faculty of Mathematical Sciences; 1663).