<?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-22T22:59:34Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/12246" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/12246</identifier><datestamp>2025-03-26T23:34:12Z</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="advisor">Sanità, Laura</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="b72db3c1-8ec7-4979-982f-a6b744ba373b" confidence="600">Koh, Zhuan Khye</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-08-29T14:05:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-08-29T14:05:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-08-29</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2017-08-25</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/12246</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight&#xd;
matching equals the value of a maximum-weight fractional matching. Stable graphs play&#xd;
an important role in some interesting game theory problems, such as network bargaining&#xd;
games and cooperative matching games, because they characterize instances which admit&#xd;
stable outcomes. Motivated by this, in the last few years many researchers have investigated&#xd;
the algorithmic problem of turning a given graph into a stable one, via edge- and vertex removal&#xd;
operations. However, all the algorithmic results developed in the literature so far&#xd;
only hold for unweighted instances, i.e., assuming unit weights on the edges of G.&#xd;
&#xd;
We give the first polynomial-time algorithm to find a minimum cardinality subset of&#xd;
vertices whose removal from G yields a stable graph, for any weighted graph G. The algorithm&#xd;
is combinatorial and exploits new structural properties of basic fractional matchings,&#xd;
which may be of independent interest. In contrast, we show that the problem of finding a&#xd;
minimum cardinality subset of edges whose removal from a weighted graph G yields a stable&#xd;
graph, does not admit any constant-factor approximation algorithm, unless P = NP.&#xd;
In this setting, we develop an O(\Delta )-approximation algorithm for the problem, where \Delta  is&#xd;
the maximum degree of a node in G.</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">Matching</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Game Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Network Bargaining</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Approximation Algorithm</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Stabilizing Weighted Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">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" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Sanità, Laura</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>