Béal, Sylvain; Rémila, Eric; Solal, Philippe - Volkswirtschaftliche Fakultät, … - 2012
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...