A Tree Formulation for Signaling Games with Noise

The paper provides an analysis of a sender-receiver sequential signaling game. The private information of the sender is transmitted with noise by a Machine, i.e. does not always correctly reflect the state of nature. Hence, a truthful revelation by the sender of his information does not necessarily imply that the signal he sends is correct. Also, the receiver can take a correct action even if the sender transmits an incorrect signal. The payoffs of the two players depend on their combined actions. Perfect Bayesian Equilibria which can result from different degrees of noise is analysed. The Bayesian updating of probabilities is explained. The fixed point theorem which makes the connection with the idea of rational expectations in economics is calculated. Given a number of equilibria, we comment on the most credible one on the basis of the implied payoffs for both players. The equilibrium signals are an example of the formation of a language convention discussed by D. Lewis.


Introduction
In this paper we use the Lewis [1] formulation of signaling and base our model on our earlier paper (Dassiou and Glycopantis [2]), where we analysed a signaling game using a decision tree formation.The earlier paper presents a number of Bayesian equilibria and explains which one is likely to prevail using as a criterion the expected payoffs that they entail for the two players.A distinction between a true signal by a sender and a correct action by a receiver is established in terms of leading to different payoffs.A correct action by the receiver of a signal alone is not sufficient for leading to an equilibrium that involves maximum payoffs for both players.Moreover there are equilibria that do not involve maximum payoffs for either player.
Signaling games lead to the formation of language through combinations of signals and actions.In this paper we use the same signaling game as in [2].The helper, (H), referred to also as he, stands behind a truck gesturing to the driver, (D), referred to also as she, to help her steer the truck into a narrow parking space.We assume that Nature consists of the particular position of the truck and of the parking space and that there are two such alternatives, each with probability 1 2 .Unlike the earlier paper, the sender is no longer fully aware of the state of nature, but rather receives a message with a noise regarding this.While both players are aware of the probabilities attached to the choices of nature, H alone has private information (in the form of this message) and he signals to D to direct her how to park her car.
Lewis describes the signaling behaviour and the action that follows as a "conventional regularity" of unwritten rules of parking gestures, based on experience to which all parties conform.In terms of highest payoffs there is a common interest objective of H and D to get the truck into the space.In this situation they both receive their optimal payoffs.This is not always the case.A deviation from this rule, perhaps based on lack of trust, could lead to one or both of the two players getting inferior payoffs.In [2] there is a distinction between true or untrue signals sent by H and correct or incorrect actions by the driver.The issue is to investigate whether a "correct" interpretation of the signals is possible, i.e. one which would lead to an optimal payoffs equilibrium position.In such a situation no one would wish to independently change his action if all the information was revealed and moreover the payoffs would be optimal.
In general, we can imagine that there are n alternative states of nature,  , observed by the sender, H , who will send a signal concerning the private information (messages) he has received regarding the state of nature.The messages received by H are not precise, but correct with a probability . 1 q − The sender compiles a set of alternative signals 1 2 , , , , , This is an encoding rule according to Blume [3].The function H F translates (truthfully or not) the messages regarding the states of nature into n communicated signals.
The receiver, D , then has to choose a response without knowing the state of nature.However he is aware of the prior probabilities of these states and the accuracy of the sender's private information.In the sequential game, D translates these signals (decodes according to [3]).He chooses a best response k ρ , from alternative actions 1 2 , , , , ,   , to the signals.He applies Bayes' rule to form a posterior assessment that the signal comes from each state of nature by setting a decoding function . Rubinstein [4], notes the difficulty of formulating communication models into game theory models.Solutions in the latter are invariant to a change in the names of the actions that lead to these outcomes, i.e. alternative conventions leading to the same outcome.
A characteristic of the sender-signal-receiver-action sequential game paradigm is a plethora of equilibria.This raises the question of how to choose among such equilibria.Cho and Kreps [5] propose to eliminate some of these equilibria by branding them as "unintuitive".They restrict the out-of-equilbrium beliefs of the second party, D , i.e. interpretations that D would have given to the signal that H might have sent, but in equilibrium does not.Such beliefs might upset the given equilibrium.Cho and Kreps posit an intuitive explanation according to which the equilibrium introduces a self-reinforcing behaviour that is common knowledge among the players.By giving an emphasis to the equilibrium (outcome) payoffs any deviation from it is perceived as a conscious defection from the outcome.Therefore it needs to be justified on the basis of how it compares to that outcome.This emphasis carries on to our article in terms of choosing the most probable equilibrium outcome.
We assume that for each state of nature there is one action that has to be selected.To the best of our knowledge, the prevailing assumption in the literature is that if D takes the "correct" action then maximum payoffs will be received by both H and D irrespective of whatever signal H has sent.See, for example, [1], Pawlowitsch [6], Huttegger [7].This is a game of common interest in which a resolution leads to optimal payoffs for both actors as noted by Skyrms [8].
This type of analysis is not complete on two counts.First, there is little discussion of the case where the action of the receiver may be appropriate (e.g."correct") to the state of nature even if the signal sent is not.Second, there is no discussion of what happens to the payoffs of the two agents when this is the case.Lewis, and most recently philosophers like Stokke [9] make an attempt to discuss what constitutes "true" and "untrue" signals by a sender and responses in a signaling system.However there is no discussion of "truthfulness" in relation to "correctness".
Paper [2] departed from the assumption of a correct decision by the receiver leading to an optimal payoff for both.It distinguished between true signals (by H ) and correct actions (by D ).Unlike [1] and the majority of the subsequent literature, we noted that a correct action is not always the result of a truthful signal.D may still correctly guess the state of nature although H sends a "wrong" signal.A correct guess by D means that she will receive the maximum payoff.H will not if she has not truthfully revealed a signal that matches the true state of nature.Unlike [1], in our model a true signal is mutually rewarding if it leads to a correct decision by D but a correctly guessed state of nature by D is not necessarily so.We bind truthfulness (in the report of a signal) to a maximum payoff if accompanied by correctness, but the latter (in terms of the actions of D ) is not solely the result of a truthful signal.D may still correctly guess the state of nature although H sends a "wrong" signal i.e. one that deviates from what he has seen.In this case D receives the reward alone but H does not.If D ends up doing the incorrect thing then both get zero payoffs.
In our current paper of a signaling model with noise, H receives a message that does not necessarily match with the actual true state of nature.Therefore, there is a de-coupling of the truthful revelation of the received information in the form of a signal dispatched by H and whether this signal correctly reflects the state of nature.In other words, the delivery by H to D of a signal that does not match the true state of nature does not necessarily imply that the sender has been untruthful in revealing his signal.However, a signal that no longer reflects the true state of nature will imply a zero payoff for H .This is irrespective of whether or not it truthfully reflects the private information held by H and irrespective of whether D 's actions are correct or not.

On a Simple Signaling Model with Noise
We introduce the game theoretic analysis by considering a helper/driver example, as in our previous paper [2].As in the previous model, there are two players, a helper H , (he), who tries to direct a driver D , (she), to park her car."Nature" selects with probability 1 2 the state to be either "left" (L) or "right" (R).It is now assumed that player H picks up the correct state of nature with a noise indicated by probability .q We have again an imperfect information, non-cooperative signaling game, but this time it is rather more complicated, as the private information of H regarding the state of nature in not precise.We are using again a game theoretic extensive form, dynamic decision tree formulation and the notation for pure and mixed strategies is obvious and that of the previous paper.The vectors of payoffs are given at the terminal nodes of the tree.The first element is the payoff of H and the second that of D .
The rules for calculated payoffs are as follows.When H ends up sending the "correct" signal and the correct action, i.e. the one corresponding to the actual state of the world, follows by D , then both players receive a payoff of 1.If H communicates an incorrect signal and this leads to an incorrect action by D , then both players get 0. If H sends an incorrect signal and D reacts choosing to play in the opposite direction then D gets 1 for performing the correct action but H ends up with zero.
In [2] we made the connection between the resolution of the signaling game without any noise and the ideas of rational expectations (self-fulfilling prophesies) from economic theory, which provide a formal interpretation of the results of our analysis.The expectations of the actors are self-fulfilling and they both receive their optimal payoffs.This connection between the concepts from the neighbouring disciplines of game theory and economics can also be established in the present case in which the existence of noise in the signals makes the game tree formulation more involved.
The structure of the game, the uncertainties introduced, the payoffs and the rationality of the players are common knowledge.Both players, H and D , make rational decisions taking fully into account all the information which is common knowledge.The implications of their various strategies are clearly laid out.The players make rational predictions, (prophesies), of each others' actions and on this basis they act themselves.In the rational expectation equilibrium that results the predictions, that is the players' beliefs, are confirmed.The prophesies of the players are self-fulfilling.We give an explicit example of this below.
We are concerned with the analysis of the implications of the signals sent by H to D .The signal of nature and how it is read by the machine are both fixed with given probabilities and this is background information in the analysis.A machine picks up the signal from nature and transmits it to H .However, like all machines, it is not a 100% accurate.As the signal from nature goes to the machine it can be distorted.This means that if the machine shows on the screen "left" L′ , player H will know that the real state is L with probability 1 q − and that with probability q the real state is R .The situation is analogous if the machine shows on the screen "right" ( ) R′ .That is the machine could have distorted the original signal as it is transmitted on the screen.Player H will know that the real state is R with probability q − 1 , and L with probability q .If the machine is only a bit faulty, we say that q is the noise, due to the "trembling" hand of the machine.The smaller q is, the more accurate is the transmission.If the machine is very faulty then the possibility of distortion, q , is large and we still call this "noise", as a technical term.Of course for 0 q = we retrieve the previous model. 1he information sets I and the second to 4 I .As there is no risk of confusion, and in order to simplify matters, we use the same notation for the left and right moves from the nodes of information sets which belong to the same player.
H can play l or r , and D can play l′ or r′ .
In a pair of strategies for H the first refers to 1 I and the second to 2 I .In a pair of strategies for D the first refers to 3 I and the second to 4 I .We refer very briefly to two relevant equilibrium concepts in game theory.A Nash Equilibrium (NE) is a pair of strategies (actions) of the two players which are in terms of payoffs best replies to each other's.
A behavioural strategy assigns to the information sets of a player independent probability distributions to the actions available from those sets.The equilibrium concept of Perfect Bayesian Equilibrium (PBE) consists of a set of players' optimal behavioural strategies and consistent with these, a set of beliefs which attach a probability distribution to the nodes of each information set.Consistency requires that the decision from an information set is optimal given the particular player's beliefs about the nodes of this set and the strategies from all other sets, and that beliefs are formed from updating, using the available information.If the optimal play of the game enters an information set then updating of beliefs must be Bayesian.Otherwise appropriate beliefs are assigned arbitrarily to the nodes of the set.The PBE offers a dynamic interpretation of the solution noncooperative extensive form game.It makes use of the agents beliefs and it is a subset of NE.
The behavioural assumption is that every agent chooses his best strategy given the strategy of the other.That is, in effect, a reaction function is formed.If each player optimizes believing, (prophesyzing), a particular strategy for the other, and the outcome is that there is no reason for anybody to feel they have predicted wrongly, then we have an equilibrium which has been obtained rationally.The confirmation of the predictions takes places where the reaction functions intersect.
In terms of equilibria the distinction is between small 1 2 q < , and large 1 2 q > .In Figures 1-5, we have shown the optimal strategies of H and D with heavy lines. 2The calculations correspond to examples with q small Figure 1 and Figure 2), large, (Figure 3 and Figure 4) and equal to 1 2 (Figure 5).The expected payoffs, 1 E and 2 E , of the two players are also given.It is straightforward to check that the strategies form a Nash Equilibrium (NE).
The calculations, through Bayesian updating, of the conditional probabilities, (beliefs), attached to the nodes of the information sets are based on the strategies and thus we obtain a PBE.The beliefs are shown on the nodes of the information sets.With respect to 1 I and 2 I they express the fixed probabilities with respect to which     H believes that a signal is true of false. 3 In the end, we are interested in the players taking, from their information sets, decisions with probability one.In particular we want to analyse the case when H will instruct D , with probability 1, to turn "left" or "right" and D will also play a pure strategy.Eventually we want to know which combination of pure strategies is most likely to prevail, i.e. whether the signal of H will be truthful and if D will believe it.
Case 1. q is small.The optimal paths are shown in  , and we wish to calculate the beliefs attached to these by .D Using the Bayesian formula for updating beliefs, (see for example Glycopantis, Muir and Yannelis [10]), we can calculate these conditional probabilities.We know that 3 Pr Pr Pr Pr Pr Pr Pr Pr Pr Pr Pr 3 In order to simplify the graphs, only in Figure 1 we have inserted explicitly that the actions of the players from the information sets can be mixed with probabilities as follows: ( ) ( ) , 1 ; , , 1 ; , , 1 ; , l z r z ′ ′ − from 4 I .Exactly the same notation is assumed in all the graphs.Also, only in Figure 1 we insert the folded up tree following the optimal decisions of D .Corresponding folded up trees can be obtained for all other figures displayed.
Similarly we obtain the conditional probabilities ( ) Similarly we obtain the conditional probabilities Given q small, player H will follow in his action the state that he observes almost surely, expecting that D will realize this, and thus turn herself in the same direction.Essentially, H is punished if he fails to report the signal that he has seen on the screen.The noise it contains, means that despite the truthful revelation, it is not always a correct reflection of the true state of nature and hence the expected payoffs reflect this by being less than 1.
In terms of Figure 1, the prophesies which form a rational expectations equilibrium take the following form.
H prophesizes that when D hears ( ) l r she will believe that H has observed

( )
L R ′ ′ and therefore she will play ( ) l r ′ ′ because she knows that if she takes the correct decision she will get an optimum payoff.D prophezises that when H sees ( )

L R
′ ′ , given that the noise is small, he will repeat the message sent by the machine and play ( ) l r since if he transmits a correct signal he may get an optimum payoff, whereas if he transmits a signal that does not reflect the state of nature he will not irrespective of what D plays.
We shall now discuss how these rational decisions of the agents are locked in a fixed point.As optimal reactions to each other's actions they confirm themselves.
The fixed point equilibrium is characterized as follows.H plays from 1 I the choices l and r with probabilities which is maximized at 1 0 p = and 2 1 p = .On the other hand for 1 0 p = and 2 1 p = , we obtain ( )( ) ( ) ( ) which, given that q is small, is maximized at 1 0 z = and 2 1. z = Hence the the pairs 1 2 0, confirm each other as a fixed pair.Starting from one pair of rational decisions we go back and confirm it.
In terms of reaction functions the Kakutani fixed point theorem is seen as follows.Let ( ) , z z z = be the two vectors and R p the reaction functions (correspondences) of the helper and the driver respectively.The fixed point satisfies ( ) We have analyzed the equilibrium ( ) , lr l r ′ ′ .Inserting back in our calculations the fraction 1 2 , the resulting payoffs are 1 1 E q = − and 2 1 E q = − .The pair 1 1 E q = − and 2 1 E q = − are the best possible payoffs and hence the best candidates for optimality because each time H follows the message of the machine, i.e. he reports correctly, he is right with a high probability and D follows his suggestion.So with a high probability, 1 q − , both players get each time payoff 1.In expectation they get each time ( ) q − × and there are two such times.We discuss this further below.
We can provide some further explanation with respect to the expected payoffs.A folded up tree can be obtained through backward induction.We are using the optimal strategies of D given that 1 2 0, 1 z z = = .In the folded up tree of Figure 1 it is clear the H must use l from point 1 I and r from 2. Now, the PBE is a technical definition and as such it allows for other such equilibria as well.For example the following pairs of behavioural strategies ( ) and ( ) In Figure 2 we consider, in particular, the strategies ( ) , rl r l ′ ′ which also form a PBE, but with payoff lower for H than that corresponding to the pair ( ) , lr l r ′ ′ .We shall now discuss also for the pair ) , ( l r rl ′ ′ how these rational decisions of the agents form a fixed point and thus confirm themselves.
The fixed point equilibrium is found as follows.Again H plays from 1 I the choices l and r with probabilities z respectively.The mathematical analysis is supported by optimal decisions obtained by analyzing the graph.From Figure 2 we obtain the optimal decisions 1 1 p = , 2 0 p = , 1 1 z = and 2 0 z = If D chooses 1 1 z = and 2 0, z = then the resulting expected payoff for H is seen to be 1 0 E = irrespective of 1 p and 2 p .Therefore this value is also obtained 1 1 p = , 2 0 p = .On the other hand for 1 1 p = , 2 0 p = , we obtain, ignoring 1 2 , which is maximized at 1 1 z = and 2 0. z = Hence the the pairs 1 We have analyzed the equilibrium ( ) , rl r l ′ ′ .Inserting back in our calculations the fraction 1 2 , the resulting payoffs are 1 0 E = and 2 1 E q = − .In Figure 2 the beliefs of player D are given for both the points in the information set 3 I and those in 4 I .These are consistent with the moves up to these points and guarantee the optimality of the moves which follow.
We return now to the issue of the most likely equilibrium to prevail.From the four pure NE referred to above, it is easy to see that in the case of ( ) , ll l l ′ ′ and ( ) , rr r r ′ ′ the signal of H has zero informational content.Hence the "updated" beliefs of D in 3 I and 4 I are identical to the priors of the alternative states of nature.
This leads to equilibrium expected payoffs of 1 2 . Regarding ( ) , rl r l ′ ′ , we see that the expected payoff for H is zero.In other words, the sender will be punished for being untruthful in terms of revealing his private information regarding the state of nature as seen on the machine, as the probability that this is wrong is small.Hence if H misreports what he has seen on the machine, then he is likely to have send an incorrect signal regarding the state of nature.He will be punished for this with a zero payoff.Given this, player D can reasonably expect that H has an interest to report truthfully what he has seen on the machine.In cheap talk games speech serves the purpose of reinforcing a particular action and provides the evolutionary process rationale for choosing a particular equilibrium.Similarly, in a signaling game, D will believe that the sender will send him true information unless he has a reason to deceive him.Using the idea of rational expectations it is obvious that H has an interest to report the truth regarding his private information because failing to do so hurts him.Hence D can reasonably expect and correctly guess that he will signal truthfully.This leads to the formation of a language (signaling) convention between the players.Therefore, given q small, the equilibrium ( ) , lr l r ′ ′ in Figure 1 is the most likely to prevail, as it involves the maximum possible payoff for both H and D and hence is the best candidate for optimality in a repeated game of trial and error until a signaling convention is achieved.
Finally, we also consider a case of a pair of strategies which do not form a NE.As it is easy to see this is the case if in Figure 1 where all decisions are kept the same apart from changing for the driver l′ to r′ in , Case 2. q is large.The optimal paths are shown in Figure 3 and Figure 4.It is easy to check that the heavy lines strategies form a NE.In Figure 3 only the strategies of D are different.On the other hand, since the optimal actions of H are the same for both small and large q we shall be obtaining, through the Bayesian updating of conditional probabilities, the same beliefs for the nodes of 3 I and 4 I as in Figure 1.In the case of the equilibrium in Figure 3, H does not take into account the fact that the machine is so faulty that it is more often wrong than right and he gets punished for truthfully sending what is likely to be an incorrect signal.Player D does not believe the signal she received, turns in the correct direction and she is rewarded.As a result 1 0 E = and 2 E q = .In Figure 4 we show an alternative NE for large q and corresponding beliefs at the nodes of the information sets 3 I and 4 I and hence an alternative PBE to that in Figure 3.In this case both players make the correct move and they are both rewarded.Specifically, H reports the opposite of what he sees, and both him and D end up with payoffs 1 2 1 . 2 The pair 1 E q = and 2 E q = are the best possible payoffs and hence the best candidates for optimality.The machine is now very faulty and each time H makes a guess he does not follow its message, i.e. he misreports, and he is right with high probability and follows his suggestion.So with a high probability, q, both players get each time payoff 1.In expectation they get each time 1 1 2 q × and there are two such times.
Again for completeness, we also consider a case of a pair of strategies which do not form a NE.This is the case, as it is easy to see, if in Figure 3 all decisions are kept the same apart from changing for the driver l′ to r′ in 4 I .Finally we note that it is easy to see that in both Figure 3 and Figure 4 the actions of the optimal paths satisfy Kakutani's fixed point theorem and form a rational expectation equilibrium.Case 3.

q =
We can now have an equilibrium such that only information set 3 I or only 4 I , as shown in Figure 5, is visited.Suppose that the latter is the case.With respect to the arbitrary beliefs for 3 I which is not visited by the optimal strategies, we can adopt beliefs such that the optimal choice is r′ .
Coming now to 4 I , all its nodes are visited as player H plays constantly r .The beliefs through Bayesian updating are as follows.
Similarly we obtain the conditional probabilities ( ) ( ) ( ) We now have that D plays r′ from 3 I and ' l from 4 I , while H always plays .r We want to check that ( ) , rr r l ′ ′ is a NE.Given the strategies of one player we have to consider the alternative actions of the other.Given constant r , player D has made an optimal choice.For the response of H to r l ′ ′ of D , it is straightforward, inspecting the graph, that H cannot change a strategy and improve his payoff.Hence I .We shall now discuss how these rational decisions of the agents are locked in a fixed point.As optimal reactions to each other's actions they confirm themselves and the form a rational expectations equilibrium.
Suppose we consider 1 1 z = and 2 0 z = .These values mean that 1 0 E = irrespective of 1 p and 2 p , and therefore we can choose 1 1 p = and 2 1 p = which D takes as given and calculates, ignoring 1 2 , irrespective of 1 z and 2 z and therefore we can choose 1 1 z = , and 2 0. z = In fact, we have a multiplicity of equilibria as D could play instead r r ′ ′ .The pairs of strategies ( )

Further Discussion and Conclusions
We have analysed a sequential game concerning instructions and decisions to and by players, where nature selects a state and a machine transmits a noisy signal which is received by a helper, H .The latter decides whether to truthfully report this signal to a driver, D .For a small noise the equilibrium outcome, not the payoffs, is the same as in the case 0 q = discussed in the earlier paper, but for a large noise H will be punished for truthfully sending to D a false message.
With respect to payoffs, both players know that if the noise in the signal is small, announcements by H which are not reflective of the state of nature will lead to outcomes that will hurt them.The incentives of H and D are compatible in the sense that D can reasonably expect and correctly guesses that H has an incentive to truthfully report a signal, when that signal is likely to be a correct reflection of the state of nature.
In the case of a noisy signal H may receive an incorrect signal from the machine which he reports truthfully.Even if the final choice is correct, his expected payoff will in this case be zero.So truthfulness no longer automatically implies that a correct signal is sent.
As argued in [2], the assumption of an aligned interest between the helper, as the sender of a signal, and the driver as the receiver is found in much of the existing literature.The incentive of H to choose lr rather than rl no longer applies if H 's payoff is no longer dependent on being correct.This would make the helper careless in terms of his reporting.He knows that his payoff is dependent on the final outcome which is determined by the actions of the driver irrespective of whether his signal reflects the true state of nature.The result of this assumption is that the formation of a convention is made less likely.This will still hold true in the case of a noisy signal, as long as 1 2 q < .In contrast, in our model, H knows that the probability of his signal to D correctly reflecting the state of nature is more likely if he truthfully reports to D the signal he has received from the machine.Since being correct is a necessary condition for his getting a strictly positive payoff, the case is identical to the one discussed in [2] where 0 q = .In the case of a large q , the incentive of H to report a signal that correctly reflects the state of nature still applies.But in this case, it means that H has an incentive to report the opposite of what has been transmitted to him by the machine.In other words, it is not in the interests of H to truthfully report the message he has received by the machine (private information).By reporting exactly the opposite of what he sees, H is more often correct than not.Hence in this case there is an inverse relationship between correctness and truthfulness.
In both Case 1 and Case 2 we get a number of different PBE.Only one of these seems to be justified in providing an equilibrium which introduces a self enforcing behaviour and also provides an optimum outcome for both players.
In Case 3 there is also a number of equilibria.However from these only two PBE secure an optimum payoff for both players.These are the ones where both H and D make constant choices from both of their corresponding information sets.However unlike the PBE in Cases 1 and 2, these optimal payoffs do not exceed the default payoff of D choosing an randomly (i.e.

Figure 1 .
The information set 3 I contains the nodes, from left to right,

2 I the choices l and r with probabilities 2 1 p − and 2 p 4 I
respectively.D plays from 3 I the choices l′ and r′ with probabilities the choices l′ and r′ with probabilities

2 I the choices l and r with probabilities 2 1 p − and 2 p respectively. D plays from 3 I the l′ and r′ with probabilities 1 4 I
the choices l′ and r′ with probabilities each other as a fixed pair.Starting from one pair of rational decisions we go back and confirm it.

3 Ii
.e. the pair of strategies are ( ) , lr r r ′ ′ .In this case D can change from r′ in 3 I to l′ and improve her payoff.
Player H is punished if D decides to play l′ in 4

1 2 )
as the informational value of the signals by H is zero.
1 I and 2 I of H capture the fact that he does not know for sure that what he sees at the screen is a true reflection of the state of nature. 1 I corresponds to seeing L′ and 2 I to observing R′ .The information sets 3 I and 4 I belong to D and capture the fact that she hears l or r , respectively, but does not know what H saw on the screen (e.g.L′ or R′ ).The two players can also play "left" or "right".In a pair of strategies for H the first refers to 1 I and the second to 2 I .In a pair of strategies for D the first refers to 3 form also equilibria.In each of these case the beliefs at the nodes of the information sets of D are properly adjusted, but the payoffs of H and D are the same.Each time H makes a guess he has an equal chance to report or misreport the correct state of nature and when D responds she has an equal chance of discovering the true state of nature.Now, with respect to D , since she is rewarded for guessing correctly, she will always get expected payoff However the reward of H is calculated, as explained above, in a more complicated manner.He will only get a payoff of 1 if his signal coincides with the correct choice of D ; otherwise he gets 1 0. E = It is therefore possible that H gets payoff 0 because he has signaled the opposite of the action taken by D .On the other hand the latter by making a constant choice secures for himself payoff 2 Finally, we state a pair of strategies which do not form a NE.This is the case, as it is straightforward to see, of , rr l l ′ ′ .If D chooses l l ′ ′ then H can improve his payoff by switching to ll .