<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-22T20:05:25Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/297867" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/297867</identifier><datestamp>2025-12-19T19:27:21Z</datestamp><setSpec>com_1810_276</setSpec><setSpec>com_1810_256063</setSpec><setSpec>col_1810_218415</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
   <dc:title>Networks, Clubs and Matching</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">10.17863/CAM.44924</dc:identifier>
   <dc:creator>Ding, Sihua</dc:creator>
   <uketdterms:advisor>Goyal, Sanjeev</uketdterms:advisor>
   <dcterms:abstract>This PhD dissertation is a study of how social networks and clubs form in different
contexts.

Chapter 1 investigates the incentives of individuals to make introductions (the act of
creating a link for two neighbours) in a social network. The chapter assumes that players
are endowed with different ability levels and have a network among them. Given an ability
endowment and a network, players undergo a matching process where one can only be
matched with one of his neighbours or stay alone, and one always prefers a more capable
matching partner to a less capable one to staying alone. A strict ability ranking would yield
a unique stable matching for all network structures. Our research question is: If a player
can create a link for a pair of his neighbours, when would he want to do so? Two results
are derived to address this question. First, the matching of a player would be unchanged
if he makes an introduction for two neighbours, at least one of whom is less capable than
him. Second, an introduction could benefit the introducer when both neighbours involved
are more capable than him, and there exists an even-length alternating path from one of the
neighbours to him. The chapter also examines the stability of networks based on no profitable
introductions and characterizes Pareto efficient networks.

Chapter 2 studies a general model of investment in relationships. Existing research on
network formation proceeds under strong assumptions on how a link between two agents
can be produced: typically link investments are assumed to be unweighted and links are
formed either reciprocally or unilaterally. This chapter proposes a more general approach
by allowing weighted link investment and employing a constant elasticity of substitution
(CES) link formation function. This formulation has two advantages other than permitting a
more flexible sponsorship of links. First, it nests the two commonly employed bilateral and
unilateral link formation assumptions as special cases and thus enables robustness checks on
existing works. Second, it introduces a variation in link investment substitutability and hence
enables the analysis of how different link formation technologies affect network formation.
We illustrate this approach through two applications: a game of pure network formation and
a game of network formation with assorted activities.

Chapter 3, which is co-authored with Prof Sanjeev Goyal and Dr Marcin Dziubinski,
explores club joining activities of individuals and member admission activities of clubs.
We assume that links between clubs are formed when they share common members. The
productivity of a club is determined by its number of members and how connected it is to
other clubs. Individuals wish to join clubs with high productivity and clubs admit members
with the aim to raise productivity. We study the efficient and the stable club membership
structures and find that both efficiency and stability implies the segregation of individuals
(and clubs) into two groups with very different levels of club joining (and member admission)
activeness and welfare. Our results provide a simple explanation for the phenomena of the
“power elite” and interlocking board of directors.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2019-10-26</dcterms:issued>
   <dc:type>Thesis</dc:type>
   <uketdterms:qualificationlevel>Doctoral</uketdterms:qualificationlevel>
   <uketdterms:qualificationname>Doctor of Philosophy (PhD)</uketdterms:qualificationname>
   <dc:language>en</dc:language>
   <uketdterms:sponsor>My PhD study is kindly sponsored by the Cambridge Trust. Faculty of Economics also provides me with funds to carry out research in this dissertation.</uketdterms:sponsor>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/297867</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/bitstreams/b28d43c0-505e-496c-8a11-195ce97f2b09/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">5b028e7e83a206279cffd1169b3c07d0</uketdterms:checksum>
   <dcterms:license>https://www.repository.cam.ac.uk/bitstreams/ab83535c-3424-4088-aa56-f3ed982ab91a/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:rights>https://www.rioxx.net/licenses/all-rights-reserved/</dc:rights>
   <dc:subject>Networks</dc:subject>
   <dc:subject>Clubs</dc:subject>
   <dc:subject>Matching</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>