On the number of blocks required to access the core
Sylvain Béal (),
Eric Rémila and
MPRA Paper from University Library of Munich, Germany
For any transferable utility game in coalitional form with 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 less than or equal to n(n-1)/2, where n is the cardinality of the player set. This number considerably improves the upper bounds found so far by Koczy (2006) and Yang (2010). Our result relies on an altered version of the procedure proposed by Sengupta and Sengupta (1996). 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)
JEL-codes: C71 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cdm and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
https://mpra.ub.uni-muenchen.de/26578/1/MPRA_paper_26578.pdf original version (application/pdf)
Working Paper: On the number of blocks required to access the core (2012)
Working Paper: On the Number of Blocks Required to Access the Core (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:26578
Access Statistics for this paper
More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().