An optimal bound to access the core in TU-games

• 成果类型: Article
• 署名作者: Beal, Sylvain; Remila, Eric; Solal, Philippe
• 署名单位: Universite Marie et Louis Pasteur; Centre National de la Recherche Scientifique (CNRS); CNRS - Institute for Humanities & Social Sciences (INSHS); Ecole Normale Superieure de Lyon (ENS de LYON); Universite Claude Bernard Lyon 1; Universite Jean Monnet; Universite Lyon 2
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2013.02.008
• 发表日期: 2013
• 页码: 1-9
• 关键词: Accessibility; core; Optimal bound; Weak dominance; TU-games

摘要

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. (C) 2013 Elsevier Inc. All rights reserved.