<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>The Role of Information in the Two Envelope Problem</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mirko Navara</string-name>
          <email>navara@cmp.felk.cvut.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jirˇí Šindelárˇ</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague</institution>
          ,
          <addr-line>Technická 2, 166 27 Prague</addr-line>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <volume>1885</volume>
      <fpage>112</fpage>
      <lpage>119</lpage>
      <abstract>
        <p>We offer a new view on the two envelope problem (also called the exchange paradox). We describe it as a zero-sum game of two players, having only partial information. We first explain a standard situation and show that the mean gain-when defined-is really zero. However, there are even more paradoxical situations in which the information obtained by the players supports the exchange of envelopes. We explain that this does not lead to a contradiction and we demonstrate it also by computer simulation. The reason for this paradox is that the mean gain does not exist and that the players have different information, supporting their contradictory decisions.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The two envelope problem (also called the exchange
paradox) is a famous logical puzzle demonstrating a paradox in
logic and probability. We adopt its formulation from [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
expressed here as a game of two players:
      </p>
      <p>There are two indistinguishable envelopes, each
containing money, one contains twice as much
as the other. Player A picks one envelope of his
choice; player B receives the second envelope.
They can keep the money contained in their
envelopes or switch the envelopes (if both agree on
it). Should they switch?</p>
    </sec>
    <sec id="sec-2">
      <title>There is an easy answer:</title>
      <p>Argument 1. The situation is symmetric. Thus there is no
reason for (or against) switching.</p>
      <p>However, there are other interpretations suggesting
something else:
Argument 2. The situation is symmetric. Thus the
probability of having the envelope with the higher or lower
amount is 1/2. If the envelope of player A contains the
amount a, then the other envelope contains 2a (and the
exchange results in a gain of a) or a/2 (and the exchange
results in a loss of a/2). In average, the mean gain is
1 1 a a
2 a − 2 2 = 4 ,
thus switching is always recommended.</p>
      <p>Another point of view is the following:
Argument 3. The smaller amount is x, the bigger is 2x.
They are assigned randomly (with probabilities 1/2) to
players A and B. The mean values for both players are
1 1
2 x − 2 2x =
and there is no reason for (or against) switching.</p>
      <p>We presented several arguments; each of them seems
correct, but their conclusions are contradictory.</p>
      <p>
        Surprisingly, the debate about this paradox is still not
finished (cf. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]).
      </p>
      <p>
        “Currently, there is no consensus on a
demonstration, since most people generally reject each
other’s demonstrations." [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
One reason is that many authors merely defended their
solution (mostly correct), cf. [
        <xref ref-type="bibr" rid="ref13 ref6">6, 13</xref>
        ]. However, to resolve
the paradox, it is necessary to explain the errors in the
contradicting arguments.1 The topic was studied not only
by mathematicians and logicians but also by philosophers
(e.g., [
        <xref ref-type="bibr" rid="ref11 ref4">4, 11</xref>
        ]). For some of them, a sufficient
explanation is that a in Argument 2 denotes different amounts;
the smaller one in the first case and the bigger one in the
second case [
        <xref ref-type="bibr" rid="ref13 ref4">4, 13</xref>
        ]. However, this is not forbidden, this is
just what a random variable means. Thus a more advanced
analysis is needed.
      </p>
      <p>
        The paradox has more variants (cf. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). The method
of choice of the amounts was not specified. (This is usual
in such puzzles. They rarely start with a precise definition
of a random experiment generating the data. Instead of
that, it was said that two amounts are given, one of them
twice greater than the other.) Here we assume that they
were drawn as realizations of some random variable with
a given distribution (known or unknown to players).
Nevertheless, the formulation of the problem does not specify
this at all, and some authors (e.g. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]) consider this amount
as given (without any randomness); such formulation
excludes a probabilistic analysis. Thus we do not consider it
here. Besides, it is not specified whether we first draw the
(realization of) random variable X (the smaller amount) or
the contents of the envelope given to player A, described
1We experienced this misunderstanding also during the reviewing
process of this paper: “Argument 3 is correct, so there is no paradox.”
However, what is wrong on Argument 2?
by random variable A. It is natural to assume that the
binary choice of envelopes is made with equal probabilities
and independently of all other random events (or
parameters) of the experiment. Here we apply the
probabilistic approach to the problem in its original form: We first
draw a positive amount x from some distribution. We put
this amount into one envelope and 2x into the other
envelope. Both envelopes have probability 1/2 to be chosen by
player A. The remaining envelope is given to player B.
      </p>
      <p>It is also not specified whether the players know the
amounts in their envelopes. This knowledge is useless if
the distribution is unknown. On the other hand, knowing
the distribution, the amounts bring useful information for
the decision. We suppose that the players know the
distribution from which x was drawn. We discuss this case
in detail. Some of its consequences seem to determine the
strategy also without looking inside the envelope, but—as
we shall show—this need not correspond to conclusions
made in the former case.</p>
      <p>
        We present an explanation of the paradox (based
on [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) using results of probability and information
theory. The standard explanation of the exchange paradox
(following [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]) is presented in Section 2 and demonstrated
by an example in Section 3. As a new contribution, we
modify this example to two even more surprising and
counterintuitive versions of the paradox, which we explain
in detail in Sections 4 and 5. In Section 6, we verify the
results by a computer simulation.
2
      </p>
      <p>Exchange Paradox: First Level
We introduce a third member of the experiment, the
banker C, who controls the game and puts (his) money
in the envelopes. We assume that the smaller amount, x,
was chosen by a realization of a random variable X . (The
larger amount in the second envelope is 2x.) The
distribution of random variable X is known to the banker and also
to the players. For simplicity, we assume that the
distribution is discrete and the amounts are positive. Then we do
an independent random experiment (e.g., tossing a coin)
with two equally probable results, expressed by a random
variable U , whose possible values are 0 and 1 and
expectation EU = 1/2. If U = 0, player A receives the smaller
amount, x; if U = 1, player A receives the bigger amount,
2x. He does not know x, only the contents of his envelope,
specified by realizationa of random variable A,
A =</p>
      <p>(x
A = (1 + U ) X .</p>
      <p>if X = x and U = 0 ,
2x if X = x and U = 1 ,
Player B receives the other envelope and knows only its
contents, specified by realizationb of random variable B,
B =</p>
      <p>(x
B = (2 − U ) X .</p>
      <p>if X = x and U = 1 ,
2x if X = x and U = 0 ,
If the players exchange the envelopes, the gain of A is G =
B − A. For player B, G is the loss and −G is the gain.</p>
      <p>Random variables X and U are independent. If X has an
expectation EX , then</p>
      <p>EA = (1 + EU ) EX =
EB = (2 − EU ) EX =
EG = EB − EA = 0 .
for all x. However, this does not apply to conditional
probabilities P(U = 0|A = a), P(U = 1|A = a) because U, A are
dependent:</p>
      <p>P(U = 0|A = a) =
P(U = 1|A = a) =
=
=</p>
      <p>P(U = 0, A = a)</p>
      <p>P(A = a)
P(U = 0, X = a)</p>
      <p>P(A = a)
P(U = 1, A = a)</p>
      <p>P(A = a)
P(U = 1, X = a2 )</p>
      <p>P(A = a)
=
=</p>
      <p>P(X = a)
2 P(A = a)
where</p>
      <p>P(A = a) = P(U = 0, A = a) + P(U = 1, A = a)
= P(U = 0, X = a) + P(U = 1, X = a2 )
=</p>
      <p>Notice that P(U = 0|A = a) is the conditional probability
of gain and P(U = 1|A = a) is the conditional probability
of loss given A = a. Their ratio is</p>
      <p>P(X = a)</p>
      <p>P(X = a2 ) .</p>
      <p>
        As there is no uniform distribution on an infinite
countable set (a fact ignored even in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]), P(X = a), P(X = a2 )
cannot be equal for all a. Typically, the conditional
probability of gain, P(U = 0|A = a), is higher for “small”
values of a and smaller for “high” values, although the
notions “small” and “high” are relative. In any case,
these probabilities converge to 0 when a goes to
infinity, hence there must be values “sufficiently large” so that
P(X = a) &lt; P(X = a2 ) and the conditional probability of
gain P(U = 0|A = a) &lt; 21 . This can also lead to an
effective strategy based on random switching [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ].
      </p>
      <p>Given A = a, switching brings a gain with conditional
probability distribution</p>
      <p>P(G = g|A = a) =</p>
      <p>P(G = g, A = a)</p>
      <p>
        P(A = a)
,
where
(after substitution a := 2b). This explains the error in
Argument 2 provided that the expectation of G is defined.
Remark 1. There is another arrangement suggested in [
        <xref ref-type="bibr" rid="ref11 ref8">8,
11</xref>
        ]: First, the amount a in the envelope of player A is
drawn from some distribution. Then the random variable
U (as before) decides whether the second envelope will
contain 2a or 2a . In this arrangement, random variables
U and A are independent and Argument 2 is valid.
Arguments 1 and 3 fail because of an intervention of the banker;
it is him who puts additional money in the second
envelope, so that the total amount may be 3a or 32 a. This is not
a zero-sum game, and it is not symmetric.
      </p>
      <p>P(G = g, A = a) =</p>
    </sec>
    <sec id="sec-3">
      <title>We obtain</title>
      <p>P(G = g|A = a) =
P(U = 0, X = a) if g = a ,

</p>
      <p>P(U = 1, X = 2a ) if g = − 2 ,
a
0 otherwise.</p>
      <p>0
=
 2211 PP((XX == a2a)) iiff gg == a−,2 ,</p>
      <p>a
otherwise.
 P(X = a)
 P(X = a) + P(X = 2a )
 P(X = a2 )
 P(X = a) + P(X = 2a )


0
if g = a ,</p>
      <p>a
if g = − 2 ,
otherwise.</p>
      <p>The conditional expectation of the gain is always defined
and it is</p>
      <p>E(G|A = a) =
a P(X = a) − 2a P(X = a2 ) .</p>
      <p>P(X = a) + P(X = a2 )</p>
    </sec>
    <sec id="sec-4">
      <title>These values may differ from 0. The (unconditional) distribution of the gain is</title>
      <p>P(G = g) =  2121 PP((XX == g−)g) if g &lt; 0 ,
if g &gt; 0 ,
0
otherwise
and its expectation is</p>
      <p>EG = ∑ g P(G = g)
g
∑ g P(X = g) + ∑ g P(X = −g)
g&gt;0 g&lt;0
∑ g P(X = g) − ∑ h P(X = h)
g&gt;0 h&gt;0
= 0
(after substitution g := −h), provided that the sum (2) is
absolutely convergent. In this case</p>
      <p>EG = ∑ P(A = a) E(G|A = a)
a
(1)
(2)
(3)
(4)
a P(X = a) − 2a P(X = 2a )
∑ a P(X = a) − ∑ b P(X = b)
a b
= 0
=
=
1
2
1
2
= ∑
a 2</p>
      <p>1
=</p>
      <p>For q = 0.25, it is shown in Fig. 1.</p>
      <p>If player A has a = 2s, the conditional probability of his
gain by switching is</p>
      <p>P(U = 0|A = 2s) =</p>
      <p>P(X = a)
P(X = a) + P(X = a2 )
=</p>
      <p>q
q + 1
(5)
for all s ∈ {1, 2, . . .} (and 1 for s = 0). As q &lt; 1/2, this
probability is less than 1/3. The conditional expectation
For q = 0.25, it is shown in Fig. 2. The contributions of
conditional expectations E(G|A = a) to the unconditional
expected gain EG are E(G|A = a) · P(A = a), see Fig. 3.
The conditional expectation is positive only for s = 0 (i.e.,
a = 1), negative otherwise. This determines the right
strategy of switching: Switch only if you hold 1. The two
players never both agree on switching the envelopes because at
most one of them holds 1.</p>
      <p>If player A does not know the contents of his envelope,
he may use only its distribution
 1

 2
P(A = 2s) =  1</p>
      <p>
        qs
1 − q
1
+
qs−1
1 − q
 2 1 − q

0
 1 qs−1 q + 1

 2 1 − q
=  1 1
 2 1 − q

0
In Section 2, we presented a standard explanation of the
exchange paradox. It is based on the assumption that the
(7)
amount in the envelopes has an expectation. This can fail
even for some common distributions. (This fact is ignored,
e.g., in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].) We discovered that this leads to a more
advanced paradox. We have found out that Nalebuff [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
proposed the same example, and similar ones can be found
in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, Nalebuff only noticed that both players
might be convinced that switching brings gain to them and
that the above arguments are not applicable if the
expectation does not exist. It seems that no detailed analysis was
published since, and this is what we do here.
      </p>
      <p>Let us consider the situation from Section 3 if q &gt; 12 .
Then the expectation EX does not exist. (The respective
sum of a geometric series with quotient 2q &gt; 1 is +∞.)
For q = 0.75, the joint distribution of U and A is shown in
Fig. 4.</p>
      <p>The expectation of the gain, EG, does not exist because
the sum (2) is not absolutely convergent; it is a difference
of two infinite sums in (3).</p>
      <p>Still formula (6) for the conditional expectation of the
gain is valid,</p>
      <p>
        Thus E(G|A = 2s) &gt; 0 for all s ∈ {1, 2, . . .}. For q = 0.75,
see Fig. 5. (Notice that formula (5) for the conditional
probability of gain P(U = 0|A = 2s) for s 6= 0 still holds
and gives a constant value from the interval ( 1 , 12 ).) Player
3
A has a strong argument for switching the envelopes,
independently of the amount in his envelope. (Thus he may
“rationally” decide for switching without looking inside
the envelope.) Such distributions are called paradoxical
in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>The same argument applies to player B. Although he
holds a different amount in his envelope, he also prefers
switching. We have again a paradox, now supported by a
probabilistic analysis. The only thing which does not work
as in Section 3 is formula (7) for unconditional gain; the
sum is not absolutely convergent. However, the
unconditional gain is not needed for decision if the conditional one
is always positive. How can we now defend Argument 1?</p>
      <p>
        First of all, we refuse the possibility (considered in [
        <xref ref-type="bibr" rid="ref2 ref4 ref6">2,
4, 6</xref>
        ]) that players A and B will change the envelopes there
and back forever. After one exchange and looking inside,
they would know the contents of both envelopes and
decide deterministically with full information. One of the
players has the larger amount (and he knows that), so he
would not agree to switch again.
      </p>
      <p>If the players know only the amount in the envelope they
received first, they have different information, and this is
the key difference.</p>
      <p>Example 1. Suppose that A has 4 and B has 8. Then
A knows that B can have 2 or 8, while B knows that A
can have 4 or 16. Using Argument 2, A might expect that
switching brings him a mean gain of 1. Using the model
described in this section (formula (5) remains valid), he
knows that his chance of gain is lower,
5</p>
      <p>Exchange Paradox: Third Level
Another modification of the example of Section 3 withq =
1/2 is also of particular interest. The joint distribution of
U and A is shown in Fig. 7. Formula (5) for the conditional
q
q + 1 ∈
.</p>
      <p>For q = 0.75, this chance is 3/7 = 0.43, still sufficient to
give a positive conditional mean gain of
Player B may apply the same arguments, leading to twice
higher estimates of his gain.</p>
      <p>Example 2. Suppose now that A has 4 and B has 2. Then
A knows that B can have 2 or 8, while B knows that A
can have 1 or 4. From the point of view of player A, the
situation is the same as in Ex. 1. Player B may apply the
same arguments, leading to twice lower estimates of his
gain, still supporting the decision to switch.</p>
      <p>In Exs. 1 and 2, we saw that probabilistic analysis
suggests switching to both players. This apparently brings a
gain to only one of them, but their arguments overestimate
their chances. This explains why they may have
contradictory views on the effect of the switching of envelopes
(both thinking that the other envelope is “better”).</p>
      <p>
        To understand this paradox better, imagine the reverse
game: Suppose that the players see the contents of the
other player’s envelope (and not of their own). Then the
same reasoning (based on the information received) would
support keeping the envelopes (and no switching). This
shows that it is the different incomplete information which
supports their paradoxical behavior. (The role of
incomplete information and other arrangements of the
experiment are discussed in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for the “first level” of the
paradox.)
      </p>
      <p>This situation is not so counterintuitive. Imagine for
instance a poker game where two players hold a poker
in their hands. They both evaluate their chances of
winning as very high, although it is clear that only one is in
the winning position. In the reverse game, where they see
the cards of the opponent (and not their own), each player
would estimate the chances of his opponent as very high,
and he would surrender.</p>
      <p>The two envelope problem in this setting possesses the
same feature: the partial information given to players is
overly optimistic. Thus looking inside the envelopes is not
so helpful as it seems. Therefore, if rational players do
not look inside any of the envelopes, the latter argument
makes their choice ambivalent, and they would accept
Argument 1. Even if they look in the envelopes, they will not
accept Argument 2, knowing (from the above analysis of
the model) that its prediction is biased and too optimistic.
probability of gain gives P(U = 0|A = 2s) = 1/3 if s 6= 0.
The loss is twice more probable but twice smaller. Thus
the conditional expectation of the gain simplifies to</p>
      <p>It seems that player A (as well as B) may only gain by
switching (if he holds 1), in all other cases the risk of loss
is compensated by the same expected gain. In the sum
in (7), only the first summand is nonzero, and it is positive.
So the sum exists and evaluates to
1</p>
      <p>1
2 1 − q</p>
      <p>The arguments from Section 4 are applicable. Moreover,
switching is supported by a computation which results in
a positive unconditional gain (of a player not looking in
his envelope). However, this argument is wrong. As in
Section 4, the expectation of the gain, EG, does not
exist because the sum (2), as a difference of two infinite
sums in (3), is not absolutely convergent. Formula (7) uses
only one possible arrangement of the summands, leading
to an invalid conclusion. If player B applies the same
argument, he uses another arrangement of the summands and
gets a positive expected gain for himself, loss for A. Thus
the sum (2) does not exist and the discussion from
Section 4 fully applies, despite the seemingly trivial (wrong)
sum (7).
6</p>
      <p>Simulations
To verify the results, we also used computer simulations.
We computed the average gain from 1000 samples and
repeated this 5000 times. The results were displayed as
histograms of the averages, see Figs. 10, 11, 12 for
quotients q = 0.25, 0.5, 0.75, respectively. For q = 0.75, the
linear scale could not be used for the horizontal axis. The
semilogarithmic scale would not allow negative values.
Therefore, we used the 31st root as a compromise which
combines non-linearity similar to the logarithm and
possibility of displaying negative values.</p>
      <p>As expected, the histograms show relatively frequent
occurrences of averages with high absolute value in cases
of q = 0.5, 0.75, where the expectation does not exist. The
values are distributed approximately symmetrical with
respect to zero, verifying that no envelope appears “better”
and Argument 2 does not apply in practice, as predicted by
the theoretical analysis in previous sections.
We explained the two envelope paradox in its classical
form, as well as in two advanced instances in which the
players find rather convincing (and still insufficient)
probabilistic arguments for switching the envelopes. The latter
is our novel contribution to the discussion of the paradox.
We confirmed the following conclusion
“a perfectly rational player would simply
recognize that his subjective probabilities provide a</p>
      <p>
        misleading account using Bayesian decision
theory and would therefore ignore those results” [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
also in the case of nonexisting expectation, which was not
considered in the cited source.
      </p>
      <p>This topic has consequences in psychology, but it is also
important in economics because it explains behavior at
a market which is seemingly well-motivated, but in fact
wrong. Besides, this paradox can be a good example and
motivation for the study of statistics and information
theory.</p>
      <p>Acknowledgments. The first author was supported by the
Ministry of Education of the Czech Republic under Project
RVO13000.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bliss</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>A Concise Resolution to the Two Envelope Paradox</article-title>
          .
          <year>2012</year>
          , arXiv:
          <fpage>1202</fpage>
          .
          <fpage>4669</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Broome</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <source>The Two-envelope Paradox. Analysis</source>
          <volume>55</volume>
          (
          <year>1995</year>
          ):
          <fpage>6</fpage>
          -11 doi:10.1093/analys/55.1.
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Cover</surname>
            ,
            <given-names>T.M.</given-names>
          </string-name>
          :
          <article-title>Pick the largest number</article-title>
          . In: Cover,
          <string-name>
            <surname>T</surname>
          </string-name>
          , Gopinath,
          <string-name>
            <surname>B.</surname>
          </string-name>
          , Open Problems in Communication and Computation. Springer-Verlag,
          <year>1987</year>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Falk</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <source>The Unrelenting Exchange Paradox. Teaching Statistics</source>
          <volume>30</volume>
          (
          <year>2008</year>
          ),
          <fpage>86</fpage>
          -88 doi:10.1111/j.1467-
          <lpage>9639</lpage>
          .
          <year>2008</year>
          .
          <volume>00318</volume>
          .x
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Gerville-Réache</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Why do we change whatever amount we found in the first envelope: the Wikipedia "two envelopes problem" commented</article-title>
          . University of Bordeaux -
          <source>IMB UMR 52-51</source>
          ,
          <year>2014</year>
          , arXiv:
          <fpage>1402</fpage>
          .
          <fpage>3311</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Green</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The Two Envelope Paradox</article-title>
          .
          <year>2012</year>
          , http://www.aplusclick.com/pdf/ LeslieGreenTwoEnvelopes.pdf, 2017-
          <volume>06</volume>
          -03
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Jackson</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Menzies</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oppy</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>The two envelope “paradox”</article-title>
          ,
          <source>Analysis</source>
          <volume>54</volume>
          (
          <year>1994</year>
          )
          <fpage>43</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Nalebuff</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Puzzles: The Other Person's Envelope is Always Greener</article-title>
          .
          <source>Journal of Economic Perspectives</source>
          <volume>3</volume>
          (
          <year>1988</year>
          ):
          <fpage>171</fpage>
          -81 doi:10.1257/jep.3.1.
          <fpage>171</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Martinian</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>The Two Envelope Problem</article-title>
          . https: //web.archive.org/web/20071114230748/http: //www.mit.edu/~emin/writings/envelopes.html,
          <source>2017-06-03, archive version of an original from 2007-11- 14</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>McDonnell</surname>
            ,
            <given-names>M. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abbott</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Randomized switching in the two-envelope problem</article-title>
          .
          <source>Proceedings of the Royal Society A</source>
          <volume>465</volume>
          (
          <issue>2111</issue>
          ):
          <fpage>3309</fpage>
          -3322 doi:10.1098/rspa.
          <year>2009</year>
          .0312
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Priest</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Restall</surname>
          </string-name>
          , G.:
          <article-title>Envelopes and Indifference</article-title>
          , In: Dialogues, Logics and Other Strange Things, College Publications,
          <year>2007</year>
          ,
          <fpage>135</fpage>
          -
          <lpage>140</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Šindelárˇ</surname>
          </string-name>
          , J.:
          <source>Two Envelopes Problem. Preprint of Bachelor Thesis</source>
          , CTU, Prague,
          <year>2017</year>
          -
          <volume>05</volume>
          -04
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Schwitzgebe</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dever</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The Two Envelope Paradox and Using Variables Within the Expectation Formula</article-title>
          ,
          <string-name>
            <surname>Sorites</surname>
          </string-name>
          (
          <year>2008</year>
          )
          <fpage>135</fpage>
          -
          <lpage>140</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <article-title>Two envelopes problem</article-title>
          .
          <source>Wikipedia</source>
          ,
          <year>2017</year>
          -
          <volume>05</volume>
          -10, https://en.wikipedia.org/wiki/Two_envelopes_ problem
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>