Network Formation and Economic Applications

Simple item page
dc.contributor.authorChakrabarti, Subhadipen
dc.contributor.committeecochairGilles, Robert P.en
dc.contributor.committeecochairHaller, Hans H.en
dc.contributor.committeememberLutz, Nancy A.en
dc.contributor.committeememberSarangi, Sudiptaen
dc.contributor.committeememberStegeman, Marken
dc.contributor.committeememberEckel, Catherine C.en
dc.contributor.departmentEconomicsen
dc.date.accessioned2011-08-22T19:06:47Zen
dc.date.adate2004-09-29en
dc.date.available2011-08-22T19:06:47Zen
dc.date.issued2004-09-14en
dc.date.rdate2004-09-29en
dc.date.sdate2004-09-20en
dc.description.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.en
dc.description.degreePh. D.en
dc.format.mediumETDen
dc.identifier.otheretd-09202004-142218en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-09202004-142218en
dc.identifier.urihttp://hdl.handle.net/10919/11256en
dc.publisherVirginia Techen
dc.relation.haspartdissertation24.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectComparative Advertisingen
dc.subjectNash Equilibriumen
dc.subjectStrong Pairwise Stabilityen
dc.subjectPrivate Peeringen
dc.subjectPermission Valueen
dc.titleNetwork Formation and Economic Applicationsen
dc.typeDissertationen
thesis.degree.disciplineEconomicsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
dissertation24.pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Download

Collections

Doctoral Dissertations