<?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-09-19T14:22:50Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/72645" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/72645</identifier><datestamp>2022-01-13T07:54:48Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Natasha Markuzon and Marta C. González.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Bradwick, Matthew E. (Matthew Edward)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Operations Research Center</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Sloan School of Management</dim:field>
   <dim:field mdschema="dc" element="coverage" qualifier="spatial" lang="en_US">a-af---</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-09-11T17:32:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-09-11T17:32:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2012</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2012</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/72645</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">807215820</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2012.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">This electronic version was submitted by the student author.  The certified thesis is available in the Institute Archives and Special Collections.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from student-submitted PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 152-153).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis considers approaches to influencing population opinions during counterinsurgency efforts in Afghanistan. A discrete time, agent-based threshold model is developed to analyze the propagation of beliefs in the social network, whereby each agent has a belief and a threshold value, which indicts the willingness to be influenced by the peers. Agents communicate in stochastic pairwise interactions with their neighbors. A dynamic, two player game is formulated whereby each player strategically controls the placement of one stubborn agent over time in order to maximally influence the network according to one of two different payoff functions. The stubborn agents have opposite, immutable beliefs and exert significant influence in the network. We demonstrate the characteristics of strategies chosen by the players to improve their payoffs through simulation. Determining strategies for the players in large, complex networks in which each stubborn agent has multiple connections is difficult due to exponential increases in the strategy space that is searched. We implement two heuristic methods which are shown to significantly reduce the run time needed to find strategies without significantly reducing the quality of the strategies. Lastly, we introduce population-focused actions, such as economic stimulus projects, which when used by the players result in long-lasting changes in the beliefs of the agents in the network.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Matthew E. Bradwick.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">153 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Belief propagation analysis in two-player games for peer-influence social networks</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Belief propagation analysis in 2-player games for peer-influence social networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="587cdb4b-ce41-49f4-b0d8-178782f571c7">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Belief propagation analysis in two-player games for peer-influence social networks&lt;/Title>
   	&lt;Subtitle>Belief propagation analysis in 2-player games for peer-influence social networks&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2012&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Bradwick, Matthew E. (Matthew Edward)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Operations Research Center.&lt;/Keyword>
   	&lt;Abstract>This thesis considers approaches to influencing population opinions during counterinsurgency efforts in Afghanistan. A discrete time, agent-based threshold model is developed to analyze the propagation of beliefs in the social network, whereby each agent has a belief and a threshold value, which indicts the willingness to be influenced by the peers. Agents communicate in stochastic pairwise interactions with their neighbors. A dynamic, two player game is formulated whereby each player strategically controls the placement of one stubborn agent over time in order to maximally influence the network according to one of two different payoff functions. The stubborn agents have opposite, immutable beliefs and exert significant influence in the network. We demonstrate the characteristics of strategies chosen by the players to improve their payoffs through simulation. Determining strategies for the players in large, complex networks in which each stubborn agent has multiple connections is difficult due to exponential increases in the strategy space that is searched. We implement two heuristic methods which are shown to significantly reduce the run time needed to find strategies without significantly reducing the quality of the strategies. Lastly, we introduce population-focused actions, such as economic stimulus projects, which when used by the players result in long-lasting changes in the beliefs of the agents in the network.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>