### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

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
- IR-65849
- EWI-3483
- MSC-90D12

### Cite this

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

}

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

Research output: Book/Report › Report › Other 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 -