This paper focuses on sharing the costs and revenues of maintaining a public network communication structure. Revenues are assumed to be bilateral and communication links are publicly available but costly. It is assumed that agents are located at the vertices of an undirected graph in which the edges represent all possible communication links. We take the approach from cooperative game theory and focus on the corresponding network game in coalitional form which relates any coalition of agents to its highest possible net benefit, i.e., the net benefitt corresponding to an optimal operative network. Although finding an optimal network in general is a difficult problem, it is shown that corresponding network games are (totally) balanced. In the proof of this result a specific relaxation, duality and techniques of linear production games with committee control play a role. Sufficient conditions for convexity of network games are derived. Possible extensions of the model and its results are discussed.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
44.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)