Munich Personal RePEc Archive

An optimal bound to access the core in TU-games

Béal, Sylvain and Rémila, Eric and Solal, Philippe (2012): An optimal bound to access the core in TU-games.

[img]
Preview
PDF
MPRA_paper_38972.pdf

Download (317kB) | Preview

Abstract

For any transferable utility game in coalitional form with a nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is at most n-1, where n is the number of players. This bound exploits the geometry of the core and is optimal. It considerably improves the upper bounds found so far by Koczy (2006), Yang (2010, 2011) and a previous result by ourselves (2012) in which the bound was n(n-1)/2.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.