Maximizing selections from the core of a cooperative game

TY - JOUR

T1 - Maximizing selections from the core of a cooperative game

AU - Keiding, Hans

PY - 2011/5

Y1 - 2011/5

N2 - A core selection is a function which for each cooperative game with non-empty core selects a subset, possibly a single element, of the core. In this paper, we study selections which maximize some function or binary relation on the core. We present an axiomatic characterization of such core selections, as well as a local characterization using duality which can be applied to investigate properties of core selections. We give an application of the local characterization to a question of coalitional monotonicity of core selections.

AB - A core selection is a function which for each cooperative game with non-empty core selects a subset, possibly a single element, of the core. In this paper, we study selections which maximize some function or binary relation on the core. We present an axiomatic characterization of such core selections, as well as a local characterization using duality which can be applied to investigate properties of core selections. We give an application of the local characterization to a question of coalitional monotonicity of core selections.

U2 - 10.1007/s10898-011-9668-3

DO - 10.1007/s10898-011-9668-3

M3 - Journal article

SN - 0925-5001

VL - 50

SP - 107

EP - 118

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 1

ER -