An optimal bound to access the core in TU-games

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

Post-Print from HAL

Abstract: We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1n−1.

Keywords: Accessibility; Core; Optimal bound; Weak dominance; TU-games (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Published in Games and Economic Behavior, 2013, 80, pp.1-9. ⟨10.1016/j.geb.2013.02.008⟩

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

Related works:
Journal Article: An optimal bound to access the core in TU-games (2013)
Working Paper: An optimal bound to access the core in TU-games (2013)
Working Paper: An optimal bound to access the core in TU-games (2013)
Working Paper: An Optimal Bound to Access the Core in TU-Games (2012)
Working Paper: An optimal bound to access the core in TU-games (2012)
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-00795480

DOI: 10.1016/j.geb.2013.02.008

Access Statistics for this paper

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