Staff View
Games and network formation

Descriptive

TitleInfo
Title
Games and network formation
Name (type = personal)
NamePart (type = family)
Horowitz
NamePart (type = given)
Basak
NamePart (type = date)
1984-
DisplayForm
Basak Horowitz
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Sjostrom
NamePart (type = given)
Tomas
DisplayForm
Tomas Sjostrom
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Campbell
NamePart (type = given)
Colin
DisplayForm
Colin Campbell
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
McLean
NamePart (type = given)
Richard
DisplayForm
Richard McLean
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Chatterjee
NamePart (type = given)
Kalyan
DisplayForm
Kalyan Chatterjee
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
School of Graduate Studies
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2017
DateOther (qualifier = exact); (type = degree)
2017-10
CopyrightDate (encoding = w3cdtf); (qualifier = exact)
2017
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
This dissertation consists of three studies in communication and information networks. The first chapter analyzes formation of networks when players choose how much time to invest in other players. I assume the information can be transferred using all possible paths in the network and study the model under two different link strength functions. First, under the assumption that the link strength is the arithmetic mean of agents' investment levels, which allows players to form links unilaterally to other players, every player is connected to another either directly or indirectly with no more than two links under any Nash equilibrium. Moreover, the strict Nash equilibrium structure is a star network. Second,under the assumption that the link strength function is Cobb-Douglas in which players have to have bilateral agreement to form links with each other, I show that paired networks in which players are matched in pairs, are Nash equilibria. Moreover, I consider a sequential game in which players choose and announce their investments publicly according to a random ordering. I show that an Assortative Pair Equilibrium, in which players are assortatively matched in pairs according to their information levels, is the only strongly robust Nash equilibrium. In the second chapter, I consider the model introduced in the first chapter and fully characterize the Nash equilibria and surplus-maximizing outcomes for a three-player game, in order to investigate how equilibrium structures are different from the efficient outcomes and how these structures differ under different link strength functions. At equilibrium, the agents choose to invest all their time with only one agent regardless of the link strength function. More links are formed when the agents are perfect substitutes compared to Cobb-Douglas link strength, in which bilateral agreement is required for link formation. Moreover, the results show that the agents have a tendency to connect to fewer agents with higher investment levels from an efficiency perspective. In the third chapter, I investigate a model of communication with two agents and a principal, allowing for asymmetric interdependencies between the agents. Each agent has private information on different dimensions of the state of nature. The interdependencies are characterized as action complementarities or substitutabilities between the agents within the same economic environment. I model the communication as cheap talk messages, assuming the information is not verifiable. I look at two decision mechanisms. First, under the centralized decision mechanism, in which agents communicate vertically with the principal and the principal makes the decisions for the agents after observing the reported private information, the communication takes form of a partition equilibrium. Second, under the decentralized mechanism, the agents communicate horizontally with each other via cheap talk and then make the decision for themselves. Under this protocol, I show that when there are strategic interaction between the agents, there are at most two on-the-equilibrium path conditional expectations for each agent. Thus, centralization allows more informative communication compared to decentralization. Moreover, I show that if the agents are strategic complements, it is not possible to have an informative horizontal communication.
Subject (authority = RUETD)
Topic
Economics
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_8477
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (ix, 147 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Subject (authority = ETD-LCSH)
Topic
Computer games
Subject (authority = ETD-LCSH)
Topic
Computer networks--Design and construction
Note (type = statement of responsibility)
by Basak Horowitz
RelatedItem (type = host)
TitleInfo
Title
School of Graduate Studies Electronic Theses and Dissertations
Identifier (type = local)
rucore10001600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3125WS2
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Horowitz
GivenName
Basak
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2017-10-02 00:17:56
AssociatedEntity
Name
Basak Horowitz
Role
Copyright holder
Affiliation
Rutgers University. School of Graduate Studies
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
RightsEvent
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2017-10-31
DateTime (encoding = w3cdtf); (qualifier = exact); (point = end)
2018-10-31
Type
Embargo
Detail
Access to this PDF has been restricted at the author's request. It will be publicly available after October 31st, 2018.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2018-01-25T12:01:01
CreatingApplication
Version
1.4
ApplicationName
pdfTeX-1.11a
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2017-10-02T00:15:18
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024