Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Discrete Mathematics and Applications

Editor-in-Chief: Zubkov, Andrei

6 Issues per year


CiteScore 2016: 0.16

SCImago Journal Rank (SJR) 2016: 0.231
Source Normalized Impact per Paper (SNIP) 2016: 0.552

Online
ISSN
1569-3929
See all formats and pricing
More options …
Volume 24, Issue 5

Issues

Generating functions and the Myerson vector in communication networks

Vladimir V. Mazalov / Lyudmila I. Trukhina
Published Online: 2014-11-14 | DOI: https://doi.org/10.1515/dma-2014-0026

Abstract

Cooperative games on undirected graphs are considered. The characteristic function is defined in a specialway with due account of the number of links and distances between vertices (players).Animputation procedure is put forward for a tree graph, the resulting imputation is shown to agree with theMyerson vector. For its calculation the use of the generating function is proposed. It is shown that the results obtained may be extended to games with arbitrary graphs.

Keywords : cooperative games; imputation distribution; the Myerson vector

About the article

Published Online: 2014-11-14

Published in Print: 2014-10-01


Citation Information: Discrete Mathematics and Applications, Volume 24, Issue 5, Pages 295–303, ISSN (Online) 1569-3929, ISSN (Print) 0924-9265, DOI: https://doi.org/10.1515/dma-2014-0026.

Export Citation

© 2014 by Walter de Gruyter Berlin/Boston.Get Permission

Comments (0)

Please log in or register to comment.
Log in