<?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-22T13:44:44Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4539" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4539</identifier><datestamp>2017-03-21T17:20:23Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9914</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="8f431d88-1054-42c7-857d-5c72cd2ef667" confidence="600">Xu, Haiyan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-08-07T19:49:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-08-07T19:49:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-08-07T19:49:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4539</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The graph model for conflict resolution (GMCR) provides a convenient&#xd;
and effective means to model and analyze a strategic conflict.&#xd;
Standard practice is to carry out a stability analysis of a graph&#xd;
model, and then to follow up with a post-stability analysis, two&#xd;
critical components of which are status quo analysis and coalition&#xd;
analysis. In stability analysis, an equilibrium is a state that is&#xd;
stable for all decision makers (DMs) under appropriate stability&#xd;
definitions or solution concepts. Status quo analysis aims to&#xd;
determine whether a particular equilibrium is reachable from a&#xd;
status quo (or an initial state) and, if so, how to reach it. A&#xd;
coalition is any subset of a set of DMs. The coalition stability&#xd;
analysis within the graph model is focused on the status quo states&#xd;
that are equilibria and assesses whether states that are stable from&#xd;
individual viewpoints may be unstable for coalitions. Stability&#xd;
analysis began within a simple preference structure which includes a&#xd;
relative preference relationship and an indifference relation.&#xd;
Subsequently, preference uncertainty and strength of preference were&#xd;
introduced into GMCR but not formally integrated.&#xd;
&#xd;
In this thesis, two new preference frameworks, hybrid preference and&#xd;
multiple-level preference, and an integrated algebraic approach are&#xd;
developed for GMCR. Hybrid preference extends existing preference&#xd;
structures to combine preference uncertainty and strength of&#xd;
preference into GMCR. A multiple-level preference framework expands&#xd;
GMCR to handle a more general and flexible structure than any&#xd;
existing system representing strength of preference. An integrated&#xd;
algebraic approach reveals a link among traditional stability&#xd;
analysis, status quo analysis, and coalition stability analysis by&#xd;
using matrix representation of the graph model for conflict&#xd;
resolution.&#xd;
&#xd;
To integrate the three existing preference structures into a hybrid&#xd;
system, a new preference framework is proposed for graph models&#xd;
using a quadruple relation to express strong or mild preference of&#xd;
one state or scenario over another, equal preference, and an&#xd;
uncertain preference. In addition, a multiple-level preference&#xd;
framework is introduced into the graph model methodology to handle&#xd;
multiple-level preference information, which lies between relative&#xd;
and cardinal preferences in information content. The existing&#xd;
structure with strength of preference takes into account that if a&#xd;
state is stable, it may be either strongly stable or weakly stable&#xd;
in the context of three levels of strength. However, the three-level&#xd;
structure is limited in its ability to depict the intensity of&#xd;
relative preference. In this research, four basic solution concepts&#xd;
consisting of Nash stability, general metarationality, symmetric&#xd;
metarationality, and sequential stability, are defined at each level&#xd;
of preference for the graph model with the extended multiple-level&#xd;
preference. The development of the two new preference frameworks&#xd;
expands the realm of applicability of the graph model and provides&#xd;
new insights into strategic conflicts so that more practical and&#xd;
complicated problems can be analyzed at greater depth.&#xd;
&#xd;
Because a graph model of a conflict consists of several interrelated&#xd;
graphs, it is natural to ask whether well-known results of Algebraic&#xd;
Graph Theory can help analyze a graph model. Analysis of a graph&#xd;
model involves searching paths in a graph but an important&#xd;
restriction of a graph model is that no DM can move twice in&#xd;
succession along any path. (If a DM can move consecutively, then&#xd;
this DM&amp;apos;s graph is effectively transitive. Prohibiting consecutive&#xd;
moves thus allows for graph models with intransitive graphs, which&#xd;
are sometimes useful in practice.) Therefore, a graph model must be&#xd;
treated as an edge-weighted, colored multidigraph in which each arc&#xd;
represents a legal unilateral move and distinct colors refer to&#xd;
different DMs. The weight of an arc could represent some preference&#xd;
attribute. Tracing the evolution of a conflict in status quo&#xd;
analysis is converted to searching all colored paths from a status&#xd;
quo to a particular outcome in an edge-weighted, colored&#xd;
multidigraph. Generally, an adjacency matrix can determine a simple&#xd;
digraph and all state-by-state paths between any two vertices.&#xd;
However, if a graph model contains multiple arcs between the same&#xd;
two states controlled by different DMs, the adjacency matrix would&#xd;
be unable to track all aspects of conflict evolution from the status&#xd;
quo. To bridge the gap, a conversion function using the matrix&#xd;
representation is designed to transform the original problem of&#xd;
searching edge-weighted, colored paths in a colored multidigraph to&#xd;
a standard problem of finding paths in a simple digraph with no&#xd;
color constraints. As well, several unexpected and useful links&#xd;
among status quo analysis, stability analysis, and coalition&#xd;
analysis are revealed using the conversion function.&#xd;
&#xd;
The key input of stability analysis is the reachable list of a DM,&#xd;
or a coalition, by a legal move (in one step) or by a legal sequence&#xd;
of unilateral moves, from a status quo in 2-DM or $n$-DM ($n&#xd;
&amp;gt; 2$) models. A weighted reachability matrix for a DM or a coalition along&#xd;
weighted colored paths is designed to construct the reachable list&#xd;
using the aforementioned conversion function. The weight of each&#xd;
edge in a graph model is defined according to the preference&#xd;
structure, for example, simple preference, preference with&#xd;
uncertainty, or preference with strength. Furthermore, a graph model&#xd;
and the four basic graph model solution concepts are formulated&#xd;
explicitly using the weighted reachability matrix for the three&#xd;
preference structures. The explicit matrix representation for&#xd;
conflict resolution (MRCR) that facilitates stability calculations&#xd;
in both 2-DM and $n$-DM ($n&#xd;
&amp;gt; 2$) models for three existing preference structures. In addition,&#xd;
the weighted reachability matrix by a coalition is used to produce&#xd;
matrix representation of coalition stabilities in&#xd;
multiple-decision-maker conflicts for the three preference&#xd;
frameworks.&#xd;
&#xd;
Previously, solution concepts in the graph model were traditionally&#xd;
defined logically, in terms of the underlying graphs and preference&#xd;
relations. When status quo analysis algorithms were developed, this&#xd;
line of thinking was retained and pseudo-codes were developed&#xd;
following a similar logical structure. However, as was noted in the&#xd;
development of the decision support system (DSS) GMCR II, the nature&#xd;
of logical representations makes coding difficult. The DSS GMCR II,&#xd;
is available for basic stability analysis and status quo analysis&#xd;
within simple preference, but is difficult to modify or adapt to&#xd;
other preference structures. Compared with existing graphical or&#xd;
logical representation, matrix representation for conflict&#xd;
resolution (MRCR) is more effective and convenient for computer&#xd;
implementation and for adapting to new analysis techniques.&#xd;
Moreover, due to an inherent link between stability analysis and&#xd;
post-stability analysis presented, the proposed algebraic approach&#xd;
establishes an integrated paradigm of matrix representation for the&#xd;
graph model for conflict resolution.</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">conflict analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">matrix representation</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">System Design Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Matrix Representations and Extension of the Graph Model for Conflict Resolution</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral 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">Systems Design Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</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>