<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Polarization and Bipolar Probabilistic Argumentation Frameworks</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Carlo</forename><surname>Proietti</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Lund University</orgName>
							</affiliation>
						</author>
						<title level="a" type="main">Polarization and Bipolar Probabilistic Argumentation Frameworks</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">6E4D16668BC1C576135F43787A290372</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T00:51+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Discussion among individuals about a given issue often induces polarization and bipolarization effects, i.e. individuals radicalize their initial opinion towards either the same or opposite directions. Experimental psychologists have put forward Persuasive Arguments Theory (PAT) as a clue for explaining polarization. PAT claims that adding novel and persuasive arguments pro or contra the debated issue is the major cause for polarization. Recent developments in abstract argumentation provide the tools for capturing these intuitions on a formal basis. Here Bipolar Argumentation Frameworks (BAF) are employed as a tool for encoding the information of agents in a debate relative to a given issue a. A probabilistic extension of BAF allows to encode the likelihood of the opinions pro or contra a before and after information exchange. It is shown, by a straightforward example, how these measures provide the basis to capture the intuitions of PAT.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>The work by <ref type="bibr" target="#b8">[9]</ref> unveiled the phenomenon of risky shift, i.e. the tendency of a group to take decisions that are more extreme than the average of the individual decisions of members before the group met. Subsequent research in social psychology showed that a similar pattern applies, more generally, to change of attitude and opinion after debate. This phenomenon goes under the name of Group polarization. A side effect of polarization are bipolarization effects, i.e. the tendency of different subgroups to radicalize their opinions towards opposite directions. One explanation of polarization is provided by Persuasive Arguments Theory, PAT for short, developed by social psychologists in the 1970s <ref type="bibr" target="#b11">[12]</ref>. PAT assumes that individuals become more convinced of their view when they hear novel and persuasive arguments in favor of their position. 1   1 PAT is not the only explanation for polarization. A relevant tradition in social psychology has regarded polarization and bipolarization as a byproduct of social comparison <ref type="bibr" target="#b7">[8]</ref>: to present themselves in a favorable light in their social environment, individuals take a position which is similar to everyone else but a bit more extreme. Both social comparison and PAT seem to play an important role in different polarization contexts. It is beyond our purposes to adjudicate between the two. We only remark that PAT is fundamental in many such scenarios. To stress this point, if social comparison was the only decisive factor, we should expect to find more pronounced polarizing effects in face-to-face discussion rather than, e.g., web-mediated exchange. But there is conflicting evidence thereof.</p><p>Some recently developed tools in Dung-style abstract argumentation <ref type="bibr" target="#b2">[3]</ref> allow to capture this phenomenon on a formal ground. Indeed, Bipolar Argumentation Frameworks (BAF) ( <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b1">2]</ref>) allow to encode the argumentative knlowledge base of an agent and the arguments both in favor and against a debated issue a. Moreover, a probabilistic extension of BAF allows to encode the likelihood with which opinions pro and contra the debated issue are entertained by the agent. The probabilistic extension of BAF will be named PrBAF and is defined along the same lines of <ref type="bibr" target="#b4">[5]</ref> and <ref type="bibr" target="#b3">[4]</ref>. In Section 4 PrBAF are employed to validate PAT. There it is shown, by an example, how the exchange of arguments in a debate modifies the likelihoods of pro and contra opinions. Furthermore, it is indicated how polarization and bipolarization can be encoded in a way that tracks the change of likelihood of pro and contra opinions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Bipolar Argumentation Frameworks</head><p>Bipolar Argumentation Frameworks (BAF for short) <ref type="bibr" target="#b0">[1]</ref> are defined as follows</p><formula xml:id="formula_0">Definition 1 (BAF). A Bipolar Argumentation Framework G is a triple (A, R a , R s )</formula><p>where A is a finite and non-empty set of arguments and R a , R s ⊆ A × A Here R a and R s are binary relations over A, called the attack and the support relation. The following definition provides some important relations between arguments in a BAF. Definition 2 (Defeat, defence, support and neutrality).</p><formula xml:id="formula_1">(i) a defeats b if there is a path aR 1 . . . R n b, R i ∈ {R s , R a } ∀i ≤ n, n ≥ 1 such</formula><p>that the path contains an odd number of attacks.</p><formula xml:id="formula_2">(ii) a defends b if there is a path aR 1 . . . R n b, R i ∈ {R s , R a } ∀i ≤ n, n ≥ 1</formula><p>such that the path contains an even number k of attacks with k &gt; 0.</p><p>(iii) a supports (resp. weakly supports) b if there is a path aR</p><formula xml:id="formula_3">1 . . . R n b, R i = R s ∀i ≤ n, such that n ≥ 1 (resp. n ≥ 0). (iv) a is neutral w.r.t. b if</formula><p>there is no path (including paths of length 0) between a and b.</p><p>The BAF of Figure <ref type="figure" target="#fig_0">1</ref> helps to illustrate these notions. Argument b supports a, while c defeats a and d defends a.</p><p>Fact 1. Provided that there is a unique path from a to b, we have either that a defeats b, or that a defends b, or that a (weakly) supports b, and these options are mutually exclusive.</p><p>Opinions held by the participants are represented as sets of arguments. The opinions we are interested in are those which are either pro or contra a given issue a. Based on Definition 2 we identify the positions pro a, P(a), and contra a, C(a) as the following families of sets. In this framework, the acceptability of an argument depends on its membership to some set, usually called extensions (or solutions). Solutions should have some specific properties. The basic ones among them are conflict-freeness and collective defense of their own arguments. Intuitively, conflict-freeness means that a set of arguments is coherent, in the sense that no argument attacks another in the same set. <ref type="foot" target="#foot_0">2</ref> The second condition (defending all its elements) encodes the fact that for an opinion to be fully acceptable it should be able to rebut all its counterarguments. Definition 4 (Properties of extensions). Admissibility is a key to define the likelihood measures of P(a) and C(a) in the next section.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Probabilistic BAFs</head><p>One Argument b may be more or less persuasive in support or against a debated issue a. Persuasivity can be factorized into two main components: (a) the intrinsic strength of b which supports or defeats a and (b) the strength of the link between b and a. Both these components are taken into account by the approach of <ref type="bibr" target="#b4">[5]</ref> and can be straightforwardly extended to the bipolar case. For simplicity, and without any loss for our point, we restrict our attention to component (a) as done by <ref type="bibr" target="#b3">[4]</ref>.</p><p>Definition 5 (PrBAF). A Probabilistic Bipolar Argumentation Framework G is a tuple (A, R a , R s , p) where (A, R a , R s ) is a BAF and p : A → [0, 1] is a probability function over arguments.</p><formula xml:id="formula_4">G = (A , R a , R s ) is a spanning subgraph of G = (A, R a , R s , p), denoted as G G, if A ⊆ A, R a = R a ⊗ A and R s = R s ⊗ A , where R ⊗ A = {(a, b) ∈ R | a, b ∈ A}. Definition 6. Let G = (A, R a , R s , p) be a PrBAF and G G. The probability of G , denoted p(G ) is p(G ) = ( a∈A p(a))( a∈A\A (1 − p(a)))</formula><p>It is a standard result that G G p(G ) = 1 and therefore p defines a probability assignment over the set of spanning subgraphs.</p><p>Let G be a PrBAF, G G, and S ⊆ A a set of arguments. G |= S denotes that S is admissible in G , for short G entails S (see <ref type="bibr" target="#b3">[4]</ref>). We can now provide the measures of the likelihood of the pro and contra opinions relative to a. p(G 2 ) = p(G 3 ) = p(G 4 ) = 0.25. Since all of G 1 , G 3 and G 4 entail a set in P(a), it follows, by the same reasoning as before, that p(P(a)) = 0.75, while we still have p(C(a)) = 0. Therefore, our measures capture the intuition that adding one argument in favor of a augments the likelihood of the opinion pro a. By adding c, as in Figure <ref type="figure">2</ref>(c), we obtain eight spanning subgraphs</p><formula xml:id="formula_5">G 1 = ({a}, ∅, ∅), G 2 = (∅, ∅, ∅), G 3 = ({b}, ∅, ∅), G 4 = ({b, a}, ∅, {(b, a)}), G 5 = ({c}, ∅, ∅), G 6 = ({b, c}, ∅, ∅), G 7 = ({c, a}, {(c, a)}, ∅) and G 8 = ({b, c, a}, {(c, a)}, {(b, a)}).</formula><p>All of them have probability 0.125. It can be seen that G 1 , G 3 , G 4 , G 6 and G 8 entail some set in P(a) and therefore p(P(a)) = 0.625. By the same process we see that G 5 , G 6 , G 7 and G 8 entail some set in C(a) and therefore p(C(a)) = 0.5. Here we see that adding an argument against a not only increases the likelihood of C(a), but also decreases that of P(a) and therefore acts as a balance.</p><p>Most interestingly, we can see that the configuration of the arguments in the graph influences strongly the likelihoods of P(a) and C(a). Indeed if we add the defeater c as in Figure <ref type="figure">2</ref>(d), its impact changes w.r.t. the case of Figure <ref type="figure">2(c</ref>). There are always eight spanning subgraphs, but now it can be checked that p(P(a)) = 0.375 and p(C(a)) = 0.5. This helps to appreciate how different argumentative strategies (attack of a supporter vs. direct attack) may have a strong impact on opinion formation. Although the likelihoods of P(a) and C(a) are correlated, it is often the case that p(P(a)) + p(C(a)) &gt; 1 (see example of Figure <ref type="figure">2(c)</ref>). Therefore, adding new arguments in a debate may increase the likelihood of both P(a) and of C(a), thus providing more grounds for both opinions.</p><p>The question remains open how to understand polarization and bipolarization in this framework. According to PAT, polarization is to be viewed as a change of the degree of our attitude towards a after an exchange of information. In this framework the likelihoods p(P(a)) and p(C(a)) are the essential components of such degree. The latter can be encoded by a weighting function w whose arguments are p(P(a)) and p(C(a)). Many such functions are possible candidates. The most natural is the simple arithmetic difference, i.e. w(p(P(a)), p(C(a))) = p(P(a)) − p(C(a)). Another option is provided by the measures defined by <ref type="bibr" target="#b5">[6]</ref>. It is also likely that different subjects i and j have dif-ferent ways of weighting, i.e. w i and w j . Following this thread, polarization of an individual i is measured as the change of the value of w i (p(P(a)), p(C(a))) after information exchange with others. Analogously, we have a bipolarization effect between two subjects i and j when we register a change of w i (p(P(a)), p(C(a))) and w j (p(P(a)), p(C(a))) towards opposite directions after information exchange. Some general considerations are in order to conclude. Group polarization is a widespread phenomenon which, to some extent, speaks against theories attributing to collective discussion a positive role in improving the global performance of a group. Two most notable cases are Surowiecki's wisdom of crowds <ref type="bibr" target="#b10">[11]</ref> and Mercier and Sperber's argumentative theory of reasoning <ref type="bibr" target="#b6">[7]</ref>. However, the contrast is often only apparent. For example Surowiecki stresses very clearly that the wisdom of crowds applies mostly to cognition, coordination and cooperation tasks (see <ref type="bibr" target="#b10">[11]</ref>, introduction p. XVIII). Now, many contexts in which polarization arises, like political debate <ref type="bibr" target="#b9">[10]</ref>, dont fall under these categories. Furthermore, Surowiecki stresses three necessary conditions for a crowd to be wise, namely diversity, independence and decentralization. As he himself recognizes ( <ref type="bibr" target="#b10">[11]</ref>, chapter 9) polarization often arises where diversity of opinion fails. The set of conditions suggested by Surowiecki provide interesting tests for future research.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .</head><label>1</label><figDesc>Fig.1. An example of BAF. Labelled nodes represent arguments. Relations of support between arguments are indicated with a plain edge, while relations of attack are indicated with a barred one.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Definition 3 (</head><label>3</label><figDesc>Pro and contra opinions). a set S belongs to P(a) iff S = ∅ and ∀b ∈ S either b defends a or b weakly supports a. a set S belongs to C(a) iff S = ∅ and ∀b ∈ S b defeats a.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head></head><label></label><figDesc>(i) A set S is conflict-free if there is no a, b ∈ S s.t. a defeats b. (ii) A set S defends collectively an argument a if for all b such that b defeats a there is a c ∈ S s.t. c defeats b. (iii) A set S is admissible if it is conflict-free and defends all its elements.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Definition 7 (Fig. 2 .</head><label>72</label><figDesc>Figure 2 serves to illustrate the change of likelihood of P(a) and C(a) from an initial knowledge base of an agent (Figure 2(a)) where no information is available except for the debated issue a. At the subsequent stages arguments are added with different configurations (Figure 2(b), Figure 2(c) and Figure 2(d)). In Figure 2(a) the spanning subgraphs G G are G 1 = ({a}, ∅, ∅) and G 2 = (∅, ∅, ∅), and both have probability 0.5. Here G 1 |= {a}, and {a} ∈ P(a). On the contrary G 2 entails nothing else than the empty set ∅, which does not belong to P(a). Therefore p(P(a)) = 0.5. None of G 1 and G 2 instead entails any set in C(a) and therefore p(C(a)) = 0. When we add b to the debate the argumentative knowledge base transforms into that of Figure 2(b), where the spanning subgraphs are G 1 = ({a}, ∅, ∅), G 2 = (∅, ∅, ∅), G 3 = ({b}, ∅, ∅), and G 4 = ({b, a}, ∅, {(b, a)}). Here p(G 1 ) =</figDesc></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0">A stronger notion of coherence is also provided in<ref type="bibr" target="#b0">[1]</ref> under the name of 'safety'. However, we only need to introduce conflict-freeness for our present purposes.</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">On the Acceptability of Arguments in Bipolar Argumentation Frameworks</title>
		<author>
			<persName><forename type="first">C</forename><surname>Cayrol</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">C</forename><surname>Lagasquie-Schiex</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes in Computer Science</title>
		<imprint>
			<biblScope unit="volume">3571</biblScope>
			<biblScope unit="page" from="378" to="389" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Bipolarity in Argumentation Graphs: Towards a better Understanding</title>
		<author>
			<persName><forename type="first">C</forename><surname>Cayrol</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">C</forename><surname>Lagasquie-Schiex</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Approximate Reasoning</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="issue">7</biblScope>
			<biblScope unit="page" from="876" to="899" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">M</forename><surname>Dung</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artificial Intelligence</title>
		<imprint>
			<biblScope unit="volume">77</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="321" to="357" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Some foundations for probabilistic abstract argumentation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Hunter</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">COMMA</title>
		<imprint>
			<biblScope unit="volume">2012</biblScope>
			<biblScope unit="page" from="117" to="128" />
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Probabilistic Argumentation Frameworks Lecture Notes in</title>
		<author>
			<persName><forename type="first">H</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Oren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">J</forename><surname>Norman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computer Science</title>
		<imprint>
			<biblScope unit="volume">7132</biblScope>
			<biblScope unit="page" from="1" to="16" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A Game-Theoretic Measure of Argument Strength for Abstract Argumentation</title>
		<author>
			<persName><forename type="first">P</forename><surname>Matt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Toni</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes in Computer Science</title>
		<imprint>
			<biblScope unit="volume">5293</biblScope>
			<biblScope unit="page" from="285" to="297" />
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Why do humans reason? Arguments for an argumentative theory</title>
		<author>
			<persName><forename type="first">H</forename><surname>Mercier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Sperber</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Behavioral and Brain Sciences</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="57" to="111" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Is social comparison irrelevant for producing choice shifts?</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">S</forename><surname>Sanders</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">S</forename><surname>Baron</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Experimental Social Psychology</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page" from="303" to="314" />
			<date type="published" when="1977">1977</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">A comparison of individual and group decision involving risk MA thesis</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Stoner</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1961">1961</date>
		</imprint>
		<respStmt>
			<orgName>Massachusetts Institute of Technology</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<title level="m" type="main">Why societies need Dissent</title>
		<author>
			<persName><forename type="first">C</forename><surname>Sunstein</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2003">2003</date>
			<publisher>Harvard University Press</publisher>
			<pubPlace>Cambridge</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<title level="m" type="main">The Wisdom of Crowds</title>
		<author>
			<persName><forename type="first">J</forename><surname>Surowiecki</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2005">2005</date>
			<publisher>Anchor Books</publisher>
			<pubPlace>New York</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Effects of partially shared persuasive arguments on group-induced shifts</title>
		<author>
			<persName><forename type="first">A</forename><surname>Vinokur</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Burnstein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Personality and Social Psychology</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="305" to="315" />
			<date type="published" when="1974">1974</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
