This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: o Process is repeated 10 more times A simple Exchange network: Maximum Power: A1 B A2 Typical series of exchanges: 1 st : a1 gets 12, B gets 12 2 nd : a2 gets 10, B gets 14 3 rd : a1 gets 7, B gets 17 4 th : A2 gets 6, B gets 18 Centrality= Power A less simple exchange network: Who has power? D1 C D2 E1 E2 Who is most Centrally located? C Who can exclude others from exchange? D1, D2. C has little or no power even though Central. If D1 exchanges with C, E1 is excluded. If D1 exchanges with E1, and D2 exchanges with E2, then C is Excluded. D1 and D2 are need never be excluded....
View Full Document
- Fall '07
- Sam Rayburn, Jeff Pfeffer, simple exchange network, Stanford School of Business