<?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-11-22T14:23:02Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3317" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3317</identifier><datestamp>2019-04-03T02:57:46Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="87e7b570-4278-4eff-bd94-e9d7af5dee50" confidence="600">Wheatley, David</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-09-26T16:49:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-09-26T16:49:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-09-26T16:49:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3317</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis we consider some network design games that arise from common&#xd;
network design problems. A network design game involves multiple players who&#xd;
control nodes in a network, each of which has a personal interest in seeing their&#xd;
nodes connected in some manner. To this end, the players will submit bids to&#xd;
a mechanism whose task will be to select which of the players to connect, how&#xd;
to connect their nodes, and how much to charge each player for the connection.&#xd;
We rely on many fundamental results from mechanism design (from [8], [9] &amp;amp;&#xd;
[5]) in this thesis and focus our efforts on designing and analyzing cost-sharing&#xd;
methods. That is, for a given set of players and their connection requirements,&#xd;
our algorithms compute a solution that satisfies all the players’ requirements&#xd;
and calculates ’fair’ prices to charge each of them for the connection.&#xd;
Our cost-sharing methods use a primal-dual framework developed by Agrawal,&#xd;
Klein and Ravi in [1] and generalized by Goemans &amp;amp;Williamson in [3]. We modify&#xd;
the algorithms by using the concept of death-time introduced by K¨onemann,&#xd;
Leonardi &amp;amp; Sch¨afer in [6].&#xd;
Our main result is a 2-budget balanced and cross-monotonic cost sharing&#xd;
method for the downwards monotone set cover game, which arises naturally&#xd;
from any downwards monotone 0, 1-function. We have also designed a 2-budget&#xd;
balanced and cross-monotonic cost sharing method for two versions of the edge&#xd;
cover game arising from the edge cover problem. These games are special cases&#xd;
of the downwards monotone set cover game. By a result by Immorlica, Mahdian&#xd;
&amp;amp; Mirrokni in [4] our result is best possible for the edge cover game.&#xd;
We also designed a cross-monotonic cost sharing method for a network design&#xd;
game we call the Even Parity Connection game arising from the T-Join&#xd;
problem that generalizes proper cut requirement functions. We can show our&#xd;
algorithm returns cost shares that recover at least half the cost of the solution.&#xd;
We conjecture that our cost sharing method for the even parity connection game&#xd;
is competitive and thus 2-budget balance.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Game Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Network Design</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Cost-Sharing Methods</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Cross-monotonic Cost-Sharing Methods for Network Design Games</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>