Article |
---|
Article name |
Allocation Principle for the Communication Game |
Authors |
Trukhina L.I. Graduate Student, lit-79@mail.ru |
Bibliographic description |
|
Section |
Scientific Research |
UDK |
519.83 |
DOI |
|
Article type |
|
Annotation |
Cooperative games with partial cooperation cover a wider class of real situations than
classical models of cooperative games where every subset of a set of players can form a
coalition. This paper considers the game with limited cooperation possibilities represented
by an undirected communication graph. For the game in which the graph is a tree, the
characteristic function is constructed. The paper offers the procedure of allocation reception
and proves that the received allocation coincides with Myerson vector. The obtained results
can be used in the game with any graph.
|
Key words |
Myerson vector, communication graph, restricted game, partial cooperation |
Article information |
|
References |
|
Full article | Allocation Principle for the Communication Game |