...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Automation and Remote Control >On the k-accessibility of cores of TU-cooperative games
【24h】

On the k-accessibility of cores of TU-cooperative games

机译：关于TU合作游戏核心的K-可访问性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper proposes a strengthening of the author's core-accessibility theorem for balanced TU-cooperative games. The obtained strengthening relaxes the influence of the nontransitivity of classical domination alpha v on the quality of the sequential improvement of dominated imputations in a game v. More specifically, we establish the k-accessibility of the core C(alpha (v) ) of any balanced TU-cooperative game v for all natural numbers k: for each dominated imputation x, there exists a converging sequence of imputations x (0), x (1),..., such that x (0) = x, lim x (r) a C(alpha (v) ) and x (r-m) is dominated by any successive imputation x (r) with m a [1, k] and r aeyen m. For showing that the TU-property is essential to provide the k-accessibility of the core, we give an example of an NTU-cooperative game G with a "black hole" representing a nonempty closed subset B aS dagger G(N) of dominated imputations that contains all the alpha (G) -monotonic sequential improvement trajectories originating at any point x a B.
机译：None

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号