<?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:36:59Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/12903" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/12903</identifier><datestamp>2025-03-26T23:36:39Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</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">Larson, Kate</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="df0fb258-c9b6-405e-a3c4-f169b1afaeb1" confidence="600">Tsang, Alan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-01-19T17:18:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-01-19T17:18:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-01-19</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/12903</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">With the ever increasing ubiquity of social networks in our everyday lives, comes an increasing urgency for us to understand their impact on human behavior.  Social networks quantify the ways in which we communicate with each other, and therefore shape the flow of information through the community.  It is this same flow of information that we utilize to make sound, strategic decisions.  This thesis focuses on one particular type of decisions: voting.  When a community engages in voting, it is soliciting the opinions of its members, who present it in the form of a ballot.  The community may then choose a course of action based on the submitted ballots.  Individual voters, however, are under no obligation to submit sincere ballots that accurately reflects their opinions; they may instead submit a strategic ballot in hopes of affecting the election&amp;apos;s outcome to their advantage.  This thesis examines the interplay between social network structure and strategic voting behavior. In particular, we will explore how social network structure affects the flow of information through a population, and thereby affect the strategic behavior of voters, and ultimately, the outcomes of elections.&#xd;
&#xd;
&#xd;
We will begin by considering how network structure affects information propagation.  This work builds upon the rich body of literature called opinion dynamics by proposing a model for skeptical agents --- agents that distrust other agents for holding  opinions that differ  too wildly from their own. We show that network structure is one of several factors that affects the degree of penetration that radical opinions can achieve through the community.  Next, we propose a model for strategic voting in social networks, where voters are self-interested and rational, but may only use the limited information available through their social network contacts to formulate strategic ballots.  In particular, we study the ``Echo Chamber Effect&amp;apos;&amp;apos;, the tendency for humans to favor connections with similar people, and show that it leads to the election of less suitable candidates.  We also extend this voter model by using boundedly-rational heuristics to scale up our simulations to larger populations.  We propose a general framework for voting agents embedded in social networks, and show that our heuristic models can demonstrate a variation of the ``Micromega Law&amp;apos;&amp;apos; which  relates the popularity of smaller parties to the size of the population. Finally, we examine another avenue for strategic behavior: choosing when to cast your vote.  We propose a type of voting mechanism called ``Sticker Voting&amp;apos;&amp;apos;, where voters cast ballots by placing stickers on their favored alternatives, thereby publicly and irrevocably declaring their support.  We present a complete analysis of several simple instances of the Sticker Voting game and discuss how our results reflect human voting behavior.</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">Computational Social Choice</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Multiagent Systems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Voting Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Social Networks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Strategic Voting and Social Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</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">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Larson, Kate</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>