On the number of blocks required to access the core

Sylvain Béal, Eric Rémila and Philippe Solal

Post-Print from HAL

Abstract: For any transferable utility game in coalitional form with nonempty core, we show that the number of blocks required to switch from an imputation out of the core to a core imputation is less than or equal to n(n−1)/2, where n is the number of players. This number considerably improves the bounds found by Kóczy (2006) [5] and Yang (2010) [11]. Our result relies on an altered version of the procedure proposed by Sengupta and Sengupta (1996) [9]. The use of the Davis-Maschler reduced-games is also pointed out.

Keywords: Core; Excess function; Dominance path; Davis-Maschler reduced-game (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Published in Discrete Applied Mathematics, 2012, 160 (7-8), pp.925-932. ⟨10.1016/j.dam.2011.12.022⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Working Paper: On the Number of Blocks Required to Access the Core (2011)
Working Paper: On the number of blocks required to access the core (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-00662489

DOI: 10.1016/j.dam.2011.12.022

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().