On Distances for Cooperative Games and Non-additive Measures with Communication Situations
被引:0
|
作者:
Torra, Vicenc
论文数: 0引用数: 0
h-index: 0
机构:
CSIC, IIIA, Campus UAB S-N, Bellaterra 08193, Catalonia, SpainCSIC, IIIA, Campus UAB S-N, Bellaterra 08193, Catalonia, Spain
Torra, Vicenc
[1
]
Narukawa, Yasuo
论文数: 0引用数: 0
h-index: 0
机构:
Toho Gakuen, Kunitachi, Tokyo 1860004, JapanCSIC, IIIA, Campus UAB S-N, Bellaterra 08193, Catalonia, Spain
Narukawa, Yasuo
[2
]
机构:
[1] CSIC, IIIA, Campus UAB S-N, Bellaterra 08193, Catalonia, Spain
[2] Toho Gakuen, Kunitachi, Tokyo 1860004, Japan
来源:
ROUGH SETS AND CURRENT TRENDS IN SOFT COMPUTING, RSCTC 2014
|
2014年
/
8536卷
关键词:
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
Non-additive (fuzzy) measures also known as cooperative games or capacities are set functions that can be used to evaluate subsets of a reference set. In order to evaluate their similarities and differences, we can consider distances between pairs of measures. Games have been extended to communication situations in which besides of the game there is a graph that establishes which sets are feasible (which coalitions are possible, which individuals can cooperate). In this paper we consider the problem of defining a distance for pairs of measures when not all sets are feasible.