Published October 1997
| Published
Journal Article
Open
Stable Networks
- Creators
- Dutta, Bhaskar
- Mutuswami, Suresh
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 is distributed amongst the agents. M. Jackson and A. Wolinsky (1996,J. Econ. Theory71, 44–74) have recently demonstrated a potential conflict between stability and efficiency in this framework. In this paper, we use an implementation approach to see whether the tension between stability and efficiency can be resolved.
Additional Information
© 1997 Academic Press. Received 13 November 1995, Revised 24 February 1997. We are most grateful to Matt Jackson for several helpful discussions and suggestions. Thanks are also due to Sudipto Bhattacharyya, an anonymous referee, and an Associate Editor for comments on earlier versions of the paper. An earlier version of the paper was written when the first author was visiting Caltech. Their hospitality is gratefully acknowledged.Attached Files
Published - sswp971_-_published.pdf
Files
sswp971_-_published.pdf
Files
(735.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e05ff36c0641832e151ae7e50ce8672d
|
735.2 kB | Preview Download |
Additional details
- Eprint ID
- 80958
- DOI
- 10.1006/jeth.1997.2306
- Resolver ID
- CaltechAUTHORS:20170830-111246270
- Created
-
2017-08-30Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field