本文選題：TU博弈 + 無圈圖博弈　； 參考：《運籌與管理》2017年10期

【摘要】：本文對無圈圖博弈進行了研究,考慮了大聯(lián)盟收益不小于各分支收益之和的情況。通過引入剩余公平分配性質,也就是任意兩個分支聯(lián)盟的平均支付變化相等,給出了一個基于平均樹值的無圈圖博弈有效解。同時,結合有效性和分支公平性對該有效解進行了刻畫。特別地,若無圈圖博弈滿足超可加性時,證明了該有效解一定是核中的元素,說明此時的解是穩(wěn)定的。最后,通過一案例分析了該有效解的特點,即越大的分支分得的剩余越多,并且關鍵參與者,也就是具有較大度的參與者可獲得相對多的支付。
[Abstract]:In this paper, we study the acyclic graph game and consider the situation that the income of the big league is not less than the sum of the income of each branch. By introducing the property of residual fair distribution, that is, the average payment variation of any two branch alliances is equal, an efficient solution of acyclic graph game based on average tree value is given. At the same time, the efficient solution is characterized by the combination of efficiency and bifurcation fairness. In particular, if the acyclic graph game satisfies superadditivity, it is proved that the efficient solution must be an element in the kernel, which shows that the solution is stable. Finally, the characteristics of the efficient solution are analyzed by a case, that is, the larger the branch is, the more the surplus is, and the key participant, that is, the participant with a large degree, can get a relatively large payment.
【作者單位】： 上海大學管理學院;
【基金】：國家自然科學基金資助項目(11571222)
【分類號】：F224.32

【相似文獻】

相關期刊論文 前2條

1 Frank Harary;Bennet Manvel;;擬無圈圖[J];數(shù)學季刊;1987年03期

2 邵燕靈;高玉斌;;n階無圈圖的指數(shù)集[J];西安電子科技大學學報;1996年S1期

，

本文編號：1781327