Published June 1996 | Version Submitted
Working Paper Open

Stable Networks

Abstract

A network is a graph where the nodes represent agents and an arc exists between two nodes if the corresponding agents interact bilaterally. An exogeneous value function gives the value of each network, while an allocation rule describes how the value of any graph is distributed amongst the agents. We explore the possibility of constructing allocation rules which will ensure that efficient networks of agents will form when the individual agents decide to form or severe links amongst themselves.

Additional Information

We are most grateful to Matthew Jackson for several helpful discussions and suggestions. Thanks are also due to Sudipto Bhattacharya for comments on an earlier version of the paper. This version of the paper was written when the first author was visiting Caltech. Their hospitality is gratefully acknowledged. Published as Dutta, B., & Mutuswami, S. (1997). Stable networks. Journal of economic theory, 76(2), 322-344.

Attached Files

Submitted - sswp971.pdf

Files

sswp971.pdf

Files (494.8 kB)

Name Size Download all
md5:6dd8df7d366c13c50aae020c9ca7e42d
494.8 kB Preview Download

Additional details

Identifiers

Eprint ID
80489
Resolver ID
CaltechAUTHORS:20170816-132625443

Dates

Created
2017-08-17
Created from EPrint's datestamp field
Updated
2019-10-03
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Social Science Working Papers
Series Name
Social Science Working Paper
Series Volume or Issue Number
971