A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this...

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...

Directed minimum cost spanning tree problems of a special kind are studied, namely those which show up in considering the problem of connecting units (houses) in mountains with a purifier. For such problems an easy method is described to obtain a minimum cost spanning tree. The related cost...

Local routing protocols in scale free networks have been extensively studied. In this paper we consider a wireless contextualization of this routing problem and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures....