Showing a limited preview of this publication:
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.
Published Online: 2014-11-14
Published in Print: 2014-10-1
© 2014 by Walter de Gruyter Berlin/Boston