Corvinus
Corvinus

The kernel is in the least core for permutation games

Solymosi, Tamás (2013) The kernel is in the least core for permutation games. Working Paper. Corvinus University of Budapest , Budapest.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
308kB

Abstract

Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter is a lower dimensional subset of the core. By means of a 5-player permutation game we demonstrate that, in sense of the lexicographic center procedure leading to the nucleolus, this inclusion result can not be strengthened. Our 5-player permutation game is also an example (of minimum size) for a game with a non-convex kernel.

Item Type:Monograph (Working Paper)
Uncontrolled Keywords:permutation game, least core, kernel, JEL code: C71
Subjects:Mathematics, Econometrics
Projects:OTKA K-101224
ID Code:1407
Deposited By: Ádám Hoffmann
Deposited On:13 Jan 2014 12:43
Last Modified:13 Jan 2014 12:43

Repository Staff Only: item control page