An optimal bound to access the core in TU-games

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

Games and Economic Behavior, 2013, vol. 80, issue C, 1-9

Abstract: We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−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−1.

JEL-codes: C71 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825613000304
Full text for ScienceDirect subscribers only

Related works:
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 (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:eee:gamebe:v:80:y:2013:i:c:p:1-9

DOI: 10.1016/j.geb.2013.02.008

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().