Type of Document Dissertation Author Chakrabarti, Subhadip Author's Email Address firstname.lastname@example.org URN etd-09202004-142218 Title Network Formation and Economic Applications Degree PhD Department Economics Advisory Committee
Advisor Name Title Gilles, Robert P. Committee Co-Chair Haller, Hans H. Committee Co-Chair Eckel, Catherine C. Committee Member Lutz, Nancy A. Committee Member Sarangi, Sudipta Committee Member Stegeman, Mark Committee Member Keywords
- Comparative Advertising
- Nash Equilibrium
- Strong Pairwise Stability
- Private Peering
- Permission Value
Date of Defense 2004-09-10 Availability unrestricted AbstractNetworks, generically, refer to any application of graph theory in economics. Consider an undirected graph where nodes represent players and links represent relationships between them. Players can both form and delete links by which we mean that they can both form new relationships and terminate existing ones. A stable network is one in which no incentives exist to change the network structure. There can be various forms of stability depending on how many links players are allowed to form or delete at a time. Under strong pairwise stability, each player is allowed to delete any number of links at a time while any pair of players can form one link at a time.
We introduce a network-value function, which assigns to each possible network a certain value. The value is allocated according to the component-wise egalitarian allocation rule, which divides the value generated by a component equally among members of the component (where a component refers to a maximally connected subgraph). An efficient network is one that maximizes the network value function. We show that there is an underlying conflict between strong pairwise stability and efficiency. Efficient networks are not necessarily strongly pairwise stable. This conflict can be resolved only if value functions satisfy a certain property called "middlemen-security". We further find that there is a broad class of networks called "middlemen-free networks" for which the above condition is automatically satisfied under all possible value functions.
We also look at three network applications. A peering contract is an arrangement between Internet Service Providers under which they exchange traffic with one another free of cost. We analyze incentives for peering contracts among Internet service providers using the notion of pairwise stability.
A hierarchy is a directed graph with an explicit top-down structure where each pair of linked agents have a superior-subordinate relationship with each other. We apply the notion of conjunctive permission value to demonstrate the formation of hierarchical firms in a competitive labor market.
Comparative or targeted advertising is defined as any form of advertising where a firm directly or indirectly names a competitor. We also examine a model of targeted advertising between oligopolistic firms using non-cooperative game theoretic tools.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access dissertation24.pdf 1.63 Mb 00:07:33 00:03:53 00:03:24 00:01:42 00:00:08
If you have questions or technical problems, please Contact DLA.