<?xml version="1.0" encoding="utf-8"?>
<article xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="JATS-journalpublishing1-mathml3.xsd" dtd-version="1.2" article-type="Article">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">ergo</journal-id>
<journal-title-group>
<journal-title>Ergo an Open Access Journal of Philosophy</journal-title>
</journal-title-group>
<issn pub-type="epub">2330-4014</issn>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1153</article-id>
<article-id pub-id-type="manuscript">8_16/Elkin_Pooling.tex,8_16/Elkin_Pooling.pdf</article-id>
<article-id pub-id-type="doi">10.3998/ergo.1153</article-id>
<title-group>
<article-title>R<sc>egret</sc> A<sc>verse</sc> O<sc>pinion</sc> A<sc>ggregation</sc></article-title>
<alt-title alt-title-type="running-head-verso">Lee Elkin</alt-title>
<alt-title alt-title-type="running-head-recto">Regret Averse Opinion Aggregation</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name>
<surname>ELKIN</surname>
<given-names>LEE</given-names>
</name>
<email>lee.elkin@uj.edu.pl</email>
<xref rid="aff1" ref-type="aff"/>
</contrib>
</contrib-group>
<aff id="aff1">
<institution>Jagiellonian University in Krak&#x00F3;w</institution>
<institution content-type="position"></institution>
<institution content-type="dept"></institution>
<addr-line content-type="addrline1"></addr-line>
<country></country>
<addr-line content-type="city"></addr-line>
<addr-line content-type="zipcode"></addr-line>
<phone content-type="primary"></phone>
</aff>
<pub-date>
<day>30</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>8</volume>
<issue>1</issue>
<history>
<date date-type="received">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="rev-recd">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="accepted">
<day></day>
<month></month>
<year></year>
</date>
</history>
<permissions>
<license><license-p>CC BY-NC-ND 4.0</license-p></license>
</permissions>
<abstract id="ABS1">
<p id="P1">It is often suggested that when opinions differ among individuals in a group, the opinions should be aggregated to form a compromise. This paper compares two approaches to aggregating opinions, linear pooling and what I call opinion agglomeration. In evaluating both strategies, I propose a pragmatic criterion, No Regrets, entailing that an aggregation strategy should prevent groups from buying and selling bets on events at prices regretted by their members. I show that only opinion agglomeration is able to satisfy the demand. I then proceed to give normative and empirical arguments in support of the pragmatic criterion for opinion aggregation, and that ultimately favor opinion agglomeration.</p>
</abstract>
<funding-group />
<counts>
<fig-count count="0" />
</counts>
<custom-meta-group>
<custom-meta id="competing-interest">
<meta-name></meta-name>
<meta-value></meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<p id="P2">T<sc>he</sc> chairman of an agricultural committee has commissioned a group of economic experts to determine how likely the Food Price Index (FPI) will exceed 120 by 2025, given the rising number of droughts annually (the monthly FPI average for 2020 is near 95). After reviewing the data, the members exchange their opinions on the matter, but to no one&#x2019;s surprise, the opinions differ. The group realizes, however, that in moving forward, they need to come to a reasonable compromise, if not a consensus, before briefing the chairman, but how?<sup><xref rid="fn1" ref-type="fn">1</xref></sup> It is often suggested that such a collective problem can be solved by aggregating the opinions. In this paper, I will compare two strategies for aggregating opinions, the popular linear pooling approach and what I call opinion agglomeration.</p>
<p id="P3">The way this paper differs from previous work on the subject is by its focus on a pragmatic dimension of opinions, following de <xref rid="R20" ref-type="bibr">Finetti (1974)</xref>, where a probabilistic opinion of an event <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><mml:mi>X</mml:mi></mml:math></inline-formula> is viewed as the maximum price one is willing to buy and minimum price they are willing to sell a bet that pays 1 monetary unit in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><mml:mi>X</mml:mi></mml:math></inline-formula> occurs, nothing otherwise. After extending this pragmatic interpretation to collective opinions, I will propose a novel constraint, entailing that an aggregation strategy should prevent groups from buying and selling bets on events at prices <italic>regretted</italic> by their members. The felt regret in question is disappointment over paying too much for a bet and similarly selling the bet for too little. The regret is thus <italic>ex ante</italic> rather than <italic>ex post</italic>, as the negative emotion is conditioned on acts that precede learning the outcomes that settle the bets.</p>
<p id="P4">With the pragmatic constraint imposed on opinion aggregation, I will show that linear pooling fails to satisfy the demand when opinions differ provided that a group&#x2019;s losses from buying and selling bets at the prices yielded by the aggregation strategy are perceived to be positive by some members, thus causing those members to regret the group&#x2019;s betting behavior. At best, linear pooling may eliminate the perceived loss from one of the two transaction types for all members, but only if the Non-Dictatorship criterion is violated and the perceived loss from the opposite transaction type is increased from the viewpoints of some members. In comparison, I will show that opinion agglomeration satisfies the demand, as a group&#x2019;s losses from buying and selling bets at the prices yielded by the aggregation strategy are perceived to be zero by all members. Thus, no member regrets the group&#x2019;s betting behavior. Afterward, I will provide normative and empirical arguments in support of the pragmatic criterion for opinion aggregation, and that ultimately favor opinion agglomeration.</p>
<sec id="S1">
<label>1.</label><title>Two Aggregation Strategies</title>
<p id="P5">While there are many approaches to aggregating opinions (see <xref rid="R23" ref-type="bibr">Genest &amp; Zidek 1986</xref>; <xref rid="R12" ref-type="bibr">Dietrich &amp; List 2016</xref>), I will restrict the focus to just two in this paper, linear pooling and opinion agglomeration. In this section, I will introduce the technical details, along with reasons for why groups might adopt each strategy.</p>
<sec id="S2">
<label>1.1.</label><title>Linear Pooling</title>
<p id="P6">For a group of individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula>, let the set of events the group is concerned with be a finite algebra <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4"><mml:mi>&#x1D49C;</mml:mi></mml:math></inline-formula> over a set of states <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M5"><mml:mtext>&#x03A9;</mml:mtext></mml:math></inline-formula>. Call <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M6"><mml:mi>&#x1D49C;</mml:mi></mml:math></inline-formula> the group&#x2019;s <italic>agenda</italic>. With respect to the agenda, every individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M7"><mml:mi>i</mml:mi></mml:math></inline-formula>&#x2018;s opinions are represented by a function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M8"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>&#x2192;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M9"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mtext>&#x0394;</mml:mtext></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M10"><mml:mtext>&#x0394;</mml:mtext></mml:math></inline-formula>, is the set of all probability functions on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M11"><mml:mi>&#x1D49C;</mml:mi></mml:math></inline-formula>. Call a collection of opinion functions for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M12"><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, an <italic>opinion profile</italic>, and let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M13"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> be the set of admissible opinion profiles. Finally, let the group&#x2019;s opinions be formed by a <italic>pooling function</italic>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M14"><mml:mi>F</mml:mi></mml:math></inline-formula>, mapping opinion profiles to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M15"><mml:mtext>&#x0394;</mml:mtext></mml:math></inline-formula>.</p>
<p id="P7">The most common linear pooling model, and the one I will focus on in this paper, is the following:
<disp-formula id="FD1">
<label>(1)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M16">
<mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo stretchy='true'>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>,</mml:mo></mml:mrow>
</mml:math>
</disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M17"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a non-negative weight representing individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M18"><mml:mi>i</mml:mi></mml:math></inline-formula>&#x2019;s level of reliability or expertise, and the sum of weights for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M19"><mml:mi>i</mml:mi></mml:math></inline-formula> is equal to one (<xref rid="R59" ref-type="bibr">Stone 1961</xref>). Simply put, the linear pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M20"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, yields weighted averages of individual opinions for all events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M21"><mml:mi>X</mml:mi></mml:math></inline-formula> that represent the opinions of the group.</p>
<p id="P8">The pooling model introduced may already be familiar to those acquainted with the epistemic peer disagreement literature, as it is a generalization of the so-called <italic>equal weight</italic> model (see <xref rid="R28" ref-type="bibr">Jehle &amp; Fitelson 2009</xref>). On an equal weight view, peers should resolve their disagreements through the following:
<disp-formula id="FD2">
<label>(2)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M22">
<mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo stretchy='true'>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P9">Besides settling peer disagreements, (2) is an efficient way of forming collective opinions without having to invest time in determining the weight given to each individual. But in case the group is committed to determining how much weight each individual deserves, and every individual is given a say on the matter, the group may face yet another problem, namely, disagreement over weighting assignments. To address the problem, some suggest that the individuals should revise their opinions to weighted averages and iterate the procedure until all opinions have sufficiently converged (<xref rid="R10" ref-type="bibr">DeGroot 1974</xref>; <xref rid="R37" ref-type="bibr">Lehrer 1976</xref>; <xref rid="R64" ref-type="bibr">Wagner 1978</xref>).</p>
<p id="P10">The formal setup is a bit different in the DeGroot-Lehrer-Wagner tradition. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M23"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M24"><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula>, be the weight that individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M25"><mml:mi>i</mml:mi></mml:math></inline-formula> assigns to every individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M26"><mml:mi>j</mml:mi></mml:math></inline-formula>, including <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M27"><mml:mi>i</mml:mi></mml:math></inline-formula>, and the sum of weights is equal to one. These weights reflect personal opinions about every individual&#x2019;s level of reliability or expertise from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M28"><mml:mi>i</mml:mi></mml:math></inline-formula>&#x2018;s point of view and are situated as a row in a Markov matrix,
<disp-formula id="FD3">
<label>(3)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M29">
<mml:mrow><mml:mtext mathvariant='bold'>M</mml:mtext><mml:mo>=</mml:mo><mml:mfenced close="]" open="["><mml:mrow><mml:mtable equalrows='true' equalcolumns='true'><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22C5;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow>
</mml:math>
</disp-formula>
with the opinion profile situated as a column vector,
<disp-formula id="FD4">
<label>(4)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M30">
<mml:mrow><mml:mtext mathvariant='bold'>P</mml:mtext><mml:mo>=</mml:mo><mml:mfenced close="]" open="["><mml:mrow><mml:mtable equalrows='true' equalcolumns='true'><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula>The opinions are then aggregated repeatedly through iterated multiplication, and as <xref rid="R10" ref-type="bibr">DeGroot (1974)</xref> showed, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M31"><mml:mrow><mml:msup><mml:mtext mathvariant='bold'>P</mml:mtext><mml:mi>k</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M32"><mml:mrow><mml:msup><mml:mtext mathvariant='bold'>M</mml:mtext><mml:mi>k</mml:mi></mml:msup><mml:mtext mathvariant='bold'>P</mml:mtext></mml:mrow></mml:math></inline-formula> converges to some opinion profile <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M33"><mml:mrow><mml:msup><mml:mtext mathvariant='bold'>P</mml:mtext><mml:mi>&#x221E;</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> such that no subsequent revision will change the limiting profile.<sup><xref rid="fn2" ref-type="fn">2</xref></sup></p>
<p id="P12">Put in more familiar terms, every individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M34"><mml:mi>i</mml:mi></mml:math></inline-formula> revises at step <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M35"><mml:mi>k</mml:mi></mml:math></inline-formula> to the following:
<disp-formula id="FD5">
<label>(5)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M36">
<mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo stretchy='true'>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula>As <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M37"><mml:mi>k</mml:mi></mml:math></inline-formula> approaches infinity, opinions will sufficiently converge, and no further revision will change any one opinion in the profile. The upshot of adopting this iterative procedure is that the group will arrive at a consensus as opposed to a mere compromise. The underlying idea is that deliberation compels the individuals to change their opinions, and by continuously repeating the process, the group will eventually come to an agreement. Unfortunately, the consensus approach with varying subjective weight distributions can be costly timewise.</p>
<p id="P14">If, however, the individuals show <italic>mutual respect</italic>, that is, every individual allocates equal weight to all members of the group, then they will settle on the following:
<disp-formula id="FD6">
<label>(6)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M38">
<mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo stretchy='true'>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>j</mml:mi><mml:mi>o</mml:mi></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula>Notice that mutual respect is the most efficient solution since a consensus is reached after the first deliberation, thus making it computationally appealing.</p>
<p id="P16">What should be apparent to the reader at this point is that linear pooling consists of a class of pooling models (larger than the two mentioned above) capable of forming compromises for different occasions. Besides promoting a compromise, I illustrated how weighted averaging also leads to a consensus through iterated belief revision. Considering the benefits afforded by weighted averaging, pooling by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M39"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is often viewed as an attractive aggregation strategy.</p>
</sec>
<sec id="S3">
<label>1.2.</label><title>Motivating Linear Pooling</title>
<p id="P17">There are at least two reasons for favoring linear pooling. The first comes from discussions on peer disagreement (<xref rid="R6" ref-type="bibr">Christensen 2007</xref>; <xref rid="R15" ref-type="bibr">Elga 2007</xref>; <xref rid="R19" ref-type="bibr">Feldman 2007</xref>). The popular <italic>conciliatory</italic> view maintains that peers should move their opinions toward one another after discovering that they disagree. Proponents contend that a difference of opinion is evidence that each peer is liable for having made a mistake provided that no peer is assumed to be epistemically superior to another. Such evidence is said to undermine the reliability of each peer&#x2019;s reasoning on the matter. And since there is no good epistemic reason to dismiss a peer&#x2019;s opinion, peers should welcome the evidence and take the middle ground for the time being. While there is debate over what the correct belief revision amounts to (see <xref rid="R7" ref-type="bibr">Christensen 2011</xref>; <xref rid="R33" ref-type="bibr">Kelly 2013</xref>), many have suggested that peers should adopt an equal weighted average, as it seems to be the most intuitive answer.</p>
<p id="P18">The second relates to &#x201C;the wisdom of crowds&#x201D; (<xref rid="R61" ref-type="bibr">Surowiecki 2005</xref>). In short, the wisdom of crowds is the idea that groups outperform individuals in forecasting and estimation tasks (under certain conditions such as the independence of every opinion) and has been confirmed empirically. One of the earliest observations traces back to Sir <xref rid="R21" ref-type="bibr">Francis Galton (1907)</xref>, who reported that the median guess of the weight of a &#x201C;dressed&#x201D; ox in a weight judging contest was within less than one percent of the ox&#x2019;s true weight of 1198 lb. Although Galton highlighted the accuracy of the median in the original paper, <xref rid="R27" ref-type="bibr">R. H. Hooker (1907)</xref> pointed out in a reply that the arithmetic mean of 1196 lb, based on the numbers reported, was more accurate than the median. In his response to Hooker, Galton provided the correct arithmetic mean of 1197 lb (only 1 lb off the mark) versus the 1207 lb median, thereby confirming Hooker&#x2019;s suspicion of the mean being more accurate than the median.<sup><xref rid="fn3" ref-type="fn">3</xref></sup> Despite the ensuing dispute, what was discovered in the exchange is the value of group estimates and predictions when opinions are averaged. Thus, the wisdom of crowds provides a further reason for adopting at least a special case of linear pooling given the accuracy of the average opinion.</p>
</sec>
<sec id="S4">
<label>1.3.</label><title>Agglomerative Pooling</title>
<p id="P19">The second strategy I will consider and call opinion agglomeration requires a more expressive imprecise probability (IP) framework (<xref rid="R45" ref-type="bibr">Moral &amp; del Sagrado 1998</xref>; <xref rid="R47" ref-type="bibr">Nau 2002</xref>; <xref rid="R58" ref-type="bibr">Stewart &amp; Quintana 2018</xref>). For a group of individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M40"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula>, let the group&#x2019;s agenda once again be a finite algebra <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M41"><mml:mi>&#x1D49C;</mml:mi></mml:math></inline-formula> over a set of states <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M42"><mml:mtext>&#x03A9;</mml:mtext></mml:math></inline-formula>. With respect to the agenda, every individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M43"><mml:mi>i</mml:mi></mml:math></inline-formula>&#x2018;s opinions are represented by a non-empty, convex set of probability functions, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M44"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2286;</mml:mo><mml:mtext>&#x0394;</mml:mtext></mml:mrow></mml:math></inline-formula>, on the agenda.<sup><xref rid="fn4" ref-type="fn">4</xref></sup> Call a collection of set-based opinions for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M45"><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, an opinion profile, and let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M46"><mml:mrow><mml:msup><mml:mi>&#x1D49F;</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> be the set of admissible opinion profiles, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M47"><mml:mi>&#x1D49F;</mml:mi></mml:math></inline-formula> is the set of all non-empty, convex sets of probability functions. Finally, let the group&#x2019;s opinions be formed by a pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M48"><mml:mi>&#x2131;</mml:mi></mml:math></inline-formula>, mapping opinion profiles to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M49"><mml:mi>&#x1D49F;</mml:mi></mml:math></inline-formula>.</p>
<p id="P20">The most natural agglomerative pooling model, and the one I will focus on in this paper, is the following:
<disp-formula id="FD7">
<label>(7)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M50">
<mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant="normal">conv</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula>Simply put, the agglomerative pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M51"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, yields non-empty, convex sets of probabilities for all events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M52"><mml:mi>X</mml:mi></mml:math></inline-formula>, representing the opinions of the group.<sup><xref rid="fn5" ref-type="fn">5</xref></sup> Despite the absence of a reliability or expertise factor, a form of equal weight is encoded, as the function&#x2019;s output is invariant under permutations of individuals.</p>
<p id="P22">While pooling by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M53"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> may come across as a sensible way of agglomerating opinions, some might question the convexity property provided that there are cases in which non-convex sets of probability functions are intuitive. For example, if a group were to learn that a coin either has an exact bias of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M54"><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M55"><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>7</mml:mn></mml:math></inline-formula> toward heads, then it would be wise to adopt a set consisting of probability functions assigning just those two values to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M56"><mml:mi>H</mml:mi></mml:math></inline-formula> rather than a set that also includes the convex hull, as the latter encodes additional information. Thus, it seems that convexity should be optional for agglomerative pooling, not mandatory.</p>
<p id="P23">Let me clarify that I only assume the convexity property here for mathematical convenience and make no philosophical commitment to it like <xref rid="R39" ref-type="bibr">Levi (1974)</xref> and <xref rid="R30" ref-type="bibr">Joyce (2010)</xref>. But in case one insists on relaxing the convexity assumption, they might prefer the following agglomerative pooling model instead:
<disp-formula id="FD8">
<label>(8)</label>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M57">
<mml:mrow><mml:msubsup><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:msub><mml:mi>&#x2119;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x2119;</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>&#x2119;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>,</mml:mo></mml:mrow>
</mml:math>
</disp-formula>
where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M58"><mml:mi>&#x2119;</mml:mi></mml:math></inline-formula> denotes a set of probability functions that is not necessarily convex (note that the pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M59"><mml:mrow><mml:msubsup><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula>, has a domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M60"><mml:mrow><mml:mi>&#x1D4AB;</mml:mi><mml:msup><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mtext>&#x0394;</mml:mtext><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> and range <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M61"><mml:mrow><mml:mi>&#x1D4AB;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mtext>&#x0394;</mml:mtext><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, where the latter denotes the power set of delta). One advantage of the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M62"><mml:mrow><mml:msubsup><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> agglomerative pooling function is that it preserves judgments about the independence of events. That is, if all members of a group judge events <italic>X</italic> and <italic>Y</italic> to be stochastically independent, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M63"><mml:mrow><mml:msubsup><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> preserves their independence in the collective opinions, whereas <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M64"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> does not. There has been much debate over this issue in the literature (see, e.g., <xref rid="R39" ref-type="bibr">Levi 1974</xref>; <xref rid="R35" ref-type="bibr">Kyburg &amp; Pittarelli 1996</xref>), which goes beyond the scope of this paper, but I have introduced (8) for those concerned about convexity.</p>
<p id="P24">As it should be apparent by now, opinion agglomeration, like linear pooling, consists of a class of pooling models (larger than the two mentioned above) capable of forming compromises for different occasions. Although the agglomerating method may not have the same level of appeal as weighted averaging, the pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M65"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, enjoys some nice properties, as we will come to see.</p>
</sec>
<sec id="S5">
<label>1.4.</label><title>Motivating Opinion Agglomeration</title>
<p id="P25">A reason for modeling opinions by imprecise probabilities is that individuals occasionally form non-additive beliefs, as notably demonstrated by <xref rid="R17" ref-type="bibr">Daniel Ellsberg (1961)</xref>. In surveying decision theorists, one of the problems given involved bets on drawing balls from two distinct urns. Participants were informed that urn 1 contains a mixture of 50 red balls and 50 black balls, and urn 2 contains a mixture of 100 red and black balls in unknown proportions. They were asked to report their preferences for a series of bets with equal prizes on randomly drawing a red ball and drawing a black ball. Between two bets on a single urn, most were indifferent. Between two bets across urns, most reported a strict preference for the bet on urn 1, e.g., a $100 or nothing bet on drawing a red ball from urn 1 was strictly preferred to a $100 or nothing bet on drawing a red ball from urn 2.</p>
<p id="P26">The phenomenon described is known as <italic>ambiguity aversion</italic>. As Ellsberg pointed out, a strict preference for a bet on urn 1 to a bet on urn 2 cannot be characterized by the traditional Savage axioms when indifferent toward bets on each urn individually. For such preferences on <xref rid="R53" ref-type="bibr">L. J. Savage&#x2019;s (1954)</xref> view are inconsistent and thus irrational. But the followers of Herbert Simon disagree. <xref rid="R57" ref-type="bibr">Simon (1955)</xref> claimed that the optimality of judgments and decisions should be relativized to an individual&#x2019;s cognitive capacities and available information. Under this view, judgment and decision optimality should be thought of instead as <italic>bounded rationality</italic> (see <xref rid="R69" ref-type="bibr">Wheeler 2020</xref> for a comprehensive survey). In following this tradition, <xref rid="R25" ref-type="bibr">Gilboa and Schmeidler (1989)</xref> introduced a set of axioms, entailing a maximin expected utility decision rule, whereby a decision maker chooses an option that maximizes minimum expected utility, relative to a convex set of probability functions. Provided the extended decision framework developed by Gilboa and Schmeidler, the reported preferences resulting from the Ellsberg experiments can plausibly be explained (see <xref rid="R43" ref-type="bibr">Machina &amp; Siniscalchi 2014</xref> and <xref rid="R24" ref-type="bibr">Gilboa &amp; Marinacci 2016</xref> for recent surveys on ambiguity aversion).</p>
<p id="P27">Although ambiguity aversion might convey a need for imprecise probabilities, the observed behavior only offers a reason to think that IP is useful for modeling the judgments and decisions of individuals.<sup><xref rid="fn6" ref-type="fn">6</xref></sup> However, <xref rid="R32" ref-type="bibr">Keller, Sarin, and Sounderpandian (2007)</xref> discovered that groups exhibit ambiguity aversion also. As part of their experiment, they tested participants on an Ellsberg-like problem, first by one&#x2019;s self and then collectively in randomly formed dyads. In addition to replicating the findings of Ellsberg, they found that the average amount dyads are willing to pay for a bet on the ambiguous urn is less than the average amount individuals are willing to pay for the same bet, implying that groups are even more ambiguity averse than their members. What is more, the data suggest that the opinions of dyads are some conglomerate of individual opinions given a larger difference between the buying and selling prices of groups than that of individuals, thus furnishing empirical evidence for compromising by agglomerating.</p>
</sec>
</sec>
<sec id="S6">
<label>2.</label><title>Desirable Criteria for Opinion Aggregation</title>
<p id="P28">In the previous section, I presented two strategies for aggregating opinions. In this section, I aim to assess their plausibility by comparing them against a set of desirable criteria that aggregation strategies arguably should meet. A handful of criteria for pooling functions have been proposed in the past, which I will briefly review. Then, I will introduce a pragmatic criterion called No Regrets. Distinct from the other criteria, the latter focuses on collective behavior. A reason for introducing the criterion is that, as far as I know, there has been very little to no attention given to pragmatic considerations for opinion aggregation. This deficiency is quite surprising since a difference of opinion should, among other things, prompt <italic>cautious</italic> group behavior if groups were to act on their opinions, which the proposed criterion aims to accommodate in some form.</p>
<sec id="S7">
<label>2.1.</label><title>A Brief Review of Some Desirable Criteria for Pooling Functions</title>
<p id="P29">Although a number of criteria have been proposed in the past (see, e.g., <xref rid="R1" ref-type="bibr">Acz&#x00E9;l &amp; Wagner 1980</xref>; <xref rid="R44" ref-type="bibr">McConway 1981</xref>; <xref rid="R23" ref-type="bibr">Genest &amp; Zidek 1986</xref>; <xref rid="R22" ref-type="bibr">Garg, Jayram, Vaithyanathan, &amp; Zhu 2004</xref>; <xref rid="R12" ref-type="bibr">Dietrich &amp; List 2016</xref>; <xref rid="R58" ref-type="bibr">Stewart &amp; Quintana 2018</xref>; <xref rid="R26" ref-type="bibr">Hartmann 2017</xref>), the following four regularly appear in the literature due to the epistemic features they preserve.</p>
<disp-quote id="Q1">
<p id="P30">(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M280"><mml:mrow><mml:mtext mathvariant="bold">i</mml:mtext></mml:mrow></mml:math></inline-formula>) Unanimity. For all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M66"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, if all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M67"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are identical, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M68"><mml:mrow><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (in IP: for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M69"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, if all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M70"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are identical, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M71"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>).</p>
<p id="P31">(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M281"><mml:mrow><mml:mtext mathvariant="bold">ii</mml:mtext></mml:mrow></mml:math></inline-formula>) Eventwise Independence or Weak Setwise Function Property. There exists a function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M72"><mml:mrow><mml:mi>G</mml:mi><mml:mo>:</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>n</mml:mi></mml:msup><mml:mo>&#x2192;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula> such that for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M73"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M74"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M75"><mml:mrow><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mfenced><mml:mrow><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> (in IP: there exists a function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M76"><mml:mrow><mml:mi>&#x1D4A2;</mml:mi><mml:mo>:</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x1D4AB;</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mfenced></mml:mrow><mml:mi>n</mml:mi></mml:msup><mml:mo>&#x2192;</mml:mo><mml:mi>&#x1D4AB;</mml:mi><mml:mfenced><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> such that for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M77"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M78"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M79"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>&#x1D4A2;</mml:mi><mml:mfenced><mml:mrow><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>.</p>
<p id="P32">(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M282"><mml:mrow><mml:mtext mathvariant="bold">iii</mml:mtext></mml:mrow></mml:math></inline-formula>) Boundedness. For all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M80"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M81"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M82"><mml:mrow><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> is in the closed interval <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M83"><mml:mrow><mml:mfenced close="]" open="["><mml:mrow><mml:mtext>min</mml:mtext><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mtext>&#x2003;</mml:mtext><mml:mi>max</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> (in IP: for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M84"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M85"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M86"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> is a subset of the closed interval <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M87"><mml:mrow><mml:mfenced close="]" open="["><mml:mrow><mml:mi>inf</mml:mi><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mi>sup</mml:mi><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>).</p>
<p id="P33">(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M283"><mml:mrow><mml:mtext mathvariant="bold">iv</mml:mtext></mml:mrow></mml:math></inline-formula>) Non-Dictatorship. There is no individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88"><mml:mi>i</mml:mi></mml:math></inline-formula> such that for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M89"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90"><mml:mrow><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (in IP: there is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi mathvariant="bold">i</mml:mi></mml:math></inline-formula> such that for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M91"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M92"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>).</p>
</disp-quote>
<p id="P34">The first two criteria trace back to early systematic studies on opinion pooling (<xref rid="R1" ref-type="bibr">Acz&#x00E9;l &amp; Wagner 1980</xref>; <xref rid="R44" ref-type="bibr">McConway 1981</xref>). In short, the Unanimity criterion implies that if all individuals hold the same opinions, then the collective opinions should not differ. The Eventwise Independence criterion implies that the collective opinion for any event <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M93"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula> should depend only on the individual opinions of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M94"><mml:mi>X</mml:mi></mml:math></inline-formula>. Both of these criteria are straightforward and epistemically plausible.</p>
<p id="P35">The Boundedness criterion (<xref rid="R22" ref-type="bibr">Garg et al. 2004</xref>) implies that a pooled opinion should not fall outside of the range of opinions expressed by the members of the group. This criterion is reasonable, as the group agrees by default that the epistemically warranted opinion, based on the information available, is within the range of expressed opinions. Any pooling function yielding a collective opinion outside of the range respects none of the individual opinions. Furthermore, a pooling function violating Boundedness is prone to underestimating or overestimating the probabilities of events with uncertain chances since, as empirical evidence concerning collective intelligence suggests, groups &#x201C;bracket the truth.&#x201D;<sup><xref rid="fn7" ref-type="fn">7</xref></sup></p>
<p id="P36">The Non-Dictatorship criterion implies that no individual should determine the group&#x2019;s opinions no matter what. This is a reasonable constraint to impose on pooling functions, especially for precise probabilities, provided that (non-extreme) weighted averages will often be more accurate than any individual&#x2019;s opinions. The criterion is also plausible from an evidentialist point of view since it, like Boundedness, maintains respect for the evidence (<xref rid="R18" ref-type="bibr">Feldman 2005</xref>). For these reasons, the Non-Dictatorship criterion should appear to be feasible.</p>
</sec>
<sec id="S8">
<label>2.2.</label><title>&#x2018;Regret Averse&#x2019; Pooling</title>
<p id="P37">The above criteria for pooling functions aim at preserving features that serve the epistemic interests of groups, but groups should also care about preserving features that serve their practical interests. After all, why aggregate opinions if not for guiding collective behavior? Let us turn our attention then to pragmatic criteria. While many might exist, I will propose one relating to group betting behavior. The idea is that an aggregation strategy should prevent groups from buying and selling bets on events at prices <italic>regretted</italic> by their members.<sup><xref rid="fn8" ref-type="fn">8</xref></sup> In this section, I will flesh out the idea in full, but first, some preliminaries are in order.</p>
<p id="P38">The betting convention established by <xref rid="R20" ref-type="bibr">de Finetti (1974)</xref> assumes that every individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M95"><mml:mi>i</mml:mi></mml:math></inline-formula> is willing to buy and sell bets on events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M96"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula> that pay 1 monetary unit if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M97"><mml:mi>X</mml:mi></mml:math></inline-formula> occurs, nothing otherwise. For all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M98"><mml:mi>i</mml:mi></mml:math></inline-formula> and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M99"><mml:mi>X</mml:mi></mml:math></inline-formula>, let the maximum price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M100"><mml:mi>i</mml:mi></mml:math></inline-formula> is willing to pay for a bet on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M101"><mml:mi>X</mml:mi></mml:math></inline-formula> be represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M102"><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, and the minimum price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M103"><mml:mi>i</mml:mi></mml:math></inline-formula> is willing to sell the bet be represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M104"><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. On de Finetti&#x2019;s view, an individual&#x2019;s (precise) opinion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M105"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> is their fair price for the bet such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M106"><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. By comparison, the buying and selling prices in IP are canonically represented by a <italic>lower probability</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M107"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>inf</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and an <italic>upper probability</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M108"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>sup</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, respectively. These prices need not be the same, though. Hence, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M109"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> need not be precise, that is, a singleton set.</p>
<p id="P39">Regardless of whether opinions are precise or imprecise on some matter, all rational individuals should agree on at least one thing. That is, no individual should buy a bet on an event above or sell the bet below the buying and selling prices fixed by their opinion of that event, for the losses resulting from paying too much for the bet and selling it for too little are perceived to be positive at prices above and below. Betting behavior that leads to such losses is <italic>regrettable</italic> and should be avoided (see <xref rid="R16" ref-type="bibr">Elkin &amp; Wheeler 2018</xref> for a similar argument). In making the latter idea explicit, for all prices <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M110"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x221E;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M111"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M112"><mml:mi>i</mml:mi></mml:math></inline-formula>, let the aforementioned type of regret resulting from buying and selling a bet on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M113"><mml:mi>X</mml:mi></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M114"><mml:mi>u</mml:mi></mml:math></inline-formula> be represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M115"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M116"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, respectively, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M117"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M118"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> (in IP: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M119"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M120"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M121"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x221E;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M122"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <italic>i</italic>).<sup><xref rid="fn9" ref-type="fn">9</xref></sup></p>
<p id="P40">But how do these functions capture the kind of regret suggested? The defined regret functions can be made sensible in the following way. Assume that utility is equal to monetary payoff and all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M123"><mml:mi>i</mml:mi></mml:math></inline-formula> evaluate risky acts according to expected utility theory, or maximin expected utility theory in case of imprecise probabilities. Considering a bet on an event <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M124"><mml:mi>X</mml:mi></mml:math></inline-formula>, buying the bet for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M125"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> yields utility <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M126"><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula> if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M127"><mml:mi>X</mml:mi></mml:math></inline-formula> occurs, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M128"><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula> otherwise. The value of buying the bet, <italic>ex ante</italic>, for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M129"><mml:mi>u</mml:mi></mml:math></inline-formula> then is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M130"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mfenced><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M131"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula> in case of imprecise probabilities, as it is the minimum expected utility:
<disp-formula id="FD9">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M132">
<mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mfenced close="]" open="["><mml:mrow><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mfenced close="]" open="["><mml:mrow><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable>
</mml:math>
</disp-formula>The <italic>ex ante</italic> value of not buying the bet is, of course, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133"><mml:mn>0</mml:mn></mml:math></inline-formula>. By opting to buy the bet for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M134"><mml:mi>u</mml:mi></mml:math></inline-formula>, the <italic>ex ante</italic> regret incurred is
<disp-formula id="FD10">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M135">
<mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>value&#x00A0;of&#x00A0;not&#x00A0;buying&#x00A0;the&#x00A0;bet&#x00A0;</mml:mtext><mml:mo>&#x2212;</mml:mo><mml:mtext>&#x00A0;value&#x00A0;of&#x00A0;buying&#x00A0;the&#x00A0;bet,&#x00A0;</mml:mtext><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x00A0;</mml:mtext><mml:mfenced><mml:mrow><mml:mtext>in&#x00A0;IP:</mml:mtext><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfenced><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mtext>&#x00A0;</mml:mtext><mml:mtext>.&#x00A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable>
</mml:math>
</disp-formula></p>
<p id="P42">On the other side, selling the bet for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M136"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> yields utility <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M137"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M138"><mml:mi>X</mml:mi></mml:math></inline-formula> occurs, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M139"><mml:mi>u</mml:mi></mml:math></inline-formula> otherwise. The value of selling the bet, <italic>ex ante</italic>, for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M140"><mml:mi>u</mml:mi></mml:math></inline-formula> then is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mfenced><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M142"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> in case of imprecise probabilities, as it is the minimum expected utility:
<disp-formula id="FD11">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M143">
<mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mfenced close="]" open="["><mml:mrow><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo stretchy='false'>[</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>]</mml:mo><mml:mo>=</mml:mo><mml:mi>u</mml:mi><mml:mo>+</mml:mo><mml:mi>inf</mml:mi><mml:mfenced><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>sup</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable>
</mml:math>
</disp-formula>The <italic>ex ante</italic> value of not selling the bet is, of course, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M144"><mml:mn>0</mml:mn></mml:math></inline-formula>. By opting to sell the bet for a price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M145"><mml:mi>u</mml:mi></mml:math></inline-formula>, the <italic>ex ante</italic> regret incurred is
<disp-formula id="FD12">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M146">
<mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>value&#x00A0;of&#x00A0;not&#x00A0;selling&#x00A0;the&#x00A0;bet&#x00A0;</mml:mtext><mml:mo>&#x2212;</mml:mo><mml:mtext>&#x00A0;value&#x00A0;of&#x00A0;selling&#x00A0;the&#x00A0;bet,&#x00A0;</mml:mtext><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfenced><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mfenced close=")" open=""><mml:mrow><mml:mfenced><mml:mrow><mml:mtext>in&#x00A0;IP:</mml:mtext><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfenced><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mtext>.</mml:mtext></mml:mtd></mml:mtr></mml:mtable>
</mml:math>
</disp-formula></p>
<p id="P44">It should be clear at this point how the defined regret functions capture the (<italic>ex ante</italic>) regrettable losses from buying a bet for a price above one&#x2019;s maximum buying price and selling the bet for a price below one&#x2019;s minimum selling price.<sup><xref rid="fn10" ref-type="fn">10</xref></sup></p>
<p id="P45">Suppose now that in addition to having a preference for not making bets that are regretted, <italic>ex ante</italic>, by oneself, the individuals similarly have a preference for the group not making bets that are regretted, <italic>ex ante</italic>.<sup><xref rid="fn11" ref-type="fn">11</xref></sup> To satisfy the latter preference for all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M147"><mml:mi>i</mml:mi></mml:math></inline-formula>, the pooling function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M148"><mml:mi>F</mml:mi></mml:math></inline-formula> (or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mi>&#x2131;</mml:mi></mml:math></inline-formula>) adopted should yield collective opinions such that no member regrets the group buying a bet on an event <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M150"><mml:mi>X</mml:mi></mml:math></inline-formula> at the group&#x2019;s maximum buying price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M151"><mml:mrow><mml:mi>F</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>min</mml:mi><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and selling the bet at the group&#x2019;s minimum selling price <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M152"><mml:mrow><mml:mi>F</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mi>F</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> (in IP: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M153"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>inf</mml:mi><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M154"><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>sup</mml:mi><mml:mi>&#x2131;</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>). Put precisely,</p>
<disp-quote id="Q2">
<p id="P46">(<bold>v</bold>) No Regrets. For all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M155"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M156"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M157"><mml:mi>i</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M158"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:mi>F</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M159"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:mi>F</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> (in IP: for all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M161"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M162"><mml:mi>i</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M163"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M164"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:mi>&#x2131;</mml:mi><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>).</p>
</disp-quote>
<p id="P47">The pragmatic criterion for pooling functions is seemingly intuitive, especially under the assumption that the individuals have a preference for the group not making bets that are regretted, <italic>ex ante</italic>. But even so, some might worry that satisfying the criterion will sometimes lead to abstaining from betting, and abstaining may cause group members to regret not betting. However, a regret of not betting will only manifest <italic>ex post</italic> due to thinking about what could have been obtained after learning an outcome that would have settled a bet the group considered making. That regret is different in kind, though, for it is not realized by any individual&#x2019;s regret functions, as defined above, and must be distinct from the regret that is of concern. With a focus on the specified <italic>ex ante</italic> regret only, the pragmatic criterion for pooling functions should come across as feasible.</p>
</sec>
<sec id="S9">
<label>2.3.</label><title>Some Observations</title>
<p id="P48">I have so far introduced a few desirable criteria for pooling functions. Any pooling function satisfying the criteria should be considered plausible based on the epistemic and practical features inherited. With a concern only for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M165"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M166"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, let us see which of the criteria each meets.</p>
<disp-quote id="Q3">
<p id="P49"><italic>Observation 1</italic>. The linear pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M167"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M168"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> satisfies (<bold>i</bold>) Unanimity and (<bold>ii</bold>) Eventwise Independence.</p>
<p id="P50"><italic>Observation 1.1</italic>. The agglomerative pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M169"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M170"><mml:mrow><mml:msup><mml:mi>&#x1D49F;</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> satisfies (<bold>i</bold>) Unanimity.</p>
</disp-quote>
<p id="P51"><xref rid="R1" ref-type="bibr">Acz&#x00E9;l and Wagner (1980)</xref> and <xref rid="R44" ref-type="bibr">McConway (1981)</xref> proved that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M171"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>i</bold>) and (<bold>ii</bold>). As for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M172"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M173"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M174"><mml:mi>i</mml:mi></mml:math></inline-formula>, are identical, conv <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M175"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Thus, the pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M176"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, satisfies (<bold>i</bold>) Unanimity. While I do not have a proof showing that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M177"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>ii</bold>) Eventwise Independence, <xref rid="R58" ref-type="bibr">Stewart and Quintana (2018)</xref> proved that a (convex) agglomerative pooling function satisfies the criterion (see Proposition 2). Their result can be extended to our setting, but I leave that to the reader.</p>
<p id="P52">At this point, it appears that linear pooling and opinion agglomeration are both plausible strategies for aggregating opinions based on the above observations. But what about the other criteria?</p>
<disp-quote id="Q4">
<p id="P53"><italic>Observation 2</italic>. The linear pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M178"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M179"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> satisfies (<bold>iii</bold>) Boundedness.</p>
<p id="P54"><italic>Observation 2.1</italic>. The agglomerative pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M180"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M181"><mml:mrow><mml:msup><mml:mi>&#x1D49F;</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> satisfies (<bold>iii</bold>) Boundedness and (<bold>iv</bold>) Non-Dictatorship.</p>
</disp-quote>
<p id="P55">(<bold>iii</bold>) Boundedness is a necessary property of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M182"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> since any weighted average yielded by the function is in the closed interval <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M183"><mml:mrow><mml:mfenced close="]" open="["><mml:mrow><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:mi>max</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, which is the set of all weighted averages of opinions, for all opinion profiles in the domain and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M184"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>. (<bold>iii</bold>) Boundedness is a necessary property of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M185"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> since any output of the function is a subset of the closed interval <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M186"><mml:mrow><mml:mfenced close="]" open="["><mml:mrow><mml:mi>inf</mml:mi><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mi>sup</mml:mi><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> by definition, for all opinion profiles in the domain and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M187"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>. Furthermore, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M188"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>iv</bold>) Non-Dictatorship since every individual&#x2019;s opinion is contained in the output of the function. That is, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M189"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, for all opinion profiles in the domain, individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M190"><mml:mi>i</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M191"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>. Whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M192"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>iv</bold>) Non-Dictatorship depends on the weights assigned to individuals. In case some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M193"><mml:mi>i</mml:mi></mml:math></inline-formula> is given weight <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M194"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M195"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is dictatorial. Otherwise, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M196"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M197"><mml:mi>i</mml:mi></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M198"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>iv</bold>) Non-Dictatorship. It may be stipulated then that no individual is given maximum weight to prevent pooling by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M199"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> from collapsing into a dictatorship.<sup><xref rid="fn12" ref-type="fn">12</xref></sup></p>
<p id="P56">With the added stipulation, both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M200"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M201"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> again appear to be plausible aggregation strategies. So now, we only have one criterion left to consider, and the one that interests me the most in this paper.</p>
<disp-quote id="Q5">
<p id="P57"><italic>Observation 3</italic>. The linear pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M202"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M203"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> violates (<bold>v</bold>) No Regrets.</p>
<p id="P58"><italic>Observation 3.1</italic> The agglomerative pooling function, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M204"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with domain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M205"><mml:mrow><mml:msup><mml:mi>&#x1D49F;</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> satisfies (<bold>v</bold>) No Regrets.</p>
</disp-quote>
<p id="P59">Observation 3 is easy to see. Suppose that for some <italic>non-unanimous</italic> opinion profile in the domain and event <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M206"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M207"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, but there is at least one <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M208"><mml:mi>j</mml:mi></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M209"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M210"><mml:mrow><mml:mi>y</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mfenced close="]" open="["><mml:mrow><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mi>max</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M211"><mml:mrow><mml:mi>y</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. Then, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M212"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:mfenced><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M213"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M214"><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x221E;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M215"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>r</mml:mi><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mfenced><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Therefore, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M216"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> violates (<bold>v</bold>) No Regrets.</p>
<p id="P60">Observation 3.1 is also easy to see. For all admissible opinion profiles and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M217"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M218"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>inf</mml:mi><mml:mi mathvariant="normal">conv</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M219"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant="normal">supconv</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> by definition provided that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M220"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant="normal">conv</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. Given the collective betting prices associated with the pooling function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M221"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, it follows that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M222"><mml:mrow><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M223"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>&#x2264;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M224"><mml:mrow><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M225"><mml:mrow><mml:mfenced><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>&#x2264;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, for all admissible profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M226"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M227"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <italic>i</italic>. Therefore, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M228"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfies (<bold>v</bold>) No Regrets.</p>
<p id="P61">Observation 3 does not bode well for linear pooling. Those who favor it, however, might suggest weakening the No Regrets criterion by requiring instead that the <italic>ex ante</italic> regret is zero for <italic>at least</italic> one transaction type for all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M229"><mml:mi>i</mml:mi></mml:math></inline-formula>. Weakening the requirement may not only be an easy fix for linear pooling, but weakening could also be justified on the grounds that some might care more about avoiding buyer&#x2019;s remorse and consequently value zero <italic>ex ante</italic> regret with respect to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M230"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> more than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M231"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> (or <italic>vice versa</italic> if loss averse). Unfortunately, weakening No Regrets in the way described leads to another problem for linear pooling.</p>
<disp-quote id="Q6">
<p id="P62"><italic>Observation 4</italic>. For all admissible opinion profiles <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M232"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M233"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x1D49C;</mml:mi></mml:mrow></mml:math></inline-formula>, and individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M234"><mml:mi>i</mml:mi></mml:math></inline-formula>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M235"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2260;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M236"><mml:mi>j</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M237"><mml:mi>k</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M238"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M239"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M240"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M241"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> violates (<bold>iv</bold>) Non-Dictatorship.</p>
</disp-quote>
<p id="P63">Suppose that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M242"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2260;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M243"><mml:mi>j</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M244"><mml:mi>k</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M245"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M246"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M247"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> for all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M248"><mml:mi>i</mml:mi></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M249"><mml:mi>x</mml:mi></mml:math></inline-formula> is in the open interval <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M250"><mml:mrow><mml:mfenced><mml:mrow><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:mi>max</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. But because <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M251"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2212;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M252"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M253"><mml:mi>i</mml:mi></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M254"><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, which is not contained in (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M255"><mml:mrow><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M256"><mml:mrow><mml:mi>max</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. So it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M257"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> for all individuals <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M258"><mml:mi>i</mml:mi></mml:math></inline-formula>, and there must be some individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M259"><mml:mi>i</mml:mi></mml:math></inline-formula> whose opinion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M260"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> realizes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M261"><mml:mrow><mml:mi>min</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and is given weight <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M262"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, but then, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M263"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> violates (<bold>iv</bold>) Non-Dictatorship. Similarly, one can follow this chain of reasoning with the assumption that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M264"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> instead and arrive at the same conclusion. Furthermore, it is not clear that weakening No Regrets is a feasible fix. Notice that, under the above conditions, eliminating the perceived group loss on one side can significantly increase the perceived group loss on the other side from the viewpoints of some individuals when pooling by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M265"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p id="P64">In summary, linear pooling fails to satisfy all the desirable criteria (<bold>i</bold>)&#x2013;(<bold>v</bold>), whereas opinion agglomeration satisfies all five. Note, however, that linear pooling satisfies (<bold>i</bold>)&#x2013;(<bold>v</bold>) if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M266"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> is <italic>unanimous</italic>, but in such instances, pooling is not of much interest since it would be trivial. As it turns out then, opinion agglomeration is the more plausible aggregation strategy of the two.</p>
</sec>
</sec>
<sec id="S10">
<label>3.</label><title>Justifying the Behavioral Criterion</title>
<p id="P65">Some might think that the reason I introduced No Regrets is to strategically undermine linear pooling. In this section, I will offer justification for the criterion, showing that it is indeed a reasonable constraint normatively and empirically to impose on opinion aggregation.</p>
<sec id="S11">
<label>3.1</label><title>Regret as an Emotion and Its Avoidance</title>
<p id="P66">There has been much talk about regret in this paper, but what is it? In short, regret is considered a negative emotion in response to counterfactual reasoning about a fault in personal action (<xref rid="R50" ref-type="bibr">Roese &amp; Summerville 2005</xref>), or simply, <italic>counterfactual emotion</italic> (<xref rid="R31" ref-type="bibr">Kahneman &amp; Miller 1986</xref>). Described in more depth, <xref rid="R70" ref-type="bibr">Zeelenberg (1999)</xref> offers the following account.</p>
<disp-quote id="Q7">
<p id="P67">Regret is a cognitive emotion: it is an emotion that needs cognition to be experienced and that may produce cognitions as well. In order to <italic>feel</italic> regret one has to <italic>think</italic>. One has to think about one&#x2019;s choices and the outcomes generated by these choices, but one also has to think about what other outcomes might have been obtained by making a different choice. Thus, regret is typically felt in response to decisions that produce unfavorable outcomes compared to the outcomes that the rejected option would have produced. (1999: 327)</p>
</disp-quote>
<p id="P68">To give an example of a regrettable decision, consider the following.</p>
<disp-quote id="Q8">
<p id="P69"><italic>Lemon or Peach</italic>. You intend to purchase a used car today. You visit a local car dealership, hoping to leave with a vehicle. There, you find an attractive, used, mid-sized sedan priced at the top of your budget. You are familiar with the model, but you are uncertain whether it is of low quality, a lemon, or of high quality, a peach, in its used condition. You ultimately decide to buy the car and drive away a happy customer. But your happiness is short-lived, for when you arrive home, your neighbor, who is a professional mechanic, inspects the car and discovers a major fault with the engine. He says, &#x201C;This vehicle will not pass a certified inspection and cannot be driven on public roads.&#x201D; Disappointment hits you, as you have come to learn that the car is a lemon.</p>
</disp-quote>
<p id="P70">Your troubles in the given scenario begin with an asymmetry in information.<sup><xref rid="fn13" ref-type="fn">13</xref></sup> As the buyer, you are uncertain whether the used car is a lemon or a peach, but the dealer knows which it is, and of course, will not reveal if it is a lemon. Despite the information asymmetry, you buy the car, but later learn that it is a lemon. Thinking about how the dealer successfully swindled the maximum from you for a vehicle they knew to be worth very little, you realize that it would have been wise to pass on it instead. That realization and accompanying emotional pain is your regret. While fictitious, the example mirrors countless experiences of consumer regret, which is a common side-effect of acting under uncertainty, and something that rational individuals should generally seek to avoid.</p>
<p id="P71">The <italic>Lemon or Peach</italic> case was introduced for the purpose of generating thoughts about what it is like to be in a distressing state of regret after a decision has been made and the true state of the world is learned, but to reiterate, the No Regrets criterion concerns <italic>ex ante</italic> regret. Since the latter kind of regret is thought about less often, though, some might wonder what can cause it. Consider, for example, the collective behavior in a variation of <italic>Lemon or Peach</italic>.</p>
<disp-quote id="Q9">
<p id="P72"><italic>Lemon or Peach&#x2013;Group</italic>. You and your partner intend to purchase a used car today with a maximum budget of $10,000. You go together to a local car dealership, hoping to find a vehicle. There, an attractive, used, midsized sedan priced at $10,000 catches your attention. You and your partner are both familiar with the model but are uncertain of what it is worth in its used condition. You say, &#x201C;I think it is worth the asking price, so we should buy it.&#x201D; Your partner, however, says, &#x201C;I think that it is worth no more than $6,000.&#x201D; In light of this dispute, you suggest compromising and offering the dealer $8,000. Your partner is still reluctant to believe that the car is worth more than $6,000, but they agree, <italic>regretfully</italic>, to making the bid for the sake of compromising. The dealer accepts, and you jointly purchase the car. When you arrive home, your neighbor, who is a car appraiser at a prestigious appraisal firm, yells over at the two of you in a sarcastic tone, &#x201C;How much did you pay for that thing?&#x201D; You both reply, &#x201C;$8,000.&#x201D; She replies, &#x201C;In that condition, the car is worth at most $6,000!&#x201D;</p>
</disp-quote>
<p id="P73">A notable difference here from the first case, aside from an individual/group disparity, is that an additional state of regret is experienced, which occurs before learning the actual value of the car. The bid itself was immediately regretted by your partner. That regret is thus <italic>ex ante</italic> rather than <italic>ex post</italic>.</p>
<p id="P74">A lesson that can be drawn from the second case, and that further supports a principle like No Regrets, is that if you had heeded the warning of your partner, the two of you may have avoided the distress later felt. Put another way, had the two of you compromised in a fashion such that neither of you regretted the group&#x2019;s bidding price, the group would have decided differently, resulting in less grief. So the No Regrets criterion is not only justified on the basis of preventing group members from experiencing the unwanted emotion, <italic>ex ante</italic>, but also on the grounds that it can be instrumental in preventing group members from experiencing regret, <italic>ex post</italic>. For an expressed <italic>ex ante</italic> regret by a group member forewarns of an <italic>ex post</italic> regret that is still to come, just as in the second case.</p>
</sec>
<sec id="S12">
<label>3.2.</label><title>Aversion to Making Bad Deals: Experimental Evidence</title>
<p id="P75">It is widely known that the judgments and decisions of actual, not idealized, individuals often deviate from those predicted by expected utility theory. When endowed with a good, for instance, an average person will likely be reluctant to sell the good for the same price that they would buy it, giving rise to the so-called <italic>endowment effect</italic> (<xref rid="R62" ref-type="bibr">Thaler 1980</xref>). <xref rid="R63" ref-type="bibr">Tversky and Kahneman&#x2019;s (1991)</xref> explanation for why the endowment effect arises is that utility is reference-dependent, exchanging a possession for a modest gain is viewed as a loss relative to an individual&#x2019;s reference point, and individuals are averse to losses.</p>
<p id="P76">For decades, many behavioral economists have attributed the endowment effect to an aversion to losing possessions. However, recent evidence casts doubt on the view that loss aversion is the only plausible explanation for a gap between &#x2018;willingness to pay&#x2019; and &#x2018;willingness to accept&#x2019;. <xref rid="R68" ref-type="bibr">Weaver and Frederick (2012)</xref> hypothesized that a difference between buying and selling prices for a good is sometimes a result of an aversion to making bad deals. They predicted that by manipulating a subject&#x2019;s reference price for a good, &#x2018;willingness to pay&#x2019; would largely differ from &#x2018;willingness to accept&#x2019;. If the prediction is true, then the endowment effect is a consequence of an aversion to making bad deals as opposed to an aversion to losing the good, for the relevant factor is the reference price, not the good itself. The results of their experiments confirmed the prediction.</p>
<p id="P77">In their first experiment, for example, participants were presented with four different kinds of candy typically sold at movie theaters and asked to indicate their favorite. Participants were either endowed or not endowed with their choice and assigned to a high or moderate reference price condition. In the high condition, participants were informed that their chosen box of candy sells for $4.00 at the Harvard Square Theater (near Harvard University). In the moderate condition, participants were told that the box of candy sells for $1.49 at a local Target retail store. The experimenters then elicited the maximum buying and minimum selling prices from participants following the <xref rid="R4" ref-type="bibr">Becker, DeGroot, and Marschak (1964)</xref> method. They found in the high condition a significant difference in prices <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M267"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x0024;</mml:mi><mml:mn>2.88</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x2004;</mml:mtext><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x0024;</mml:mi><mml:mn>1.54</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> (<xref rid="R68" ref-type="bibr">Weaver &amp; Frederick 2012</xref>: 698). Although these results only illustrate a higher average selling price upon inflating participants&#x2019; reference prices, I refer the reader to the results of Experiments 3a and 3b, which confirm a lower average buying price upon depressing participants&#x2019; reference prices.</p>
<p id="P78">What can we make of these experimental results? A first observation is that individuals appear to be keen on avoiding <italic>ex ante</italic> regret when transacting due to an aversion to making bad deals. Whether groups exhibit similar behavior is an open question, but the No Regrets criterion is at least empirically tenable, as it quantifies over individuals in a group. A second observation is that individuals appear to be inclined to revise their judgments after receiving information that shifts their reference prices, raising the question: will individuals form imprecise opinions after learning the opinions of other group members due to an aversion to making bad betting deals? Although I am unable to pursue the question in this paper, the empirical results discussed have interesting implications for a behavioral theory of individual and group opinions and pave the way for future work.</p>
</sec>
</sec>
<sec id="S13">
<label>4.</label><title>Conclusion</title>
<p id="P79">In summary, I showed that opinion agglomeration fares better than linear pooling in satisfying the desirable criteria laid out in <xref rid="S6" ref-type="sec">Section 2</xref>. Trouble for linear pooling surfaced when considering the pragmatic criterion, No Regrets, since aside from pooling a unanimous opinion profile, linear pooling fails to satisfy it. Even under a weakened version, linear pooling was shown to be no better off, as it then violates the Non-Dictatorship criterion. After presenting the formal results, I proceeded to give normative and empirical arguments in support of the pragmatic criterion for opinion aggregation, and that ultimately favor opinion agglomeration.</p>
</sec>
</body>
<back>
<ack id="S14">
<title>Acknowledgments</title>
<p id="P80">I owe many thanks to Stephan Hartmann, Richard Pettigrew, Tomasz &#x017B;uradzki, Mika&#x00EB;l Cozic, Ophelia Deroy, Bahador Bahrami, and two anonymous referees for their valuable comments that tremendously improved the ideas in this paper. I would also like to thank audiences at Jagiellonian University in Krak&#x00F3;w, Ludwig Maximilians Universit&#x00E4;t M&#x00FC;nchen, Tilburg University, and the &#x201C;Reasoning in Social Context&#x201D; colloquium at The Royal Netherlands Academy of Arts and Sciences. The research for this article was generously supported by the Agence Nationale de la Recherche (ANR) (grant No. ANR-16-FRAL-0010), the European Research Council (ERC) under the European Union&#x2019;s Horizon 2020 research and innovation programme (grant No. 805498), and the NOMIS Foundation (project &#x201C;Diversity in Social Environments&#x201D;).</p>
</ack>
<fn-group>
<fn id="fn1"><label>1.</label><p id="P81">The difference between a consensus and a compromise is that the former requires individuals to continuously deliberate and revise their opinions until they reach an agreement, whereas the latter requires individuals to find common ground for collective decision-making purposes, but without necessarily changing their opinions (see <xref rid="R65" ref-type="bibr">Wagner 2009</xref>; <xref rid="R46" ref-type="bibr">Moss 2011</xref>).</p></fn>
<fn id="fn2"><label>2.</label><p id="P82">Note that the result depends on further assumptions. See Theorem 2 in <xref rid="R10" ref-type="bibr">DeGroot (1974)</xref>.</p></fn>
<fn id="fn3"><label>3.</label><p id="P83">Galton remained committed to his preference for the median, despite confirming that the arithmetic mean turned out to be a more accurate estimate.</p></fn>
<fn id="fn4"><label>4.</label><p id="P84">Note that &#x2018;imprecise probability&#x2019; is conventionally used as an umbrella term that not only covers sets of probability functions, but also belief functions (<xref rid="R56" ref-type="bibr">Shafer 1976</xref>), Choquet capacities (<xref rid="R67" ref-type="bibr">Wasserman &amp; Kadane 1990</xref>), possibility measures (<xref rid="R13" ref-type="bibr">Dubois &amp; Prade 1988</xref>), lower previsions (<xref rid="R66" ref-type="bibr">Walley 1991</xref>), and sets of desirable gambles (<xref rid="R66" ref-type="bibr">Walley 1991</xref>; <xref rid="R8" ref-type="bibr">Couso &amp; Moral 2009</xref>). Although sets of probability functions are not the most general, they subsume belief functions and possibility measures and thus are not the least general. The reason for choosing sets of probability functions here, however, is merely to follow the recent trend in epistemology (see <xref rid="R5" ref-type="bibr">Bradley 2019</xref> for a survey on IP in philosophy).</p></fn>
<fn id="fn5"><label>5.</label><p id="P85"><xref rid="R58" ref-type="bibr">Stewart and Quintana (2018)</xref> suggest a rule along these lines as a way of generalizing the IP pooling rule they focus on in their paper: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M268"><mml:mrow><mml:mi mathvariant="normal">conv</mml:mi><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn6"><label>6.</label><p id="P86">Of course, ambiguity aversion is not the only reason for adopting imprecise probabilities. Other considerations include accommodating suspension of judgment in probabilistic models (see, e.g., <xref rid="R40" ref-type="bibr">Levi 1983</xref>; <xref rid="R60" ref-type="bibr">Sturgeon 2010</xref>), respecting evidence (see, e.g., <xref rid="R29" ref-type="bibr">Joyce, 2005</xref>, <xref rid="R30" ref-type="bibr">2010</xref>; <xref rid="R54" ref-type="bibr">Schoenfield 2012</xref>; <xref rid="R34" ref-type="bibr">Konek in press</xref>), and vague credence (see, e.g., <xref rid="R42" ref-type="bibr">Lyon 2017</xref>). For comprehensive surveys on various applications of imprecise probability, see <xref rid="R3" ref-type="bibr">Augustin, Coolen, De Cooman, and Troffaes (2014)</xref> and <xref rid="R5" ref-type="bibr">Bradley (2019)</xref>.</p></fn>
<fn id="fn7"><label>7.</label><p id="P87"><xref rid="R14" ref-type="bibr">Easwaran, Fenton-Glynn, Hitchcock, and Velasco (2016)</xref> defend a family of updating rules with a property they call <italic>synergy</italic>, resulting in opinions outside of the ranges of peer opinions. However, they make it clear that they are only concerned with individuals updating their own opinions, not opinion aggregation, but <xref rid="R51" ref-type="bibr">Russell, Hawthorne, and Buchak (2015)</xref> and <xref rid="R11" ref-type="bibr">Dietrich (2019)</xref> take up the group-level problem and defend an alternative pooling strategy, namely, geometric averaging that also has the synergistic property. In addition to synergy, the geometric approach is <italic>externally Bayesian</italic>, meaning that pooling and conditionalization commute. I bring these points to the reader&#x2019;s attention to show that Boundedness is not entirely uncontroversial, as it precludes geometric and multiplicative pooling, both of which have some valuable properties. But in defense of Boundedness, <xref rid="R49" ref-type="bibr">Pettigrew (2019)</xref> shows that any aggregation strategy violating the criterion is strictly worse in terms of accuracy than an aggregation strategy satisfying it from the perspective of each individual. Thus, aggregation strategies that satisfy the criterion yield more epistemic value than those that violate it (though, only in case of precise probabilities).</p></fn>
<fn id="fn8"><label>8.</label><p id="P88">The concept of regret is not new to decision theory. <xref rid="R52" ref-type="bibr">Savage (1951)</xref> notably proposed the <italic>minimax regret</italic> decision criterion, and <xref rid="R41" ref-type="bibr">Loomes and Sugden (1982)</xref> exploited the notion in their influential theory of regret-based preferences as an alternative to expected utility theory.</p></fn>
<fn id="fn9"><label>9.</label><p id="P89">The regret functions, properly defined, take prices, events, and opinions as arguments, but I will abuse notation by writing the functions as done above for simplicity.</p></fn>
<fn id="fn10"><label>10.</label><p id="P90">I owe many thanks to an anonymous referee for their valuable suggestions on justifying the functional forms of the regret functions.</p></fn>
<fn id="fn11"><label>11.</label><p id="P91">Under this assumption, the individuals have a common interest in preventing the group from losing money, but that commonality does not mean that they completely identify with the group, for they might differ in opinion. Thus, it is supposed that the individuals have a common interest, but may hold conflicting opinions. In many economic models, though, the opposite is typically assumed&#x2014;opinions are homogenous, but values are heterogeneous. While some might question the move against convention, it is quite sensible in situations where opinions diverge, but group members are all held accountable for any collective decisions made, e.g., policymaking. Thanks to an anonymous referee for suggesting that I flag this subtle but important point.</p></fn>
<fn id="fn12"><label>12.</label><p id="P92">Although the pooling functions <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M269"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M270"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can satisfy the usual criteria, there is one that both violate, namely, Probabilistic Independence. <xref rid="R36" ref-type="bibr">Laddaga (1977)</xref> highlighted that an agreement about the independence of events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M271"><mml:mi>X</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M272"><mml:mi>Y</mml:mi></mml:math></inline-formula> is not preserved by taking any non-extreme weighted average of opinions as a group&#x2019;s opinion, and <xref rid="R38" ref-type="bibr">Lehrer and Wagner (1983)</xref> observed that only dictatorial linear pooling functions satisfy Probabilistic Independence. Thus, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M273"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> violates Probabilistic Independence when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M274"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> for all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M275"><mml:mi>i</mml:mi></mml:math></inline-formula>. But in defense of non-dictatorial linear pooling, Lehrer and Wagner contend that individuals and groups may have very little concern for newly established probabilistic correlations between events since such dependencies are often artificial, resulting from the formal machinery. However, others have pointed out that the practical consequences are not negligible (see, e.g., <xref rid="R35" ref-type="bibr">Kyburg &amp; Pittarelli 1996</xref>; <xref rid="R55" ref-type="bibr">Seidenfeld, Schervish, &amp; Kadane 2010</xref>; <xref rid="R16" ref-type="bibr">Elkin &amp; Wheeler 2018</xref>). As for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M276"><mml:mrow><mml:msub><mml:mi>&#x2131;</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the resulting set-based opinions contain all convex combinations, so there is some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M277"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">conv</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M278"><mml:mrow><mml:mi>p</mml:mi><mml:mfenced><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2223;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:mfenced><mml:mo>&#x2260;</mml:mo><mml:mi>p</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> for some admissible opinion profile and events <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M279"><mml:mi>X</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M280a"><mml:mi>Y</mml:mi></mml:math></inline-formula>. The reader should note, though, that independence is more complex in IP (see, e.g., <xref rid="R9" ref-type="bibr">Cozman 2012</xref>; <xref rid="R48" ref-type="bibr">Pedersen &amp; Wheeler 2014</xref>).</p></fn>
<fn id="fn13"><label>13.</label><p id="P93">The <italic>Lemon or Peach</italic> case is inspired by the main example of <xref rid="R2" ref-type="bibr">George Akerlof&#x2019;s (1970)</xref> seminal paper, &#x201C;The Market for Lemons: Quality, Uncertainty, and the Market Mechanism.&#x201D;</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="R1"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Acz&#x00E9;l</surname>, <given-names>J&#x00E1;nos</given-names></string-name> and <string-name><surname>Wagner</surname>, <given-names>Carl</given-names></string-name></person-group> (<year>1980</year>). <article-title>A Characterization of Weighted Arithmetic Means.</article-title> <source>SIAM Journal on Algebraic Discrete Methods</source>, <volume>1</volume>(<issue>3</issue>), <fpage>259</fpage>&#x2013;<lpage>60</lpage>.</mixed-citation></ref>
<ref id="R2"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akerlof</surname>, <given-names>George A.</given-names></string-name></person-group> (<year>1970</year>). <article-title>The Market for &#x201C;Lemons&#x201D;: Quality, Uncertainty, and the Market Mechanism.</article-title> <source>The Quarterly Journal of Economics</source>, <volume>84</volume>(<issue>3</issue>), <fpage>488</fpage>&#x2013;<lpage>500</lpage>.</mixed-citation></ref>
<ref id="R3"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Augustin</surname>, <given-names>Thomas</given-names></string-name>, <string-name><surname>Coolen</surname>, <given-names>Frank P. A.</given-names></string-name>, <string-name><surname>De Cooman</surname>, <given-names>Gert</given-names></string-name>, and <string-name><surname>Troffaes</surname>, <given-names>Matthias C. M.</given-names></string-name></person-group> (<year>2014</year>). <source>Introduction to Imprecise Probabilities.</source> <publisher-name>John Wiley and Sons</publisher-name>.</mixed-citation></ref>
<ref id="R4"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Becker</surname>, <given-names>Gordon M.</given-names></string-name>, <string-name><surname>DeGroot</surname>, <given-names>Morris H.</given-names></string-name>, and <string-name><surname>Marschak</surname>, <given-names>Jacob</given-names></string-name></person-group> (<year>1964</year>). <article-title>Measuring Utility by a Single-Response Sequential Method.</article-title> <source>Behavioral Science</source>, <volume>9</volume>(<issue>3</issue>), <fpage>226</fpage>&#x2013;<lpage>32</lpage>.</mixed-citation></ref>
<ref id="R5"><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Bradley</surname>, <given-names>Seamus</given-names></string-name></person-group> (<year>2019</year>). <chapter-title>Imprecise Probabilities.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Zalta</surname>, <given-names>Edward N.</given-names></string-name></person-group> (Ed.), <source>The Stanford Encyclopedia of Philosophy.</source> <comment>Retrieved from <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://plato.stanford.edu/entries/imprecise-probabilities" xlink:type="simple">https://plato.stanford.edu/entries/imprecise-probabilities</ext-link></comment></mixed-citation></ref>
<ref id="R6"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Christensen</surname>, <given-names>David</given-names></string-name></person-group> (<year>2007</year>). <article-title>Epistemology of Disagreement: The Good News.</article-title> <source>The Philosophical Review</source>, <volume>116</volume>(<issue>2</issue>), <fpage>187</fpage>&#x2013;<lpage>218</lpage>.</mixed-citation></ref>
<ref id="R7"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Christensen</surname>, <given-names>David</given-names></string-name></person-group> (<year>2011</year>). <article-title>Disagreement, Question-begging, and Epistemic Self-Criticism.</article-title> <source>Philosophers&#x2019; Imprint</source>, <volume>11</volume>(<issue>6</issue>), <fpage>1</fpage>&#x2013;<lpage>22</lpage>.</mixed-citation></ref>
<ref id="R8"><mixed-citation publication-type="confproc"><person-group person-group-type="author"><string-name><surname>Couso</surname>, <given-names>In&#x00E9;s</given-names></string-name> and <string-name><surname>Moral</surname>, <given-names>Seraf&#x00ED;n</given-names></string-name></person-group> (<year>2009</year>). <source>Sets of Desirable Gambles and Credal Sets.</source> In <conf-name>Proceedings of the 6th International Symposium on Imprecise Probability: Theories and Applications</conf-name> (<fpage>99</fpage>&#x2013;<lpage>108</lpage>).</mixed-citation></ref>
<ref id="R9"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cozman</surname>, <given-names>Fabio G.</given-names></string-name></person-group> (<year>2012</year>). <article-title>Sets of Probability Distributions, Independence, and Convexity.</article-title> <source>Synthese</source>, <volume>186</volume>(<issue>2</issue>), <fpage>577</fpage>&#x2013;<lpage>600</lpage>.</mixed-citation></ref>
<ref id="R10"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>DeGroot</surname>, <given-names>Morris H.</given-names></string-name></person-group> (<year>1974</year>). <article-title>Reaching a Consensus.</article-title> <source>Journal of the American Statistical Association</source>, <volume>69</volume>(<issue>345</issue>), <fpage>118</fpage>&#x2013;<lpage>21</lpage>.</mixed-citation></ref>
<ref id="R11"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dietrich</surname>, <given-names>Franz</given-names></string-name></person-group> (<year>2019</year>). <article-title>A Theory of Bayesian Groups.</article-title> <source>No&#x00FB;s</source>, <volume>53</volume>(<issue>3</issue>), <fpage>708</fpage>&#x2013;<lpage>36</lpage>.</mixed-citation></ref>
<ref id="R12"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Dietrich</surname>, <given-names>Franz</given-names></string-name> and <string-name><surname>List</surname>, <given-names>Christian</given-names></string-name></person-group> (<year>2016</year>). <chapter-title>Probabilistic Opinion Pooling.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>H&#x00E1;jek</surname>, <given-names>Alan</given-names></string-name> and <string-name><surname>Hitchcock</surname>, <given-names>Christopher</given-names></string-name></person-group> (Eds.), <source>The Oxford Handbook of Philosophy and Probability</source> (<fpage>519</fpage>&#x2013;<lpage>44</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R13"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Dubois</surname>, <given-names>Didier</given-names></string-name> and <string-name><surname>Prade</surname>, <given-names>Henri</given-names></string-name></person-group> (<year>1988</year>). <source>Possibility Theory: An Approach to Computerized Processing of Uncertainty.</source> <publisher-name>Plenum</publisher-name>.</mixed-citation></ref>
<ref id="R14"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Easwaran</surname>, <given-names>Kenny</given-names></string-name>, <string-name><surname>Fenton-Glynn</surname>, <given-names>Luke</given-names></string-name>, <string-name><surname>Hitchcock</surname>, <given-names>Christopher</given-names></string-name>, and <string-name><surname>Velasco</surname>, <given-names>Joel D.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Updating on the Credences of Others: Disagreement, Agreement, and Synergy.</article-title> <source>Philosophers&#x2019; Imprint</source>, <volume>16</volume>(<issue>11</issue>), <fpage>1</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="R15"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Elga</surname>, <given-names>Adam</given-names></string-name></person-group> (<year>2007</year>). <article-title>Reflection and Disagreement.</article-title> <source>No&#x00FB;s</source>, <volume>41</volume>(<issue>3</issue>), <fpage>478</fpage>&#x2013;<lpage>502</lpage>.</mixed-citation></ref>
<ref id="R16"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Elkin</surname>, <given-names>Lee</given-names></string-name> and <string-name><surname>Wheeler</surname>, <given-names>Gregory</given-names></string-name></person-group> (<year>2018</year>). <article-title>Resolving Peer Disagreements through Imprecise Probabilities.</article-title> <source>No&#x00FB;s</source>, <volume>52</volume>(<issue>2</issue>), <fpage>260</fpage>&#x2013;<lpage>78</lpage>.</mixed-citation></ref>
<ref id="R17"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ellsberg</surname>, <given-names>Daniel</given-names></string-name></person-group> (<year>1961</year>). <article-title>Risk, Ambiguity, and the Savage Axioms.</article-title> <source>The Quarterly Journal of Economics</source>, <volume>75</volume>(<issue>4</issue>), <fpage>643</fpage>&#x2013;<lpage>69</lpage>.</mixed-citation></ref>
<ref id="R18"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feldman</surname>, <given-names>Richard</given-names></string-name></person-group> (<year>2005</year>). <article-title>Respecting the Evidence.</article-title> <source>Philosophical Perspectives</source>, <volume>19</volume>(<issue>1</issue>), <fpage>95</fpage>&#x2013;<lpage>119</lpage>.</mixed-citation></ref>
<ref id="R19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Feldman</surname>, <given-names>Richard</given-names></string-name></person-group> (<year>2007</year>). <chapter-title>Reasonable Religious Disagreements.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Antony</surname>, <given-names>Louise</given-names></string-name></person-group> (Ed.), <source>Philosophers without Gods: Meditations on Atheism and the Secular Life</source> (<fpage>194</fpage>&#x2013;<lpage>214</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R20"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bruno de</surname>, <given-names>Finetti</given-names></string-name></person-group> (<year>1974</year>). <source>Theory of Probability: A Critical Introductory Treatment.</source> <publisher-name>Wiley</publisher-name>.</mixed-citation></ref>
<ref id="R21"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Galton</surname>, <given-names>Francis</given-names></string-name></person-group> (<year>1907</year>). <article-title>Vox Populi (The Wisdom of Crowds).</article-title> <source>Nature</source>, <volume>75</volume>(<issue>1949</issue>), <fpage>450</fpage>&#x2013;<lpage>51</lpage>.</mixed-citation></ref>
<ref id="R22"><mixed-citation publication-type="confproc"><person-group person-group-type="author"><string-name><surname>Garg</surname>, <given-names>Ashutosh</given-names></string-name>, <string-name><surname>Jayram</surname>, <given-names>Thathachar S.</given-names></string-name>, <string-name><surname>Vaithyanathan</surname>, <given-names>Shivakumar</given-names></string-name>, and <string-name><surname>Zhu</surname>, <given-names>Huaiyu</given-names></string-name></person-group> (<year>2004</year>). <source>Generalized Opinion Pooling.</source> In <conf-name>Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics</conf-name> (<fpage>79</fpage>&#x2013;<lpage>86</lpage>).</mixed-citation></ref>
<ref id="R23"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Genest</surname>, <given-names>Christian</given-names></string-name> and <string-name><surname>Zidek</surname>, <given-names>James V.</given-names></string-name></person-group> (<year>1986</year>). <article-title>Combining Probability Distributions: A Critique and an Annotated Bibliography.</article-title> <source>Statistical Science</source>, <volume>1</volume>(<issue>1</issue>), <fpage>114</fpage>&#x2013;<lpage>35</lpage>.</mixed-citation></ref>
<ref id="R24"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Gilboa</surname>, <given-names>Itzhak</given-names></string-name> and <string-name><surname>Marinacci</surname>, <given-names>Massimo</given-names></string-name></person-group> (<year>2016</year>). <chapter-title>Ambiguity and the Bayesian Paradigm.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Arl&#x00F3;-Costa</surname>, <given-names>Horacio</given-names></string-name>, <string-name><surname>Hendricks</surname>, <given-names>Vincent F.</given-names></string-name>, and <string-name><surname>van Benthem</surname>, <given-names>Johan</given-names></string-name></person-group> (Eds.), <source>Readings in Formal Epistemology</source> (<fpage>385</fpage>&#x2013;<lpage>439</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R25"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gilboa</surname>, <given-names>Itzhak</given-names></string-name> and <string-name><surname>Schmeidler</surname>, <given-names>David</given-names></string-name></person-group> (<year>1989</year>). <article-title>Maxmin Expected Utility with Non-Unique Prior.</article-title> <source>Journal of Mathematical Economics</source>, <volume>18</volume>(<issue>2</issue>), <fpage>141</fpage>&#x2013;<lpage>53</lpage>.</mixed-citation></ref>
<ref id="R26"><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Hartmann</surname>, <given-names>Stephan</given-names></string-name></person-group> (<year>2017</year>). <source>Prospect Theory and the Wisdom of the Inner Crowd.</source> <comment>Unpublished manuscript.</comment></mixed-citation></ref>
<ref id="R27"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hooker</surname>, <given-names>Reginald H.</given-names></string-name></person-group> (<year>1907</year>). <article-title>Mean or Median.</article-title> <source>Nature</source>, <volume>75</volume>(<issue>1951</issue>), <fpage>487</fpage>.</mixed-citation></ref>
<ref id="R28"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jehle</surname>, <given-names>David</given-names></string-name> and <string-name><surname>Fitelson</surname>, <given-names>Branden</given-names></string-name></person-group> (<year>2009</year>). <article-title>What Is the &#x201C;Equal Weight View&#x201D;?</article-title> <source>Episteme</source>, <volume>6</volume>(<issue>3</issue>), <fpage>280</fpage>&#x2013;<lpage>93</lpage>.</mixed-citation></ref>
<ref id="R29"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Joyce</surname>, <given-names>James M.</given-names></string-name></person-group> (<year>2005</year>). <article-title>How Probabilities Reflect Evidence.</article-title> <source>Philosophical Perspectives</source>, <volume>19</volume>(<issue>1</issue>), <fpage>153</fpage>&#x2013;<lpage>78</lpage>.</mixed-citation></ref>
<ref id="R30"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Joyce</surname>, <given-names>James M.</given-names></string-name></person-group> (<year>2010</year>). <article-title>A Defense of Imprecise Credences in Inference and Decision Making.</article-title> <source>Philosophical Perspectives</source>, <volume>24</volume>(<issue>1</issue>), <fpage>281</fpage>&#x2013;<lpage>323</lpage>.</mixed-citation></ref>
<ref id="R31"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kahneman</surname>, <given-names>Daniel</given-names></string-name> and <string-name><surname>Miller</surname>, <given-names>Dale T.</given-names></string-name></person-group> (<year>1986</year>). <article-title>Norm Theory: Comparing Reality to its Alternatives.</article-title> <source>Psychological Review</source>, <volume>93</volume>(<issue>2</issue>), <fpage>136</fpage>&#x2013;<lpage>53</lpage>.</mixed-citation></ref>
<ref id="R32"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Keller</surname>, <given-names>L. Robin</given-names></string-name>, <string-name><surname>Sarin</surname>, <given-names>Rakesh K.</given-names></string-name>, and <string-name><surname>Sounderpandian</surname>, <given-names>Jayavel</given-names></string-name></person-group> (<year>2007</year>). <article-title>An Examination of Ambiguity Aversion: Are Two Heads Better than One?</article-title> <source>Judgment and Decision Making</source>, <volume>2</volume>(<issue>6</issue>), <fpage>390</fpage>&#x2013;<lpage>97</lpage>.</mixed-citation></ref>
<ref id="R33"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kelly</surname>, <given-names>Thomas</given-names></string-name></person-group> (<year>2013</year>). <chapter-title>Disagreement and the Burdens of Judgment.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Christensen</surname>, <given-names>David</given-names></string-name> and <string-name><surname>Lackey</surname>, <given-names>Jennifer</given-names></string-name></person-group> (Eds.), <source>The Epistemology of Disagreement: New Essays</source> (<fpage>31</fpage>&#x2013;<lpage>53</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R34"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Konek</surname>, <given-names>Jason</given-names></string-name></person-group> <comment>(in press).</comment> <article-title>Epistemic Conservativity and Imprecise Credence.</article-title> <source>Philosophy and Phenomenological Research.</source></mixed-citation></ref>
<ref id="R35"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kyburg</surname>, <given-names>Henry E.</given-names></string-name> and <string-name><surname>Pittarelli</surname>, <given-names>Michael</given-names></string-name></person-group> (<year>1996</year>). <article-title>Set-Based Bayesianism.</article-title> <source>IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans</source>, <volume>26</volume>(<issue>3</issue>), <fpage>324</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="R36"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Laddaga</surname>, <given-names>Robert</given-names></string-name></person-group> (<year>1977</year>). <article-title>Lehrer and the Consensus Proposal.</article-title> <source>Synthese</source>, <volume>36</volume>(<issue>4</issue>), <fpage>473</fpage>&#x2013;<lpage>77</lpage>.</mixed-citation></ref>
<ref id="R37"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lehrer</surname>, <given-names>Keith</given-names></string-name></person-group> (<year>1976</year>). <article-title>When Rational Disagreement is Impossible.</article-title> <source>No&#x00FB;s</source>, <volume>10</volume>(<issue>3</issue>), <fpage>327</fpage>&#x2013;<lpage>32</lpage>.</mixed-citation></ref>
<ref id="R38"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lehrer</surname>, <given-names>Keith</given-names></string-name> and <string-name><surname>Wagner</surname>, <given-names>Carl</given-names></string-name></person-group> (<year>1983</year>). <article-title>Probability Amalgamation and the Independence Issue: A Reply to Laddaga.</article-title> <source>Synthese</source>, <volume>55</volume>(<issue>3</issue>), <fpage>339</fpage>&#x2013;<lpage>46</lpage>.</mixed-citation></ref>
<ref id="R39"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Levi</surname>, <given-names>Isaac</given-names></string-name></person-group> (<year>1974</year>). <article-title>On Indeterminate Probabilities.</article-title> <source>The Journal of Philosophy</source>, <volume>71</volume>(<issue>13</issue>), <fpage>391</fpage>&#x2013;<lpage>418</lpage>.</mixed-citation></ref>
<ref id="R40"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Levi</surname>, <given-names>Isaac</given-names></string-name></person-group> (<year>1983</year>). <source>The Enterprise of Knowledge: An Essay on Knowledge, Credal Probability, and Chance.</source> <publisher-name>MIT Press</publisher-name>.</mixed-citation></ref>
<ref id="R41"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Loomes</surname>, <given-names>Graham</given-names></string-name> and <string-name><surname>Sugden</surname>, <given-names>Robert</given-names></string-name></person-group> (<year>1982</year>). <article-title>Regret Theory: An Alternative Theory of Rational Choice under Uncertainty.</article-title> <source>The Economic Journal</source>, <volume>92</volume>(<issue>368</issue>), <fpage>805</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="R42"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lyon</surname>, <given-names>Aidan</given-names></string-name></person-group> (<year>2017</year>). <article-title>Vague Credences.</article-title> <source>Synthese</source>, <volume>194</volume>(<issue>10</issue>), <fpage>3931</fpage>&#x2013;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="R43"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Machina</surname>, <given-names>Mark J.</given-names></string-name> and <string-name><surname>Siniscalchi</surname>, <given-names>Marciano</given-names></string-name></person-group> (<year>2014</year>). <chapter-title>Ambiguity and Ambiguity Aversion.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Machina</surname>, <given-names>Mark J.</given-names></string-name> and <string-name><surname>Kip Viscusi</surname>, <given-names>W.</given-names></string-name></person-group> (Eds.), <source>Handbook of the Economics of Risk and Uncertainty</source> (Vol. <volume>1</volume>, <fpage>729</fpage>&#x2013;<lpage>807</lpage>). <publisher-name>North-Holland</publisher-name>.</mixed-citation></ref>
<ref id="R44"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>McConway</surname>, <given-names>Kevin J.</given-names></string-name></person-group> (<year>1981</year>). <article-title>Marginalization and Linear Opinion Pools.</article-title> <source>Journal of the American Statistical Association</source>, <volume>76</volume>(<issue>374</issue>), <fpage>410</fpage>&#x2013;<lpage>14</lpage>.</mixed-citation></ref>
<ref id="R45"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Moral</surname>, <given-names>Seraf&#x00ED;n</given-names></string-name> and <string-name><surname>del Sagrado</surname>, <given-names>Jos&#x00E9;</given-names></string-name></person-group> (<year>1998</year>). <chapter-title>Aggregation of Imprecise Probabilities.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Bouchon-Meunier</surname>, <given-names>Bernadette</given-names></string-name></person-group> (Ed.), <source>Aggregation and Fusion of Imperfect Information: Studies in Fuzziness and Soft Computing</source> (Vol. <volume>12</volume>, <fpage>162</fpage>&#x2013;<lpage>88</lpage>). <publisher-name>Physica</publisher-name>.</mixed-citation></ref>
<ref id="R46"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Moss</surname>, <given-names>Sarah</given-names></string-name></person-group> (<year>2011</year>). <article-title>Scoring Rules and Epistemic Compromise.</article-title> <source>Mind</source>, <volume>120</volume>(<issue>480</issue>), <fpage>1053</fpage>&#x2013;<lpage>69</lpage>.</mixed-citation></ref>
<ref id="R47"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nau</surname>, <given-names>Robert F.</given-names></string-name></person-group> (<year>2002</year>). <article-title>The Aggregation of Imprecise Probabilities.</article-title> <source>Journal of Statistical Planning and Inference</source>, <volume>105</volume>(<issue>1</issue>), <fpage>265</fpage>&#x2013;<lpage>82</lpage>.</mixed-citation></ref>
<ref id="R48"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pedersen</surname>, <given-names>Arthur P.</given-names></string-name> and <string-name><surname>Wheeler</surname>, <given-names>Gregory</given-names></string-name></person-group> (<year>2014</year>). <article-title>Demystifying Dilation.</article-title> <source>Erkenntnis</source>, <volume>79</volume>(<issue>6</issue>), <fpage>1305</fpage>&#x2013;<lpage>42</lpage>.</mixed-citation></ref>
<ref id="R49"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pettigrew</surname>, <given-names>Richard</given-names></string-name></person-group> (<year>2019</year>). <chapter-title>On the Accuracy of Group Credences.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Szab&#x00F3; Gendler</surname>, <given-names>Tamar</given-names></string-name> and <string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name></person-group> (Eds.), <source>Oxford Studies in Epistemology</source> (Vol. <volume>6</volume>, <fpage>137</fpage>&#x2013;<lpage>60</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R50"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Roese</surname>, <given-names>Neal J.</given-names></string-name> and <string-name><surname>Summerville</surname>, <given-names>Amy</given-names></string-name></person-group> (<year>2005</year>). <article-title>What We Regret Most &#x2026; and Why.</article-title> <source>Personality and Social Psychology Bulletin</source>, <volume>31</volume>(<issue>9</issue>), <fpage>1273</fpage>&#x2013;<lpage>85</lpage>.</mixed-citation></ref>
<ref id="R51"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Russell</surname>, <given-names>Jeffrey S.</given-names></string-name>, <string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name>, and <string-name><surname>Buchak</surname>, <given-names>Lara</given-names></string-name></person-group> (<year>2015</year>). <article-title>Groupthink.</article-title> <source>Philosophical Studies</source>, <volume>172</volume>(<issue>5</issue>), <fpage>1287</fpage>&#x2013;<lpage>1309</lpage>.</mixed-citation></ref>
<ref id="R52"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Savage</surname>, <given-names>Leonard J.</given-names></string-name></person-group> (<year>1951</year>). <article-title>The Theory of Statistical Decision.</article-title> <source>Journal of the American Statistical Association</source>, <volume>46</volume>(<issue>253</issue>), <fpage>55</fpage>&#x2013;<lpage>67</lpage>.</mixed-citation></ref>
<ref id="R53"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Savage</surname>, <given-names>Leonard J.</given-names></string-name></person-group> (<year>1954</year>). <source>The Foundations of Statistics.</source> <publisher-name>Dover</publisher-name>.</mixed-citation></ref>
<ref id="R54"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schoenfield</surname>, <given-names>Miriam</given-names></string-name></person-group> (<year>2012</year>). <article-title>Chilling Out on Epistemic Rationality.</article-title> <source>Philosophical Studies</source>, <volume>158</volume>(<issue>2</issue>), <fpage>197</fpage>&#x2013;<lpage>219</lpage>.</mixed-citation></ref>
<ref id="R55"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Seidenfeld</surname>, <given-names>Teddy</given-names></string-name>, <string-name><surname>Schervish</surname>, <given-names>Mark J.</given-names></string-name>, and <string-name><surname>Kadane</surname>, <given-names>Joseph B.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Coherent Choice Functions under Uncertainty.</article-title> <source>Synthese</source>, <volume>172</volume>(<issue>1</issue>), <fpage>157</fpage>&#x2013;<lpage>76</lpage>.</mixed-citation></ref>
<ref id="R56"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Shafer</surname>, <given-names>Glenn</given-names></string-name></person-group> (<year>1976</year>). <source>A Mathematical Theory of Evidence.</source> <publisher-name>Princeton University Press</publisher-name>.</mixed-citation></ref>
<ref id="R57"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Simon</surname>, <given-names>Herbert A.</given-names></string-name></person-group> (<year>1955</year>). <article-title>A Behavioral Model of Rational Choice.</article-title> <source>The Quarterly Journal of Economics</source>, <volume>69</volume>(<issue>1</issue>), <fpage>99</fpage>&#x2013;<lpage>118</lpage>.</mixed-citation></ref>
<ref id="R58"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Stewart</surname>, <given-names>Rush T.</given-names></string-name> and <string-name><surname>Quintana</surname>, <given-names>Ignacio O.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Probabilistic Opinion Pooling with Imprecise Probabilities.</article-title> <source>Journal of Philosophical Logic</source>, <volume>47</volume>(<issue>1</issue>), <fpage>17</fpage>&#x2013;<lpage>45</lpage>.</mixed-citation></ref>
<ref id="R59"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Stone</surname>, <given-names>Mervyn</given-names></string-name></person-group> (<year>1961</year>). <article-title>The Opinion Pool.</article-title> <source>The Annals of Mathematical Statistics</source>, <volume>32</volume>(<issue>4</issue>), <fpage>1339</fpage>&#x2013;<lpage>42</lpage>.</mixed-citation></ref>
<ref id="R60"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sturgeon</surname>, <given-names>Scott</given-names></string-name></person-group> (<year>2010</year>). <chapter-title>Confidence and Coarse-Grained Attitudes.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Szab&#x00F3; Gendler</surname>, <given-names>Tamar</given-names></string-name> and <string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name></person-group> (Eds.), <source>Oxford Studies in Epistemology</source> (Vol. <volume>3</volume>, <fpage>126</fpage>&#x2013;<lpage>49</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R61"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Surowiecki</surname>, <given-names>James</given-names></string-name></person-group> (<year>2005</year>). <source>The Wisdom of Crowds.</source> <publisher-name>Anchor</publisher-name>.</mixed-citation></ref>
<ref id="R62"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Thaler</surname>, <given-names>Richard</given-names></string-name></person-group> (<year>1980</year>). <article-title>Toward a Positive Theory of Consumer Choice.</article-title> <source>Journal of Economic Behavior &amp; Organization</source>, <volume>1</volume>(<issue>1</issue>), <fpage>39</fpage>&#x2013;<lpage>60</lpage>.</mixed-citation></ref>
<ref id="R63"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tversky</surname>, <given-names>Amos</given-names></string-name> and <string-name><surname>Kahneman</surname>, <given-names>Daniel</given-names></string-name></person-group> (<year>1991</year>). <article-title>Loss Aversion in Riskless Choice: A Reference-Dependent Model.</article-title> <source>The Quarterly Journal of Economics</source>, <volume>106</volume>(<issue>4</issue>), <fpage>1039</fpage>&#x2013;<lpage>61</lpage>.</mixed-citation></ref>
<ref id="R64"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wagner</surname>, <given-names>Carl</given-names></string-name></person-group> (<year>1978</year>). <article-title>Consensus through Respect: A Model of Rational Group Decision-making.</article-title> <source>Philosophical Studies</source>, <volume>34</volume>(<issue>4</issue>), <fpage>335</fpage>&#x2013;<lpage>49</lpage>.</mixed-citation></ref>
<ref id="R65"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wagner</surname>, <given-names>Carl</given-names></string-name></person-group> (<year>2009</year>). <article-title>Jeffrey Conditioning and External Bayesianity.</article-title> <source>Logic Journal of IGPL</source>, <volume>18</volume>(<issue>2</issue>), <fpage>336</fpage>&#x2013;<lpage>45</lpage>.</mixed-citation></ref>
<ref id="R66"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Walley</surname>, <given-names>Peter</given-names></string-name></person-group> (<year>1991</year>). <source>Statistical Reasoning with Imprecise Probabilities.</source> <publisher-name>Chapman and Hall</publisher-name>.</mixed-citation></ref>
<ref id="R67"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wasserman</surname>, <given-names>Larry A.</given-names></string-name> and <string-name><surname>Kadane</surname>, <given-names>Joseph B.</given-names></string-name></person-group> (<year>1990</year>). <article-title>Bayes&#x2019; Theorem for Choquet Capacities.</article-title> <source>The Annals of Statistics</source>, <volume>18</volume>(<issue>3</issue>), <fpage>1328</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="R68"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Weaver</surname>, <given-names>Ray</given-names></string-name> and <string-name><surname>Frederick</surname>, <given-names>Shane</given-names></string-name></person-group> (<year>2012</year>). <article-title>A Reference Price Theory of the Endowment Effect.</article-title> <source>Journal of Marketing Research</source>, <volume>49</volume>(<issue>5</issue>), <fpage>696</fpage>&#x2013;<lpage>707</lpage>.</mixed-citation></ref>
<ref id="R69"><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Wheeler</surname>, <given-names>Gregory</given-names></string-name></person-group> (<year>2020</year>). <chapter-title>Bounded Rationality.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Zalta</surname>, <given-names>Edward N.</given-names></string-name></person-group> (Ed.), <source>The Stanford Encyclopedia of Philosophy.</source> <comment>Retrieved from <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://plato.stanford.edu/entries/bounded-rationality/" xlink:type="simple">https://plato.stanford.edu/entries/bounded-rationality/</ext-link></comment></mixed-citation></ref>
<ref id="R70"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zeelenberg</surname>, <given-names>Marcel</given-names></string-name></person-group> (<year>1999</year>). <article-title>Anticipated Regret, Expected Feedback, and Behavioral Decision Making.</article-title> <source>Journal of Behavioral Decision Making</source>, <volume>12</volume>(<issue>2</issue>), <fpage>93</fpage>&#x2013;<lpage>106</lpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>
