Geodesic
A new allocation rule for cooperative games with hypergraph communication structure
Contributions to game theory and management, Tome 12 (2019), pp. 204-219 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A new allocation rule was proposed by splitting the original game into a game between hyperlinks and games within them. A special case of cooperative game on flower type hypergraphs is investigated. The proposed allocation rule has been generalized for games with a communication structure represented by acyclic reduced hypergraphs and was illustrated by examples.
Keywords: cooperation, characteristic function, hypergraph, allocation rule.
Mots-clés : communication structure 
@article{CGTM_2019_12_a11,
     author = {David A. Kosian and Leon A. Petrosyan},
     title = {A new allocation rule for cooperative games with hypergraph communication structure},
     journal = {Contributions to game theory and management},
     pages = {204--219},
     year = {2019},
     volume = {12},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2019_12_a11/}
}
TY  - JOUR
AU  - David A. Kosian
AU  - Leon A. Petrosyan
TI  - A new allocation rule for cooperative games with hypergraph communication structure
JO  - Contributions to game theory and management
PY  - 2019
SP  - 204
EP  - 219
VL  - 12
UR  - http://geodesic.mathdoc.fr/item/CGTM_2019_12_a11/
LA  - en
ID  - CGTM_2019_12_a11
ER  - 
%0 Journal Article
%A David A. Kosian
%A Leon A. Petrosyan
%T A new allocation rule for cooperative games with hypergraph communication structure
%J Contributions to game theory and management
%D 2019
%P 204-219
%V 12
%U http://geodesic.mathdoc.fr/item/CGTM_2019_12_a11/
%G en
%F CGTM_2019_12_a11
David A. Kosian; Leon A. Petrosyan. A new allocation rule for cooperative games with hypergraph communication structure. Contributions to game theory and management, Tome 12 (2019), pp. 204-219. http://geodesic.mathdoc.fr/item/CGTM_2019_12_a11/

[1] Myerson R. B., “Graphs and cooperation in games”, Math. Oper. Res., 2 (1977), 225–229 | DOI | MR | Zbl

[2] Shapley L. S., “A value for n-person games”, Annals of Math. Studies, 28 (1953), 307–317 | MR | Zbl

[3] Owen G., “Values of graph-restricted games”, SIAM J. Alg. Disc. Meth., 7 (1986), 210–220 | DOI | MR | Zbl

[4] Meessen R., Communication games, Master's thesis, Department of Mathematics, University of Nijmegen, the Netherlands, 1988 (in Dutch)

[5] van den Nouweland A., Borm P., Tijs S., “Allocation rules for hypergraph communication situations”, Int. J. Game Theory, 20 (1992), 255–268 | DOI | MR | Zbl

[6] Shan E., Zhang G., Shan X., “The degree value for games with communication structure”, Int. J. Game Theory, 47 (2018), 857–871 | DOI | MR | Zbl

[7] Von Neumann J., Morgenstern O., Theory of Games and Economic Behavior, Princeton University Press, Princeton, 1994 | MR

[8] Berge C., “Hypergraphs”, Mathematical library, North-Holland, 1989, 1–3 ; 155–162 | MR