On the accessibility of core-extensions

• 成果类型: Article
• 署名作者: Yang, Yi-You
• 署名单位: Aletheia University
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2011.08.007
• 发表日期: 2012
• 页码: 687-698
• 关键词: Accessibility; core; Core-extensions

摘要

Sengupta and Sengupta (1996) study the accessibility of the core of a TU game and show that the core, if non-empty, can be reached from any non-core allocation via a finite sequence of successive blocks. This paper complements the result by showing that when the core is empty, a number of non-empty core-extensions, including the least core and the weak least core (Maschler et al., 1979), the positive core (Orshan and Sudholter, 2001) and the extended core (Bejan and Gomez, 2009), are accessible in a strong sense, namely each allocation in each of the foregoing core-extensions can be reached from any allocation through a finite sequence of successive blocks. (C) 2011 Elsevier Inc. All rights reserved.