Next Article in Journal
Bayesian Social Learning with Local Interactions
Next Article in Special Issue
A Modal Logic of Epistemic Games
Previous Article in Journal
Modelling Social Dynamics (of Obesity) and Thresholds
Previous Article in Special Issue
The Role of Monotonicity in the Epistemic Analysis of Strategic Games
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Consistent Beliefs in Extensive Form Games

1
Department of Economics, University of Rochester, 214 Harkness Hall, Rochester, NY 14627, USA
2
Insper Institute of Education and Research, Rua Quatá, 300 - Vila Olímpia 04546-042, São Paulo, Brazil
Games 2010, 1(4), 415-421; https://doi.org/10.3390/g1040415
Submission received: 1 July 2010 / Revised: 26 September 2010 / Accepted: 15 October 2010 / Published: 20 October 2010
(This article belongs to the Special Issue Epistemic Game Theory and Modal Logic)

Abstract

:
We introduce consistency of beliefs in the space of hierarchies of conditional beliefs (Battigalli and Siniscalchi) and use it to provide epistemic conditions for equilibria in finite multi-stage games with observed actions.

1. Introduction

Battigalli and Sinischalchi [1] constructed the space of hierarchies of conditional beliefs and used it to provide epistemic foundations for solution concepts in dynamic games. We consider the question of consistency of beliefs in the space of hierarchies of conditional beliefs. In the space of hierarchies of beliefs, Aumann [2], Aumann and Brandenburger [3] and Barelli [4], among others, have used consistency of beliefs to provide epistemic foundations for solution concepts in games in normal form. Here we provide an analogous analysis for multi-stage games with observable actions, in the corresponding space of hierarchies of conditional beliefs. In particular, we show that consistency of beliefs and extensive form rationality provide epistemic foundations for correlated subgame perfect equilibrium (correlated SPE), and these two conditions, plus a notion of constancy of conjectures, provide epistemic foundations for subgame perfect equilibrium (SPE).1
The following simple example helps understand the ideas involved. Consider the standard Battle of Sexes game, with the payoff matrix below,
FO
F 2 , 1 0 , 0
O 0 , 0 1 , 2
The story is that the players decide simultaneously where to meet (either at a football game, F, or an opera house, O), and each player would rather go to the same place as the other, but has a preference for one venue over the other. Let A i = { F , O } for i = 1 , 2 and A = A 1 × A 2 . A correlated equilibrium for such a simultaneous move game is a Nash equilibrium of the game augmented by some payoff irrelevant state space, which is understood by both players. Consider, for instance, that each player chooses F if the weather is good, and chooses O otherwise (that is, they go to the outdoor event if the weather is good, and to the indoor event if the weather is not good). It is clear that such a strategy is a Nash equilibrium of the game augmented by the state space {good weather, weather not good}: if the other player uses the strategy, it is in the given player’s interest use it as well (if the weather is good (not good), a given player knows that the other will go to the football game (opera house), and will do well to go there too). Let p be the probability of the weather being good. Then the pair of strategies above gives rise to the distribution of joint actions η Δ ( A ) given by η ( F , F ) = p and η ( O , O ) = 1 p , and it is without loss to focus directly on such distributions in describing a correlated equilibrium. It suffices that, for each a i A i , the expected payoff of a i given η ( a i , · ) Δ ( A j ) , j i , is not smaller than the expected payoff of any other action a i , for i = 1 , 2 .
Now consider that the players play the game twice. That is, the players play the game once, observe its outcome, play it again, and get the sum of the payoffs obtained in each round. Let H = { } A denote the set of histories. The empty history represents the first round, and each of the four joint strategies in A represents a possible second round. Recall that a SPE is a Nash equilibrium of the entire game that induces Nash equilibria at each subgame. Analogously, a correlated SPE is a correlated equilibrium of the entire game that induces correlated equilibria at each subgame. It can be described as follows. Let η Δ ( A ) be a correlated equilibrium of the original Battle of the Sexes game, like the η described above. A correlated SPE is a list of probability distributions ( ν h ) h H with ν h Δ ( A ) for each h H , where ν h a correlated equilibrium for the continuation game at history h A and ν a correlated equilibrium of the one shot game given by the first round outcome and the contingent second round outcome, given ν h with h A . That is, each of the four continuation games is simply the original Battle of the Sexes game played after the first round. So a correlated equilibrium for a continuation game is a probability distribution η Δ ( A ) . In the first round, on the other hand, each joint action gives rise to a (potentially) different continuation strategy. So it is not a simple stage game as the games in the second round. But it can be viewed as an one-shot game, with payoffs given by the sum of what is obtained in the first round and of the conditional payoffs in the second round, given the correlated equilibria of the four potential continuation games. Then, for instance, ν h = η for all h H is a correlated SPE, because ν a ( = η ) is a correlated equilibrium of the continuation game after history h = a for each a A , and given the four continuation correlated moves ( ν a ) a A , ν ( = η ) is a correlated equilibrium of the game with payoffs u i ( a ) + u i ( η ) , where u i is player i’s stage game payoff and u i ( η ) is the expected payoff given η (so, in particular, the expected payoff given ν is simply u i ( η ) + u i ( η ) ). More complex correlated SPE involving different correlated continuation strategies can be constructed analogously.
Likewise, let η Δ ( A 1 ) × Δ ( A 2 ) be a joint distribution associated with a Nash equilibrium of the stage game. For instance, η ( F , F ) = η ( O , O ) = 2 9 , η ( F , O ) = 4 9 and η ( O , F ) = 1 9 , which is the joint distribution associated with the Nash equilibrium of the original Battle of the Sexes game in non degenerate mixed strategies. Then a list ( ν h ) h H with ν h = η for all h H is a SPE of the game, for the same reason as above. More complex SPE with different Nash equilibria of the continuation games can be constructed analogously.
Now let’s perform an epistemic analysis on the game, that is, an analysis of knowledge and beliefs of the players. In order to do so, we append a type structure ( T 1 , T 2 , g 1 , g 2 ) with g i , h Δ ( S × T j ) for each h H , where S = S 1 × S 2 with S i = { F , O } H for i = 1 , 2 . The beliefs of a type t i , ( g i , h ( t i ) ) h H form a conditional probability system (CPS), (the formal definitions are provided below). A “state" for a player is a strategy-type pair ( s i , t i ) , describing the player’s strategy choice and beliefs. Epistemic statements can now be stated in terms of the states of the players. For instance, let S i ( h ) be player i’s set of strategies consistent with history h H . Let η = η ( · | S j ( h ) ) h H , where η ( · | S j ( h ) ) Δ ( S j ( h ) ) for each h H . We say that s i is a best response to η, written s i r i ( η ) , if s i maximizes the expected utility with respect to η ( · | S j ( h ) ) for every history h consistent with s i . And we say that the strategy-type pair ( s i , t i ) S i × T i is rational if s i r i ( ( marg S j g i , h ( t i ) ) h H ) . Statements like “rationality is common knowledge among the players" can be described by a type structure where in each state ( s , t ) S 1 × S 2 × T 1 × T 2 both players are rational. Note that a type of a player determines the conditional beliefs at every history, and rationality captures sequentially rational choices, after every history (given the conditional beliefs).
Assume that the beliefs of the players are consistent in the following sense. There is a CPS ( μ h ) h H with μ h Δ ( S ( h ) × T ) for each h H , such that g i , h ( t i ) ( E × T j ) = μ h ( E × T | t i ) for all E S , t i T i and i = 1 , 2 . The idea is analogous to action-consistency in Barelli [4], which is a generalization of the standard common prior assumption. Because strategies are in principle verifiable entities, we can conceive of an outside observer offering bets on S, conditional on each history, where the payouts of the bets are measured in utils. The two players will be in a no-bets situation if there does not exist a bet that yields a sure gain to an outsider. In Barelli [4] it is shown that this is equivalent to consistency of beliefs, as defined above.
Now, if consistency and rationality obtain at every ( s , t ) S × T ,2 then we can identify a correlated SPE ( ν h ) h H from the CPS ( μ h ) h H by putting ν h ( a ) = μ h ( { s : s h = a } × T ) , for all a A . Indeed, if it is the case that beliefs are consistent and the CPS ( μ h ) h H satisfies μ h ( { s : s h = ( F , F ) } × T ) = p and μ h ( { s : s h = ( O , O ) } × T ) = 1 p for every h H , then it is straightforward to verify that rationality is obtained at every state, and that we obtain the correlated SPE described above. Indeed, rationality implies that no player wants to deviate from the recommended action, as required in a correlated SPE, and ( ν h ) h H is exactly the correlated SPE above. Other correlated SPE are analogously obtained as we vary the consistent CPS ( μ h ) h H . The key observation here is that, under consistency, rationality ensures that the system of inequalities defining a correlated SPE is met.
If instead μ h ( { s : s h = ( F , F ) } × T ) = μ h ( { s : s h = ( O , O ) } × T ) = 2 9 , μ h ( { s : s h = ( F , O ) } × T ) = 4 9 and μ h ( { s : s h = ( O , F ) } × T ) = 1 9 for every h H , then we again have rationality at every state, and the SPE described above is obtained. As in Aumann and Brandenburger [3] and Barelli [4], the key observation is that constancy of conjectures in the support of the CPS ( μ h ) h H ensures that ( μ h ( { s : s h = a } × T ) ) a A is the product of its marginals, just as above. So rationality, consistency and constancy of conjectures in the support of the CPS are sufficient conditions for a SPE. It is important to note that constancy of conjectures is implied by (but does not imply) conjectures being commonly known among the players.

2. Set Up

The set up is as in Battigalli and Siniscalchi [1]. Let X be a Polish space, and let A be its Borel sigma algebra. Let B A be a countable collection of clopen sets, with B . The collection B represents the relevant hypotheses. A CPS on ( X , A , B ) is a mapping μ ( · | · ) : A × B [ 0 , 1 ] satisfying: (i) μ ( B | B ) = 1 for all B B , (ii) μ ( · | B ) Δ ( X ) , and (iii) for all A A , B , C B , if A B C then μ ( A | B ) μ ( B | C ) = μ ( A | C ) .3 The set of CPSs on ( X , A , B ) is a closed subset of [ Δ ( X ) ] B , and it denoted by Δ B ( X ) .
Consider a finite multi-stage game G with observable actions (Fudenberg and Tirole [5], Chap. 3). Let H be the set of histories and let S i be the set of strategies s i : H A i , where A i is the set of all possible actions for player i I , and s i ( h ) A i ( h ) for each h H , where A i ( h ) is the set of actions available at h. Let u i : S R denote player i’s utility function, with S = × i I S i . As usual, we use A i = × j i A j and A = × i I A i (likewise for other sets, like T i , T i and T below.)
A correlated equilibrium of a finite normal form game ( A i , u i ) i I is a probability distribution η Δ ( A ) satisfying
a i A i [ u i ( a i , a i ) u i ( a i , a i ) ] η ( a ) 0
for all i I and all a i , a i A i . The interpretation is the one provided in the Introduction: the players use some external random device to peg their actions to, and assuming that the other players follow the recommended choices with the implied likelihoods, a given player has no incentive to deviate from his/her recommended choices. Because any such equilibrium generates a probability distribution over the joint actions, it is convenient to focus directly on such distributions (in the same way that a mixed strategy Nash equilibrium is defined directly on distributions, and not on the random variables that generate the distributions).
A correlated SPE of a finite multi-stage game with observed actions is given by ν = ( ν h ) h H , with ν h Δ ( A ( h ) ) , which induces correlated equilibria at every subgame. That is, for each history h we have a continuation game G ( h ) where the payoffs are defined for the histories that are consistent with h. Given h, we have a continuation correlated strategy ν | h , given by the restriction of ν to histories consistent with h. Then a correlated SPE is ν such that ν | h is a correlated equilibrium of G ( h ) for every h H . Standard dynamic programming arguments show that this is equivalent to the description provided in the Introduction. An SPE is a correlated SPE ν with ν h × i I Δ ( A i ( h ) ) for each h H .
Let S i ( h ) be player i’s set of strategies consistent with history h H , and let H ( s i ) be the set of histories consistent with s i . The relevant hypotheses for the players are thus the collection B = { S ( h ) : h H } . For a given player i, the hypotheses that are consistent with i’s strategies are B i = { S i ( h ) : h H } . As in Battigalli and Siniscalchi [1], we simplify notation by writing Δ B i ( · ) and Δ B ( · ) as Δ H ( · ) .
In order to perform an epistemic analysis, we append a type structure to the game, describing the beliefs of the players. A type space is a tuple T = ( T i , g i ) i I with g i : T i Δ H ( S × T i ) for each i I . Again, to simplify notation we write ( g i , h ( t i ) ) h H Δ H ( S × T i ) instead of ( g i , S ( h ) ( t i ) ) S ( h ) B Δ B ( S × T i ) .
Let η = η ( · | S i ( h ) ) h H Δ H ( S i ) . We say that s i is a best response to η, written s i r i ( η ) , if for all h H ( s i ) and s i S i ( h ) , we have
s i S i ( h ) [ u i ( s i , s i ) u i ( s i , s i ) ] η ( s i | S i ( h ) ) 0
We then say that a strategy-type pair ( s i , t i ) is rational if s i r i ( ( marg S i g i , h ( t i ) ) h H ) , and if s i S i ( h ) then g i , h ( t i ) ( { ( s i } × S i × T i ) = 1 . We say that player i is rational at state ( s , t ) S × T if the strategy-type pair ( s i , t i ) S i × T i is rational.
A CPS μ Δ H ( S × T ) is called a consistent prior if
μ h ( E × T ) = T i g i , h ( t i ) ( E × T i ) marg T i μ h ( d t i )
for all i I , all h H and all E S . It then follows that g i , h ( t i ) ( E × T i ) = μ h ( E × T | t i ) for all i I , all h H , all E S and marg T i μ h -a.e. t i . Let supp μ = h H supp μ h denote the support of the consistent prior. As advanced above, consistency is founded on players being in a no-bets situation, that is, a situation where an outside observer cannot make a sure gain on the group of players by offering bets on the strategy choices of the players. Proposition 5.3 in Barelli [4] establishes the equivalence between consistency and no-bets, and the reader is referred to that paper for further details.
For the sake of comparison with the literature, consider a finite normal form game G = ( A i , u i ) i I and a type space T = ( T i , λ i ) i I , with λ i ( t i ) Δ ( A × T i ) capturing hierarchies of beliefs. Player i is rational at state ( a , t ) if a i is a best response to his conjecture marg A i λ i ( t i ) and λ i ( t i ) ( { a i } × A i × T i ) = 1 . A common prior is a probability measure p Δ ( A × T ) such that λ i ( t i ) = p ( · | t i ) for marg T i p -a.e. t i . An action-consistent prior is a probability measure π Δ ( A × T ) such that marg A λ i ( t i ) = marg A π ( · | t i ) for marg T i π -a.e. t i . Aumann [2] showed that, when there is a common prior, common knowledge of rationality implies that players play a correlated equilibrium. Aumann and Brandenbuger [3] showed that common knowledge of rationality and of conjectures and the existence of a common prior are sufficient conditions for players to play a Nash equilibrium. These results were extended in Barelli [4] with the use of action-consistency in the place of common prior, rationality in the support of the action-consistent prior in the place of common knowledge of rationality and constancy of conjectures in the support of the action-consistent prior in the place of common knowledge of conjectures.
Note that the notion of consistency used here is much more demanding than using action-consistency in the normal form of the game. Consistency requires that players be at a no-bets situation after every history h H , whereas action-consistency allows for players to not be at a no-bets situation after histories that are not compatible with the strategy profiles in the support of the action-consistent prior. Players are required to be aware of a potential outsider at every counter factual that they envisage while choosing their strategies.

3. Results

For a given consistent prior μ, let ν = ( ν h ) h H be given by ν h ( a ) = marg S μ h ( s : s h = a ) for each a A ( h ) , so that ν h Δ ( A ( h ) ) . We have:
Proposition 1.
Let G be a finite multi-stage game with observed actions, and let T be a type space associated with G. Assume that there exists a consistent prior μ Δ H ( S × T ) such that player i is rational at all ( s , t ) supp μ , for every i I . Then ν defined above is a correlated SPE.
Proof. 
By consistency, we have marg S i g i , h ( t i ) = marg S i μ h ( · | t i ) for every i I , h H and t i supp marg T i μ h . By rationality we then have for each i I and every h H ( s i )
s i S i ( h ) [ u i ( s i , s i ) u i ( s i , s i ) ] marg S i μ h ( s i | t i ) 0
for every ( s i , t i ) and every s i S i ( h ) . Let η = ( η h ) h H with η h Δ ( S ( h ) ) be given by
η h ( s ) = T i ( s i ) marg S i μ h ( s i | t i ) marg T i μ h ( d t i )
where T i ( s i ) = { t i T i : ( s i , t i ) is rational } , so that
s i S i ( h ) [ u i ( s i , s i ) u i ( s i , s i ) ] η h ( s ) 0
for every i I , s i , s i in S i ( h ) and h H ( s i ) . Now notice that the restriction of ν to a history h H , ν | h , is the behavioral representation of η h . By Kuhn’s Theorem, the distribution over final outcomes induced by η h is the same as that induced by ν | h , so ν | h is a correlated equilibrium of the continuation game G ( h ) for every history h H , and we are done.
Let ϕ i , h ( t i ) = marg S i g i , h ( t i ) denote the conjecture of type t i at h H . We have:
Proposition 2.
Let G be a finite multi-stage game with observed actions, and let T be a type space associated with G. Assume that there exists a consistent prior μ Δ H ( S × T ) such that (i) player i is rational at all ( s , t ) supp μ for every i I and (ii) ϕ i , h ( t i ) = ϕ i , h ( t i ) for every i I for every t i , t i supp marg T i μ h , for each h H . Then ν defined above is a SPE.
Proof. 
Fix h H and let ϕ i , h be player i’s constant conjecture in the support of marg T i μ h . By consistency and rationality, we have for each s S ( h )
marg S μ h ( s ) = marg T i μ h ( T i ( s i ) ) ϕ i , h ( s i )
where T i ( s i ) is as in Proposition 1. Hence
marg S μ h = marg S i μ h marg S i μ h
Now induction in the number of players shows that marg S μ h = i I marg S i μ h , and a fortiori ν h × i I Δ ( A i ( h ) ) , for all h H . The result then follows from Proposition 1.

4. Conclusion

The results in section 3 tell us the following: under consistency, rationality yields correlated SPE and adding constancy of conjectures to these two conditions yield SPE. These results are analogous to the results in Aumann [2], Aumann and Brandenburger [3] and Barelli [4]. As in the latter, beliefs are required to be consistent only at events that are potentially observable by an outsider, who could in principle force beliefs to be consistent by offering bets on the observable events. Rationality and constancy of conjectures have to hold in the support of the consistent prior. Because rationality and/or constancy of conjectures are implied by (but do not imply) rationality and/or conjectures being commonly known among the players, we have that rationality need not be common knowledge for players to play a correlated SPE, and neither do conjectures have to be common knowledge for players to play a SPE.

References

  1. Battigalli, P.; Sinischalchi, M. Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games. J. Econ. Theory 1999, 88, 188–230. [Google Scholar] [CrossRef]
  2. Aumann, R. Correlated Equilibrium as an Expression of Bayesian Rationality. Econometrica 1987, 55, 1–18. [Google Scholar] [CrossRef]
  3. Aumann, R.; Brandenburger, A. Epistemic Conditions for Nash Equilibrium. Econometrica 1995, 63, 1161–1180. [Google Scholar] [CrossRef]
  4. Barelli, P. Consistency of Beliefs and Epistemic Conditions for Nash and Correlated Equilibria. Game. Econ. Behav. 2009, 67, 363–375. [Google Scholar] [CrossRef]
  5. Fudenberg, D.; Tirole, J. Game Theory; The MIT Press: Cambridge, MA, USA, 1992. [Google Scholar]
  • 1.For simplicity we deal only with finite multi-stage games with with observed actions, so sequential rationality is well captured by subgame perfection; the analysis can be generalized to include incomplete information and/or more complex information structures, where sequential equilibrium is the relevant equilibrium concept to capture sequential rationality.
  • 2.More precisely, if throughout the support of the CPS ( μ h ) h H defined above we have rational strategy-type pairs.
  • 3. Δ ( X ) denotes the space of probability measures on ( X , A ) .

Share and Cite

MDPI and ACS Style

Barelli, P. Consistent Beliefs in Extensive Form Games. Games 2010, 1, 415-421. https://doi.org/10.3390/g1040415

AMA Style

Barelli P. Consistent Beliefs in Extensive Form Games. Games. 2010; 1(4):415-421. https://doi.org/10.3390/g1040415

Chicago/Turabian Style

Barelli, Paulo. 2010. "Consistent Beliefs in Extensive Form Games" Games 1, no. 4: 415-421. https://doi.org/10.3390/g1040415

Article Metrics

Back to TopTop