首页 | 本学科首页   官方微博 | 高级检索  
     


A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
Authors:René van den Brink  Ilya Katsev  Gerard van der Laan
Affiliation:1.Department of Econometrics,Tinbergen Institute, VU Amsterdam,Amsterdam,The Netherlands;2.St. Petersburg Institute for Economics and Mathematics,Russian Academy of Sciences,St. Petersburg,Russia
Abstract:Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of games with a permission structure describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with a permission structure which economic applications include auction games, dual airport games, dual polluted river games and information market games.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号