<?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-22T15:48:54Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/19622" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/19622</identifier><datestamp>2025-03-26T23:35:46Z</datestamp><setSpec>com_10012_9865</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9892</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">Anderson, Britt</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="242d16d6-9863-47e0-92ab-e0d28cba73ee" confidence="600">DiBerardino, Peter</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-07-20T14:58:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-07-20T14:58:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-07-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-07-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/19622</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We present a conceptual inversion of probability matching called ``probability antimatching.&amp;apos;&amp;apos; Where probability matching describes a decision strategy of stimulus pursuit, probability antimatching describes an analogous decision strategy of stimulus avoidance. We present three behavioural studies where participants played a computer game of hide-and-seek. Participants played hide-and-seek against a simulated computer opponent that selected rooms for hiding/seeking according to a given probability distribution. Seeking trials replicate traditional probability matching. Hiding trials demonstrate probability antimatching. In Study 1, we formally present our methodology of expressing participant seeking and hiding behaviour as a linear combination of Euclidean vectors. Participant seeking strategies, $\vec{s}$, are well-represented by a linear combination of the optimal maximizing strategy, $\vec{x}$, and the probability matching strategy, $\vec{m}$. Participant hiding strategies, $\vec{h}$, are equally well-represented by a linear combination of the optimal minimizing strategy, $\vec{n}$, and the probability antimatching strategy, $\vec{a}$. We define $\vec{a}$ as a vector reflection of $\vec{m}$ over the uniform distribution vector, $\vec{u}$. This operation is denoted $\vec{a} = refl_{\vec{u}}(\vec{m}) = 2\vec{u} - \vec{m}$. In Study 2, we replicate the findings of Study 1 using data collected online. In Study 3, we demonstrate that our conceptualization of probability antimatching extends to probability distributions that have non-unique optimal hiding/seeking strategies and distributions that have invalid reflections (that result in negative probability values). Across our three studies, we find that hiding/seeking strategies are influenced by the number of rooms presented during hide-and-seek, corresponding to the dimensionality of the underlying probability distributions. However, the direction of this effect fails to replicate across our studies.</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="title" lang="en">Probability Antimatching</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">Psychology</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Psychology</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 Arts</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Anderson, Britt</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Arts</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>