Adaptive allocation rules for hypergraph games

被引：3

作者：

Zhang, Guang ^{[1
]}

机构：

[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai 200093, Peoples R China

来源：

OPERATIONS RESEARCH LETTERS | 2021年 / 49卷 / 06期

关键词：

Cooperative game; Hypergraph structure; Myerson value; Position value; Degree value;

D O I：

10.1016/j.orl.2021.11.004

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Cooperative games with hypergraph structure, or hypergraph games, assume that all players in a hyperlink or conference have to be present before communication. Contrary to this situation, assuming that whenever players leave a conference the remaining players can still communicate with each other, adaptive allocation rules for hypergraph games, being alternative extensions of the Myerson value and the position value respectively, are introduced in this paper. Axiomatic characterizations are also provided by considering players' absence. (C) 2021 Elsevier B.V. All rights reserved.

引用

页码：890 / 895

页数：6

共 15 条

[11] Shapley Lloyd S., 1952, Contributions to the Theory of Games
[12] A characterization of the position value
Slikker, M
[J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2005, 33 (04) : 505 - 514
[13] ALLOCATION RULES FOR HYPERGRAPH COMMUNICATION SITUATIONS
VANDENNOUWELAND, A
BORM, P
TIJS, S
[J]. INTERNATIONAL JOURNAL OF GAME THEORY, 1992, 20 (03) : 255 - 268
[14] The Efficient Proportional Myerson Values for Hypergraph Games
Wang, Guangming
Cai, Lei
Shan, Erfang
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
[15] Zhang G., 2019, COMMUNICATIONS COMPU, P27

← 1 2 →