Strongly stable networks

dc.contributor.authorJackson, Matthew O.
dc.contributor.authorNouweland, Anne van den
dc.date.accessioned2003-08-12T20:26:36Z
dc.date.available2003-08-12T20:26:36Z
dc.date.issued2001-06-01
dc.description.abstractWe analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coincide with the set of efficient networks (those maximizing the total productive value). We show that the existence of strongly stable networks is equivalent to core existence in a derived cooperative game and use that result to characterize the class of value functions for which there exist strongly stable networks via a "top convexity" condition on the value function on networks. We also consider a variation on strong stability where players can make side payments, and examine situations where value functions may be non-anonymous depending on player labels.en
dc.format.extent0 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/1794/70
dc.language.isoen_US
dc.publisherUniversity of Oregon, Dept. of Economicsen
dc.relation.ispartofseriesUniversity of Oregon Economics Department Working Papers;2001-3
dc.subjectNetwork analysisen
dc.titleStrongly stable networksen
dc.typeWorking Paperen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2001-3 .pdf
Size:
312.79 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
Name:
license.txt
Size:
2.23 KB
Format:
Item-specific license agreed upon to submission
Description: