A value for cooperative games with coalition and probabilistic graph structures,Journal of Combinatorial Optimization

当前位置： X-MOL 学术 › J. Comb. Optim. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

A value for cooperative games with coalition and probabilistic graph structures
Journal of Combinatorial Optimization ( IF 1 ) Pub Date : 2021-09-07 , DOI: 10.1007/s10878-021-00805-2
Jilei Shi _{1,

2} , Lei Cai ₁ , Erfang Shan ₁ , Wenrong Lyu ₁

Affiliation

In this paper we generalize TU-games with coalition and graph structures to TU-games with coalition and probabilistic graph structures. We introduce the probabilistic graph-partition value and we show that the value is uniquely determined by the axioms of probabilistic graph efficiency, probabilistic balanced contributions and probabilistic collective balanced contributions and the axioms of probabilistic graph efficiency, probabilistic balanced contributions, probabilistic balanced per capita contributions and either probabilistic fairness for joining the grand coalition or probabilistic population solidarity within unions, respectively. Also, we apply this value to China’s railway network and compare it with other values.

更新日期：2021-09-07

点击分享查看原文

点击收藏

阅读更多本刊最新论文本刊介绍/投稿指南

全部期刊列表>>