Adaptive allocation rules for hypergraph games |
| |
| Institution: | Business School, University of Shanghai for Science and Technology, 200093, Shanghai, PR China |
| |
| Abstract: | 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. |
| |
| Keywords: | Cooperative game Hypergraph structure Myerson value Position value Degree value |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
