Skip to main content
Log in

Game-Theoretic Pragmatics Under Conflicting and Common Interests

  • Original Article
  • Published:
Erkenntnis Aims and scope Submit manuscript

Abstract

This paper combines a survey of existing literature in game-theoretic pragmatics with new models that fill some voids in that literature. We start with an overview of signaling games with a conflict of interest between sender and receiver, and show that the literature on such games can be classified into models with direct, costly, noisy and imprecise signals. We then argue that this same subdivision can be used to classify signaling games with common interests, where we fill some voids in the literature. For each of the signaling games treated, we show how equilibrium-refinement arguments and evolutionary arguments can be interpreted in the light of pragmatic inference.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Such an approach is already suggested in Franke et al. (2012), but is here applied to a wider range of games with a conflict of interest.

  2. If, as we assume for costly signaling, a cost is incurred by the sender for each message sent, but this cost is not incurred by the receiver, then even if sender and receiver have common interests over the action taken by the receiver, strictly speaking we still have a conflict-of-interest game, because the receiver does not internalize the costs of sending messages. If the cost of sending a message is large, even though sender and receiver have common interests over the action taken by the receiver, it may be that while the separating PBE is best to the receiver, the pooling PBE is best to the sender. Yet, in Sect. 8, our interest is in small costs of sending a message. For simplicity, we still talk about a costly signaling common-interest game in this case.

  3. For this reason, contrary to the case in Bergstrom and Lachmann (1997), a pooling PBE can never be Pareto-superior to a separating PBE in our model.

  4. This as opposed to evolutionary game theory, which is treated below. The more common term for what we refer to here as standard game theory is non-cooperative game theory. We avoid this term here because the reader may find it confusing that non-cooperative game theory can perfectly analyze common-interest games.

  5. This formalization of neologism proofness in Definition 2 is based on Matthews et al. (1991).

  6. Note that the response when no message arrives is always the same as in the PBE, as R can then not observe that S has deviated from the PBE.

  7. In our simplified model of noise, it is only possible to receive a message or not to receive it. In a more complex model, messages may also be mistaken for one other. In this case, if each message sent can be mistaken for each other message, the neologism proofness criterion cannot be applied, as no out-of-equilibrium messages can be perceived.

  8. As pointed out in Matthews et al. (1991, p. 254), while Farrell’s assumption is intuitive, it is an extra-theoretical assumption, which is not in line with standard game theory: as long as the message set is countably infinite, a babbling equilibrium where S uses every possible message always exists.

  9. More formally, pooling-based neologism proofness (along with the pooling-based intuitive criterion) could be seen as reflecting the rationalizability of an equilibrium, after the computation of iterated best responses (see Franke 2009; Jäger and Ebert 2009; Jäger 2013). When not receiving a message, let R believe that a pooling PBE is played; this is plausible, as R when not receiving any information may consider himself as not having any information. Then S, knowing R’s beliefs, should only send a message when wanting R to do an action different from the one that is done in the pooling PBE. R in turn, putting himself in S’s shoes, when receiving a message should infer that S wants him to take another action than in the pooling PBE. Etc.

  10. Wärneryd (1993) earlier argued that only separating PBE are evolutionary stable in common-interest cheap-talk signaling games, but this is because he did not allow for mixed strategies.

  11. Hofbauer and Huttegger (2008) eliminate uninformative PBE in this manner, by allowing for evolutionary drift.

  12. The focus on which separating PBE evolves is also found in Benz et al. (2006). Their approach, however, is to compare the size of the basins of attraction of separating PBE.

  13. A related idea is Gilboa and Matsui’s (1991) concept of accessibility. They say that a strategy profile is accessible from another strategy profile if there exists a dynamic path under best response dynamics from the latter to the former. A set of strategy profiles is cyclically stable if every strategy profile in the set is accessible from every other strategy profile, and no strategy profile outside the set is accessible from any strategy profile within the set. An application of cyclically stable sets to cheap talk games is found in Matsui (1991).

  14. It should be noted that in a model with a continuum of actions, obfuscation is never possible. In the pooling PBE, R will never take the action with the very lowest label then. All S in a state with a label lower than the one of the action taken in the PBE have an incentive to reveal their state. Once they have done so, R adopts an action with a higher label when not receiving any evidence. This again gives S an incentive to reveal evidence in additional states of the world. By the unraveling argument, this process continues until all evidence is revealed (Milgrom 1981).

  15. In case (i), the pooling PBE is additionally attainable from the separating PBE where S sends m 1 (m 2) in state t 1 (t 2), and where R does a 2 with high probability when nothing is revealed. An alternative best response for R is to do a 1 when nothing is revealed, which is the equilibrium strategy in the pooling PBE. The separating PBE on the other hand is not attainable from the pooling PBE. Attainability thus predicts obfuscation in case (i).

  16. It is easy to generalize the model we present to make it closer to Glazer and Rubinstein (2001). In such a model, there are more than two cues determining which event occurs, and S can only communicate two cues. S could convince R that she is not only reporting two cues that are to her advantage if these two cues have focal features, such as lying close to each other.

  17. To construct such a model, it does not suffice that Romeo can only take two actions, namely an interpretation that Juliet loves Romeo, and an interpretations that she does not. In order to make the “I love you” message less attractive, one could let it be confounded more often for “I don’t love you”. In order for the “I love you” message to contain information, it must be more often interpreted as “I love you” than as “I don’t love you”. But then, the “I love you” message is always more attractive to Juliet.

  18. A similar problem, where only a signaling system is credible, is described by Matthews et al. (1991, p.256). Consider a simple common interest cheap-talk signaling game with two states of the world and three actions. Let R take an action in the pooling PBE which is never taken in the separating PBE, and which in both states of the world leaves S worse off than in the separating PBE. Then the pooling PBE is neologism proof, because S in both states of the world has an incentive to pretend to be any type. Yet, it still seems intuitive that a separating PBE would be played. For this reason, the authors develop the equilibrium selection criterion of announcement proofness, which refers to the credibility of the whole signaling system.

  19. Blume (2010) shows that allowing for correlated equilibria allows for Pareto improvements in the Crawford and Sobel (1982) model. Yet, Forges’ (1988) proof of equivalence between correlated equilibria and equilibria arising through noisy communication does not extend to a signaling model with continuous types and continuous actions.

  20. This means that we only consider errors of detection, where messages may get lost, and not errors of discrimination, where one message may be confounded for another message. More generally, one could consider for each message sent any combination, for each of the two messages sent, of distributions over the messages m 0, m 1 and m 2 perceived by the receiver, such that the receiver wants to do a 1 when receiving message m 1, a 2 when receiving message m 2, and a 3 when receiving m 0 (for a general treatment for any number of states of the world, see Hernández and Von Stengel 2012). As shown by Forges (1988) and Myerson (1991), the set of all such combinations of distribution functions is equivalent to the set of all correlated separating equilibria of this game, and includes a correlated equilibrium replicating the mixed Nash equilibrium, where R randomizes between doing a 1 and a 3 when receiving m 1, and S in t 2 randomizes between sending m 1 and m 2. This means that using noisy messages boils down to the same as S and R each using a randomization device, where there may be correlation between the events generated by their correlation devices, to decide what to do.

  21. The partial separating PBE is neologism proof here, as is the case for all separating PBE that we describe in this paper. For Crawford and Sobel’s (1982) original model with a continuum of states of the world and a continuum of actions, this result is not general. In fact, none of their partial separating PBE are neologism proof. This is because, in terms of our model, if there is a continuum of actions, S has an incentive to send a neologism in the states of the world with the lowest labels, whereas in other states of the world S does not have any such incentive. The neologism would seem to lead to more precision, yet no partial separating PBE may exist allowing for such precision, as is illustrated by the fact that the most informative partial separating PBE is not neologism proof. Because of this result, a set of alternative equilibrium selection arguments have been developed in the literature, which still select the most informative partial separating PBE in Crawford and Sobel’s model. E.g. Chen et al. (2008) construct an equilibrium selection argument based on the observation that in all inefficient partial separating PBE in Crawford and Sobel, S in the state with the highest label prefers revealing her type (if somehow she could) to the equilibrium outcome. For a further recent example, see De Groot Ruiz et al. (2011), which also contains a literature overview of further equilibrium selection arguments for cheap-talk signaling games dealing with this issue.

    The reason that this issue does not arise in our model, is that we have discrete actions. In our neologism-proof partial separating PBE, R takes the action with the lowest possible label, so that there is no incentive for S in the state of the world with the lowest label to send a neologism.

  22. It should be noted that Grice (1967) himself argues that in this example, the person asking the question should conclude that the person giving the answer simply does not know where exactly in the South of France C lives. This is because Grice assumes a context with common interests between S and R.

  23. It is tempting to conclude that the receiver of the weather forecast would conclude from a message “It is 22 °C or more” that it is 22 °C, reasoning that if it is 24 °C, the forecaster would simply report this. But this problem with this argument is that the forecaster also has an incentive to tell that it is 24 °C when in fact it is 22 °C.

  24. In the case of costly signaling, R is indifferent about whether the cheapest messages are used, and whether more expensive messages are used in infrequent states. Yet, as S is not indifferent, separating PBE where messages are not used in an inefficient way from S’s point of view are also Pareto-inefficient.

  25. Recall that an outcome is Pareto-efficient if there is no other outcome that makes every player at least as well off and at least one player strictly better off. A PBE need not be Pareto-efficient.

  26. In a model where both messages m 1 andm 2 are available, if \( \pi_{1} < \pi_{2} \) the pooling PBE also is not neologism proof. Yet, occasional use of the neologism m 2 does not suffice to escape the pooling PBE. This is reflected by the fact that the separating PBE is now not attainable from the pooling PBE.

  27. We are grateful to one of the referees for this formulation.

  28. This follows a tradition going back to Zipf (1949), who argues that language follows economic principles.

  29. De Jaegher et al. (2008) carry out a laboratory experiment on costly signaling common-interest games which tests the conditions in Proposition 7, both parts (i) and (ii). Participants predominantly play the efficient separating equilibrium, independent of the form of the pooling PBE. However, when sending a message is costless, the form of the pooling PBE does play a role in the kind of separating PBE that is achieved.

  30. E.g. if the distribution of a random variable follows a bell-shaped density function, and if only a limited number of messages can be used to refer to the realized value of the variable, then more messages should be used for levels around the mean, where these messages then refer to a narrow range of values; less messages should be used for ranges in the tails of the distribution, where these messages then refer to a wide range of values.

  31. A different intuition for using a limited number of messages in a common interest context is found in Nowak et al. (1999). If using more messages means using messages that lie closer to one another, and if messages that lie close to another are more often confused for one another, then it is better to use fewer messages.

  32. We also paid attention to evolutionary game theory, which deals with completely unsophisticated players; the players in behavioral game theory can be considered as positioned somewhere between the hyper-sophisticated players of standard game theory, and the completely unsophisticated players of evolutionary game theory. The focus of the present paper on either hyper-sophisticated or completely unsophisticated players makes sense, as the predicted outcome is often the same, as witnessed by the fact that the predictions of pooling-based neologism proofness and of the pooling-based intuitive criterion on the one hand, and of attainability on the other hand, often coincide.

References

  • Battaglini, M. (2002). Multiple referrals and multidimensional cheap talk. Econometrica, 70, 1379–1401.

    Article  Google Scholar 

  • Benz, A., Jäger, G., & van Rooij, R. (2006). An introduction to game theory for linguists. In A. Benz, G. Jäger, & R. van Rooij (Eds.), Games and pragmatics (pp. 1–83). London: Palgrave Macmillan.

    Google Scholar 

  • Bergstrom, C. T., & Lachmann, M. (1997). Signalling among relatives. I. Is costly signalling too costly? Philosophical Transactions of the Royal Society of London, 352, 609–617.

    Article  Google Scholar 

  • Blume, A. (2010). Correlated equilibria in sender-receiver games. Working paper, University of Pittsburgh.

  • Blume, A., & Board, O. (2013). Intentional vagueness. This volume.

  • Blume, A., Board, O. J., & Kawamura, K. (2007a). Noisy talk. Working paper.

  • Blume, A., Board, O. J., & Kawamura, K. (2007b). Noisy talk. Theoretical Economics, 2, 395–440.

    Google Scholar 

  • Blume, A., Kim, Y.-G., & Sobel, J. (1993). Evolutionary stability in games of communication. Games and Economic Behavior, 5, 547–575.

    Article  Google Scholar 

  • Chakraborty, A., & Harbaugh, R. (2007). Comparative cheap talk. Journal of Economic Theory, 132, 70–94.

    Article  Google Scholar 

  • Chen, Y., Kartik, N., & Sobel, J. (2008). Selecting cheap-talk equilibria. Econometrica, 76, 117–136.

    Article  Google Scholar 

  • Cho, I. K., & Kreps, D. (1987). Signaling games and stable equilibria. Quarterly Journal of Economics, 102, 179–222.

    Article  Google Scholar 

  • Crawford, V. P., & Sobel, J. (1982). Strategic information transmission. Econometrica, 50, 1431–1451.

    Article  Google Scholar 

  • Crémer, J., Garicano, L., & Prat, A. (2007). Language and the theory of the firm. Quarterly Journal of Economics, 122, 373–407.

    Article  Google Scholar 

  • Groot Ruiz, A. de Offerman, T., & Onderstal, S. (2011). Equilibrium selection in cheap talk games: ACDE rocks when other criteria remain silent. Working paper, University of Amsterdam.

  • De Jaegher, K. (2003a). Error-proneness as a handicap signal. Journal of Theoretical Biology, 224, 139–152.

    Article  Google Scholar 

  • De Jaegher, K. (2003b). A game-theoretic rationale for vagueness. Linguistics and Philosophy, 26, 637–659.

    Article  Google Scholar 

  • De Jaegher, K. (2006). Game-theoretic grounding. In A. Benz, G. Jäger, & R. van Rooij (Eds.), Games and pragmatics (pp. 220–247). London: Palgrave Macmillan.

    Google Scholar 

  • De Jaegher, K. (2008a). The evolution of Horn’s rule. Journal of Economic Methodology, 15, 275–284.

    Article  Google Scholar 

  • De Jaegher, K. (2008b). Efficient communication in the electronic mail game. Games and Economic Behavior, 63, 468–497.

    Article  Google Scholar 

  • De Jaegher, K., Rosenkranz, S., & Weitzel, U. (2008). Economic laboratory experiment on Horn’s rule. Working paper 08–27, Utrecht University.

  • De Jaegher, K., & van Rooij, R. (2011). Strategic vagueness and appropriate contexts. In A. Benz, C. Ebert, G. Jäger, & R. van Rooij (Eds.), Language, games and evolution—Trends in current research on language and game theory (pp. 40–59). Heidelberg: Springer.

    Google Scholar 

  • Farrell, J. (1993). Meaning and credibility in cheap-talk games. Games and Economic Behavior, 5, 514–531.

    Article  Google Scholar 

  • Forges, F. (1988). Can sunspots replace a mediator? Journal of Mathematical Economics, 17, 347–368.

    Article  Google Scholar 

  • Franke, M. (2008). What is game theoretic pragmatics? Unpublished manuscript, University of Amsterdam.

  • Franke, M. (2009). Signal to act—Game theory in pragmatics. Amsterdam: ILLC Dissertation Series.

    Google Scholar 

  • Franke, M. (2013). Pragmatic reasoning about unawareness. This volume.

  • Franke, M., & de Jager, Tikitu. (2011). Now that you mention it—Awareness dynamics in discourse and decisions. In A. Benz, C. Ebert, G. Jäger, & R. van Rooij (Eds.), Language, games and evolution—Trends in current research on language and game theory (pp. 60–91). Heidelberg: Springer.

    Google Scholar 

  • Franke, M., de Jager, Tikitu., & van Rooij, Robert. (2012). Relevance in cooperation and conflict. Journal of Logic and Computation, 22, 23–54.

    Article  Google Scholar 

  • Gilboa, I., & Matsui, A. (1991). Social stability and equilibrium. Econometrica, 58, 859–867.

    Article  Google Scholar 

  • Glazer, J., & Rubinstein, A. (2001). Debates and decisions: On a rationale of argumentation rules. Games and Economic Behavior, 36, 158–173.

    Article  Google Scholar 

  • Grafen, A. (1990). Biological signals as handicaps. Journal of Theoretical Biology, 144, 517–546.

    Article  Google Scholar 

  • Grice, H. P. (1957). Meaning. Philosophical Review, 66, 377–388.

    Article  Google Scholar 

  • Grice, H. P. (1967). Logic and Conversation. William James Lectures. Reprinted in H. P. Grice (1989) Studies in the way of words (pp. 22–40). Cambridge: Harvard University Press.

  • Hernández, P., & von Stengel, B. (2012). Nash codes for noisy channels. Working paper, University of Valencia.

  • Hofbauer, J., & Huttegger, S. M. (2008). Feasibility of communication in binary signaling games. Journal of Theoretical Biology, 254, 843–849.

    Article  Google Scholar 

  • Horn, L. (1984). Towards a new taxonomy of pragmatic inference: Q-based and R-based implicature. In D. Schiffrin (Ed.), Meaning, form, and use in context: Linguistic applications (pp. 11–42). Washington, DC: Georgetown University Press.

    Google Scholar 

  • Hurd, P. (1995). Communication in discrete action-response games. Journal of Theoretical Biology, 174, 217–222.

    Article  Google Scholar 

  • Huttegger, S. M. (2007). Evolution and the explanation of meaning. Philosophy of Science, 74, 1–27.

    Article  Google Scholar 

  • Huttegger, S. M., & Zollman, K. J. S. (2011). Signaling games—Dynamics of evolution and learning. In A. Benz, C. Ebert, G. Jäger, & R. van Rooij (Eds.), Language, games and evolution—trends in current research on language and game theory (pp. 160–176). Heidelberg: Springer.

    Google Scholar 

  • Jäger, G. (2008). Evolutionary stability conditions for signaling games with costly signals. Journal of Theoretical Biology, 253, 131–141.

    Article  Google Scholar 

  • Jäger, G. (2011). Game-theoretical pragmatics. In J. van Benthem & A. ter Meulen (Eds.), Handbook of logic and language (2nd ed., pp. 467–491). Amsterdam: Elsevier Science.

    Chapter  Google Scholar 

  • Jäger, G. (2013). Rationalizable signaling. This volume.

  • Jäger, G., & Ebert, C. (2009). Pragmatic rationalizability. In A. Riester & T. Solstad (Eds.), Proceedings of Sinn und Bedeutung 13 (pp. 1–15). Stuttgart: Opus.

    Google Scholar 

  • Jäger, G., Metzger, L. P., & Riedel, F. (2011). Voronoi languages: Equilibria in cheap-talk games with high-dimensional types and few signals. Games and Economic Behavior, 73, 517–537.

    Article  Google Scholar 

  • Johnstone, R. A. (1997). The evolution of animal signals. In J. R. Krebs & N. B. Davies (Eds.), Behavioural ecology (pp. 155–178). Oxford: Blackwell.

    Google Scholar 

  • Kreps, D. M., & Wilson, R. (1982). Sequential equilibria. Econometrica, 50, 863–894.

    Article  Google Scholar 

  • Matsui, A. (1991). Cheap talk and cooperation in a society. Journal of Economic Theory, 54, 245–258.

    Article  Google Scholar 

  • Matthews, S. A., Okuno-Fujiwara, M., & Postlewaite, A. (1991). Refining cheap-talk equilibria. Journal of Economic Theory, 55, 247–273.

    Article  Google Scholar 

  • Milgrom, P. (1981). Good news and bad news: Representation theorems and applications. Bell Journal of Economics, 13, 380–391.

    Article  Google Scholar 

  • Myerson, R. B. (1991). Game theory—Analysis of conflict. Cambridge: Harvard University Press.

    Google Scholar 

  • Nowak, M. A., Krakauer, D. C., & Dress, A. (1999). An error limit for the evolution of language. Proceedings: Biological Sciences, 266, 2131–2136.

    Google Scholar 

  • Parikh, P. (1991). Communication and strategic inference. Linguistics and Philosophy, 14, 473–513.

    Article  Google Scholar 

  • Parikh, R. (1994). Vagueness and utility: The semantics of common nouns. Linguistics and Philosophy, 17, 521–535.

    Article  Google Scholar 

  • Parikh, P. (2000). Communication, meaning, and interpretation. Linguistics and Philosophy, 23, 185–212.

    Article  Google Scholar 

  • Parikh, P. (2001). The use of language. Stanford: CSLI Publications.

    Google Scholar 

  • Pawlowitsch, C. (2008). Why evolution does not always lead to an optimal signaling system. Games and Economic Behavior, 63, 203–226.

    Article  Google Scholar 

  • Schelling, (1960). The analysis of conflict. Cambridge: Harvard University Press.

    Google Scholar 

  • Spence, M. (1973). Job market signaling. Quarterly Journal of Economics, 87, 355–374.

    Article  Google Scholar 

  • van Rooij, R. (2004). Signaling games select Horn strategies. Linguistics and Philosophy, 27, 493–527.

    Article  Google Scholar 

  • van Rooij, R. (2006). Optimality-theoretic and game-theoretic approaches to implicature. In. E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy. Retrieved from www.plato.stanford.edu).

  • van Rooij, R. (2008). Games and quantity implicatures. Journal of Economic Methodology, 15, 261–274.

    Article  Google Scholar 

  • Wärneryd, K. (1993). Cheap talk, coordination and evolutionary stability. Games and Economic Behavior, 5, 532–546.

    Article  Google Scholar 

  • Zahavi, A. (1975). Mate selection—A selection for handicap. Journal of Theoretical Biology, 53, 205–214.

    Article  Google Scholar 

  • Zipf, G. (1949). Human behavior and the principle of least effort. Cambridge: Addison-Wesley.

    Google Scholar 

Download references

Acknowledgments

We would like to thank participants of the Conference on Game Theory and Communication, Stanford University, May 28–29, 2009, for helpful comments. Special thanks is due to Alistair Isaac and two anonymous referees for detailed comments. Any remaining mistakes are our own.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kris De Jaegher.

Appendix: Proofs

Appendix: Proofs

Proof of Proposition 1

(i)–(ii) In a pooling PBE where R always does a 1 (a 2), S in state t 2 (t 1) can only send m 0. Given the condition on R’s payoffs, if S in state t 1 (t 2) sends m 1 (m 2) with sufficiently low probability, R will continue to always do a 1 (a 2). A pooling PBE where R always does a 2 can only be maintained if R believes that m 1 comes from t 2. Yet, as soon as m 1 is sent with small probability, such beliefs cannot be maintained. It follows that such a pooling PBE is not a sequential equilibrium. A pooling PBE where R always does a 1 can be maintained if R believes that m 1 (m 2) comes from t 1 (t 2). This is therefore a sequential equilibrium.

(iii) Let R do a 1 when receiving m 0. Then S sends m 0 in t 2, and we cannot have a separating PBE. It follows that in any separating PBE, if m 0 is sent, it can only be followed by a 2. In turn, it follows that S in t 1 always sends m 1 in a separating PBE. S in t 2 may mix in any sort of way between sending m 0 and m 2. Further, in a pooling PBE as under (ii), an alternative best response for R to S’s strategy is to do a 1 (a 2) upon m 1 (m 2), and a 2 upon m 0, which is in line with R’s best response in the separating PBE. It follows that separating PBE are attainable from the pooling PBE under (ii). Finally, in a pooling PBE as under (i), given that a 1 is done upon m 0, no separating PBE is attainable from this pooling PBE. □

Proof of Proposition 2

Let S send a message \( m_{i}^{1} \) for whatever cue i takes on a value of 1. Then R prefers to do a 2 given that

$$ \begin{aligned} & \frac{{2x(1 - x)u_{R} \left( {t_{2} ,a_{2} } \right) + (1 - x)^{2} u_{R} \left( {t_{1} ,a_{2} } \right)}}{{2x(1 - x) + (1 - x)^{2} }} > \frac{{2x(1 - x)u_{R} \left( {t_{2} ,a_{1} } \right) + (1 - x)^{2} u_{R} \left( {t_{1} ,a_{1} } \right)}}{{2x(1 - x) + (1 - x)^{2} }} \\ & \quad \Leftrightarrow \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} > \frac{(1 - x)}{2x} \\ \end{aligned} $$

It follows that there is no separating PBE where S sends a message \( m_{i}^{1} \) for whatever cue takes on a value of 1.

S can instead employ a strategy where she only sends \( m_{i}^{1} \) if a particular cue i takes on a value of 1, randomizes in any sort of way about sending \( m_{i}^{2} \) or m 0 when i takes on a value of 2, and never sends messages \( m_{j}^{1} \) or \( m_{j}^{2} \). If R now observes \( m_{i}^{1} \), it is a best response for him to do a 1 iff

$$ \begin{aligned} & \frac{{x(1 - x)u_{R} \left( {t_{2} ,a_{1} } \right) + (1 - x)^{2} u_{R} \left( {t_{1} ,a_{1} } \right)}}{{x(1 - x) + (1 - x)^{2} }} > \frac{{x(1 - x)u_{R} \left( {t_{2} ,a_{2} } \right) + (1 - x)^{2} u_{R} \left( {t_{1} ,a_{2} } \right)}}{{x(1 - x) + (1 - x)^{2} }} \\ & \quad \Leftrightarrow \frac{(1 - x)}{x} > \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} \\ \end{aligned} $$

When receiving \( m_{i}^{2} \) or m 0, it is a best response for R to do a 2, as given S’s equilibrium strategy, this automatically means that event t 2 occurs. Further, given that S does not send \( m_{j}^{1} \) or \( m_{j}^{2} \), it is a weak best response for R to do a 2 whenever one of these messages is received.

In turn, given that R does a 1 when receiving \( m_{i}^{1} \) and a 2 otherwise, it is a weak best response for S never to send \( m_{j}^{1} \) or \( m_{j}^{2} \) and m 0 or \( m_{i}^{2} \) when cue i has a value of 2, and a strict best response to send \( m_{i}^{1} \) when cue i has a value of 1.

In any pooling PBE, response a 2 is adopted as \( \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} > \frac{{\pi_{1} }}{{\pi_{2} }} \), where \( \frac{{\pi_{1} }}{{\pi_{2} }} = \frac{{(1 - x)^{2} }}{{2x(1 - x) + x^{2} }} \). This is because we have assumed that \( \frac{(1 - x)}{2x} < \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} \), and because \( \frac{(1 - x)}{2x} > \frac{{(1 - x)^{2} }}{{2x(1 - x) + x^{2} }} \). The pooling PBE is Pareto-inefficient as each player is better off in the specified partial separating PBE. A pooling PBE where S always sends m 0 is a sequential equilibrium, as a message \( m_{i}^{1} \) can always have come from S who observed value 2 for cue j. Further, such a pooling PBE meets the intuitive criterion, as it is not the case that only S who observes event t 1 could benefit from sending \( m_{i}^{1} \). The specified partial separating PBE is attainable from the pooling PBE where S always sends m 0, because it is a best response for R to S’s strategy in this pooling PBE to plan to do a 2 when receiving \( m_{j}^{1} \), \( m_{j}^{2} \), \( m_{i}^{2} \) or m 0, and to plan to do a 1 when receiving \( m_{i}^{1} \), as in the partial separating PBE. □

Proof of Proposition 3

If S plays the strategy of the specified candidate separating PBE, it is a best response for R to do a 1 when receiving message m, and to do a 2 otherwise. If R plays the strategy of the specified candidate separating PBE, it is a best response for S to send message m in state t 1 and not to send m 0 in state t 2 iff \( u_{S} \left( {t_{2} ,a_{2} } \right) \ge u_{S} \left( {t_{2} ,a_{1} } \right) - C\left( {t_{2} ,m} \right) \) and \( u_{S} \left( {t_{1} ,a_{1} } \right) - C\left( {t_{1} ,m} \right) \ge u_{S} \left( {t_{1} ,a_{2} } \right) \). The conditions follow.

Under (i), the pooling PBE is neologism proof and meets the intuitive criterion because S in t 1 already obtains her most preferred response a 1 without sending a message. For the same reason, while sending a message is dominated for S in t 2, the pooling PBE survives dominance.

Under (ii), the pooling PBE is not neologism proof, does not meet the intuitive criterion, and is eliminated by dominance. Only S in t 1 benefits from deviating from the pooling PBE by sending m; moreover, sending m rather than m 0 is dominated for S in t 2. The results on attainability and on pooling-based neologism proofness and pooling-based intuitive criterion now follow straightforwardly. □

Proof of Proposition 4

We first show that under the given condition, the pooling PBE takes on the form given under (i).

$$ \begin{aligned} & \pi_{1} u_{R} \left( {t_{1} ,a_{3} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{3} } \right) \ge \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{1} } \right) \\ & \quad \Leftrightarrow \pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right] \ge \pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right] \\ & \quad \Leftrightarrow \frac{{\pi_{2} }}{{\pi_{1} }} \ge \frac{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}} \\ \end{aligned} $$
(6)
$$ \begin{aligned} & \pi_{1} u_{R} \left( {t_{1} ,a_{3} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{3} } \right) \ge \pi_{1} u_{R} \left( {t_{1} ,a_{2} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) \\ & \quad \Leftrightarrow \pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right] \ge \pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right] \\ & \quad \Leftrightarrow \frac{{\left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right]}} \ge \frac{{\pi_{2} }}{{\pi_{1} }} \\ \end{aligned} $$
(7)

Combining (6) and (7), the condition for R’s utility function stated in the proposition is obtained. The pooling PBE where R does a 3 in any event is neologism proof: S in both states of the world prefers to send any message m 1 that leads R to do a 1 with positive probability, rather than to send message m 0.

We now show the existence of the separating PBE in (ii). When not receiving any signal, R should prefer to do a 3 to a 1:

$$ \begin{aligned} & \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{1} ,a_{3} } \right) + \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{2} ,a_{3} } \right) \\ & \quad \ge \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{1} ,a_{1} } \right) + \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{2} ,a_{1} } \right) \\ & \quad \Leftrightarrow \pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]\mu \left( {\left. {m_{0} } \right|m_{2} } \right) \ge \pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right]\mu \left( {\left. {m_{0} } \right|m_{1} } \right) \\ \end{aligned} $$
(8)
$$ \Leftrightarrow \frac{{\mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\mu \left( {\left. {m_{0} } \right|m_{1} } \right)}} \ge \frac{{\pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right]}}{{\pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}, $$
(9)

where the right-hand side in (9) is smaller than 1. It follows from (9) that a separating PBE can only exist if \( \mu \left( {\left. {m_{0} } \right|m_{2} } \right) > 0 \). Also, when not receiving any signal, R should prefer to do a 3 to a 2:

$$ \begin{aligned} & \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{1} ,a_{3} } \right) + \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|S_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|S_{2} } \right)}}u_{R} \left( {t_{2} ,a_{3} } \right) \\ & \quad \ge \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{1} ,a_{2} } \right) + \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m_{1} } \right) + \pi_{2} \mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}u_{R} \left( {t_{2} ,a_{2} } \right) \\ & \quad \Leftrightarrow \mu \left( {\left. {m_{0} } \right|m_{1} } \right)\pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right] \ge \mu \left( {\left. {m_{0} } \right|m_{2} } \right)\pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right] \\ \end{aligned} $$
(10)
$$ \Leftrightarrow \frac{{\pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right]}} \ge \frac{{\mu \left( {\left. {m_{0} } \right|m_{2} } \right)}}{{\mu \left( {\left. {m_{0} } \right|m_{1} } \right)}}, $$
(11)

where the left-hand side in (11) is larger than 1. By (8) and (10), it should be the case that \( \left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right] > 0 \) and \( \left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right] > 0 \). Combined with (9) and (11), it follows that a necessary condition for the existence of a separating PBE is that \( \left[ {u_{R} \left( {t_{1} ,a_{3} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]*\left[ {u_{R} \left( {t_{2} ,a_{3} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right] \ge \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right]*\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right]. \)

At the same time, S should prefer to send the right message in each state, and prefer this to not sending any message at all. That is, for S who in state t 1, we must have:

$$ \mu \left( {\left. {m_{1} } \right|m_{1} } \right)u_{S} \left( {t_{1} ,a_{1} } \right) + \mu \left( {\left. {m_{0} } \right|m_{1} } \right)u_{S} \left( {t_{1} ,a_{3} } \right) \ge \mu \left( {\left. {m_{2} } \right|m_{2} } \right)u_{S} \left( {t_{1} ,a_{2} } \right) + \mu \left( {\left. {m_{0} } \right|m_{2} } \right)u_{S} \left( {t_{1} ,a_{3} } \right) $$
(12)

and

$$ \mu \left( {\left. {m_{1} } \right|m_{1} } \right)u_{S} \left( {t_{1} ,a_{1} } \right) + \mu \left( {\left. {m_{0} } \right|m_{1} } \right)u_{S} \left( {t_{1} ,a_{3} } \right) \ge u_{S} \left( {t_{1} ,a_{3} } \right) $$
(13)

For S who observes state t 2, we must have:

$$ \mu \left( {\left. {m_{2} } \right|m_{2} } \right)u_{S} \left( {t_{2} ,a_{2} } \right) + \mu \left( {\left. {m_{0} } \right|m_{2} } \right)u_{S} \left( {t_{2} ,a_{3} } \right) \ge \mu \left( {\left. {m_{1} } \right|m_{1} } \right)u_{S} \left( {t_{2} ,a_{1} } \right) + \mu \left( {\left. {m_{0} } \right|m_{1} } \right)u_{S} \left( {t_{2} ,a_{3} } \right) $$
(14)

and

$$ \mu \left( {\left. {m_{2} } \right|m_{2} } \right)u_{S} \left( {t_{2} ,a_{2} } \right) + \mu \left( {\left. {m_{0} } \right|m_{2} } \right)u_{S} \left( {t_{2} ,a_{3} } \right) \ge u_{S} \left( {t_{2} ,a_{3} } \right) $$
(15)

By the fact that \( u_{S} \left( {t_{1} ,a_{2} } \right) > u_{S} \left( {t_{1} ,a_{3} } \right) \), \( u_{S} \left( {t_{2} ,a_{1} } \right) > u_{S} \left( {t_{2} ,a_{3} } \right) \), constraints (13) and (15) are slack. Constraints (12) and (14) can respectively be rewritten as:

$$ \left[ {1 - \mu \left( {\left. {m_{0} } \right|m_{1} } \right)} \right]\,\left[ {1 - \mu \left( {\left. {m_{0} } \right|m_{2} } \right)} \right]^{ - 1} \ge \left[ {u_{S} \left( {t_{1} ,a_{2} } \right) - u_{S} \left( {t_{1} ,a_{3} } \right)} \right]\,\left[ {u_{S} \left( {t_{1} ,a_{1} } \right) - u_{S} \left( {t_{1} ,a_{3} } \right)} \right]^{ - 1} $$
(16)

and

$$ \left[ {u_{S} \left( {t_{2} ,a_{2} } \right) - u_{S} \left( {t_{2} ,a_{3} } \right)} \right]\,\left[ {u_{S} \left( {t_{2} ,a_{1} } \right) - u_{S} \left( {t_{2} ,a_{3} } \right)} \right]^{ - 1} \ge \left[ {1 - \mu \left( {\left. {m_{0} } \right|m_{1} } \right)} \right]\,\left[ {1 - \mu \left( {\left. {m_{0} } \right|m_{2} } \right)} \right]^{ - 1} $$
(17)

In (16), the right-hand side is smaller than 1; in (17), the left-hand side is also smaller than 1. From the latter, it follows that in any separating PBE, it must be the case that \( \mu \left( {\left. {m_{0} } \right|m_{1} } \right) > \mu \left( {\left. {m_{0} } \right|m_{2} } \right) \). Further, it follows from (16) and (17) that a separating PBE can only exist if \( \left[ {u_{S} \left( {t_{2} ,a_{2} } \right) - u_{S} \left( {t_{2} ,a_{3} } \right)} \right] * \) \( \,\left[ {u_{S} \left( {t_{1} ,a_{1} } \right) - u_{S} \left( {t_{1} ,a_{3} } \right)} \right] \) ≥ \( \left[ {u_{S} \left( {t_{1} ,a_{2} } \right) - u_{S} \left( {t_{1} ,a_{3} } \right)} \right]\,* \) \( \,\left[ {u_{S} \left( {t_{2} ,a_{1} } \right) - u_{S} \left( {t_{2} ,a_{3} } \right)} \right] \). Therefore, under the conditions specified in the proposition, levels of \( \mu \left( {\left. {m_{0} } \right|m_{1} } \right) \) and \( \mu \left( {\left. {m_{0} } \right|m_{2} } \right) \) exist such that constraints (9), (11), (16) and (17) are valid, so that a separating PBE exists.

The fact that there is a unique Pareto-efficient separating PBE with minimal noise can be seen by plotting (9), (11), (16) and (17) in graph with \( \mu \left( {\left. {m_{0} } \right|m_{1} } \right) \) on one axis and \( \mu \left( {\left. {m_{0} } \right|m_{2} } \right) \) on the other (see Fig. 1). From Fig. 1, it can be seen that, starting from any Pareto-inefficient separating PBE, a single neologism that is less noisy, but keeps \( \mu \left( {\left. {m_{0} } \right|m_{1} } \right) \) and \( \mu \left( {\left. {m_{0} } \right|m_{2} } \right) \) in the range of PBE, is credible to R. Still, each separating PBE is attainable from the pooling PBE where R does a 3 in each circumstance; simply, by evolutionary drift, R can become predisposed to respond in the given way to messages with particular levels of noise. □

Fig. 1
figure 1

Noisy signaling conflict-of-interest model

Proof of Proposition 5

  1. (i)

    There is no separating PBE where S sends a different message in each state. This is because if there are three different messages which induce R to do respectively a 1, a 2 and a 3, then S in state t 3 would send the message inducing action a 2, and S in state t 2 sends the message inducing action a 1.

    There is no partial separating PBE where S pools states t 2 and t 3. This is because S in state t 2 would then send the message inducing a 1. As \( \frac{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}} > \frac{{\pi_{2} }}{{\pi_{1} }} \), when S in a candidate partial separating PBE pools t 2 and t 1, R does a 1. It follows that S in state t 1 and t 2 does not want to send the message inducing a 3. At the same time, S in t 3 does not want to send the message that is sent in both states t 2 and t 1, as S in t 3 prefers action a 3 to action a 1.

  2. (ii)

    Pooling PBE are not neologism proof, whatever the form they take. If a 3 is R’s best response in the pooling PBE, consider a neologism “t 3 does not occur”. Following Eq. (1), by \( u_{S} \left( {t_{3} ,a_{3} } \right) > u_{S} \left( {t_{3} ,a_{1} } \right) \), \( \frac{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}} > \frac{{\pi_{2} }}{{\pi_{1} }} \), S in state t 3 does not have any incentive to send such a message if R considers the message to be true. By \( u_{S} \left( {t_{2} ,a_{3} } \right) < u_{S} \left( {t_{2} ,a_{1} } \right) \), \( u_{S} \left( {t_{1} ,a_{3} } \right) < u_{S} \left( {t_{1} ,a_{1} } \right) \), S in state t 1 and t 2 has an incentive to send such a message if it is considered to be truthful. If a 1 is the best response in the pooling PBE, consider a neologism of the form “state t 3 occurs”. By \( u_{S} \left( {t_{2} ,a_{3} } \right) < u_{S} \left( {t_{2} ,a_{1} } \right) \), \( u_{S} \left( {t_{1} ,a_{3} } \right) < u_{S} \left( {t_{1} ,a_{1} } \right) \), and \( u_{R} \left( {t_{3} ,a_{3} } \right) > u_{R} \left( {t_{3} ,a_{1} } \right) \), S in states t 1 and t 2 does not have an incentive to send such a message if it is considered truthful. By \( u_{S} \left( {t_{3} ,a_{3} } \right) > u_{S} \left( {t_{3} ,a_{1} } \right) \), S in state t 3 does have an incentive to send such a message if it is considered truthful. If a 2 is the best response in the pooling PBE, consider a neologism of the form “state t 2 or t 1 occurs”. By \( u_{S} \left( {t_{3} ,a_{2} } \right) > u_{S} \left( {t_{3} ,a_{1} } \right) \) and \( \frac{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}} > \frac{{\pi_{2} }}{{\pi_{1} }} \), S in state t 3 does not have any incentive to send a message if it is considered truthful, as it is then met with response a 1. By \( u_{S} \left( {t_{2} ,a_{2} } \right) < u_{S} \left( {t_{2} ,a_{1} } \right) \), \( u_{S} \left( {t_{1} ,a_{2} } \right) < u_{S} \left( {t_{1} ,a_{1} } \right) \), S in states t 2 and t 1 does prefer to send such a message if it is considered truthful.

A partial separating PBE is attainable from each of the given pooling PBE, as evolutionary drift can always lead R to plan to do a 3 when receiving one out-of-equilibrium message, and a 1 when receiving another out-of-equilibrium message.□

Proof of Proposition 6

For proving the existence of the pooling PBE under (i) and (ii), see the proof of Proposition 2. We next prove the existence of the separating PBE in (iii). If R believes that a single revealed “1” means that both cues have a value of 1, then given common interests S follows the candidate equilibrium strategy. This in turn makes it a best response for R to follow the candidate equilibrium strategy. The same applies to the other separating PBE.

The pooling PBE in (i) is a sequential equilibrium, because a single revealed cue “1” can also be revealed by S in state (1, 2) or (2, 1). The pooling PBE in (ii) is not a sequential equilibrium, because a single revealed “2” can only be revealed in states (1, 2), (2, 1) or (2, 2).

The separating PBE where S reveals a “1” if both of the cues have a value of 1, and does not reveal anything otherwise, is attainable from the pooling PBE under (i) (conditional on \( \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} > \frac{{\pi_{1} }}{{\pi_{2} }} \)), as in this pooling PBE R already does a 2 when nothing is revealed. The separating PBE where S reveals a “2” if at least one of the cues has a value of 2, and does not reveal anything otherwise, is attainable from the pooling PBE under (ii) (conditional on \( \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} < \frac{{\pi_{1} }}{{\pi_{2} }} \)), as in this pooling PBE R already does a 1 when nothing is revealed. The separating PBE where S reveals a “1” if both of the cues have a value of 1, and reveals a “2” if at least one of the cues has a value of 2, is attainable from any of the pooling PBE, since starting from any of the pooling PBE evolutionary drift can cause R to respond in the appropriate way. □

Proof of Proposition 7

If \( \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{2} } \right) > \pi_{2} u_{R} \left( {t_{2} ,a_{1} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) \), then in pooling PBE a 2 is always done, if \( \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{2} } \right) < \pi_{2} u_{R} \left( {t_{2} ,a_{1} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) \), then in pooling PBE a 1 is always done. If S sends a message in state t 1 (t 2), then it is a best response for R to take action a 1 (a 2) when a message is received, and to take action a 2 (a 1) when no message is not received. This response by R in turn makes the specified strategy by S a best response. For R, it does not matter which separating PBE is played. S is better off if the message is only sent infrequently.

Consider the case where in the pooling PBE, a 2 (respectively a 1) is always done. If the messages are from a common language, given that players have common interests, the PBE is not neologism proof, since only R in state t 1 (respectively t 2) has an incentive to send a message with common meaning “do a 1” (respectively “do a 2”), if

S expects that R will act on the literal meaning of this message. For this reason, only the efficient separating PBE (respectively inefficient separating PBE) is pooling-based neologism proof. If the messages are not from a common language, in the pooling PBE, it is equilibrium dominated for S to send a costly message in state t 2 (respectively t 1). The pooling PBE therefore does not meet the intuitive criterion, as R should always interpret that a costly message came from S in state t 2 (respectively t 1). For this reason, only the efficient separating PBE (respectively inefficient separating PBE) meets the pooling-based intuitive criterion. Finally, in the pooling PBE, it is an alternative best response for R to plan to do a 2 (respectively a 1) when not receiving a message, and plan to do a 1 (respectively a 2) when receiving a message. It follows that only the efficient separating PBE (respectively inefficient separating PBE) is attainable from the pooling PBE. □

Proof of Proposition 8

As by assumption a message can only be received if it was sent, the constraint determining the existence of a separating PBE is what R does when not receiving a message. In the separating PBE where a message is sent in state t 1, R strictly prefers to do a 2 when not receiving a message iff

$$ \begin{aligned} & \frac{{\pi_{2} }}{{\pi_{2} + \pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}u_{R} \left( {t_{2} ,a_{2} } \right) + \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}{{\pi_{2} + \pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}u_{R} \left( {t_{1} ,a_{2} } \right) \\ & \quad > \frac{{\pi_{2} }}{{\pi_{2} + \pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}u_{R} \left( {t_{2} ,a_{1} } \right) + \frac{{\pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}{{\pi_{2} + \pi_{1} \mu \left( {\left. {m_{0} } \right|m} \right)}}u_{R} \left( {t_{1} ,a_{1} } \right) \\ & \quad \Leftrightarrow \frac{{\pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} > \mu \left( {\left. {m_{0} } \right|m} \right) \\ \end{aligned} $$
(18)

A pooling PBE where R does a 2 only exists if \( \frac{{\pi_{2} \left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}}{{\pi_{1} \left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} > 1 \), so that this constraint is not binding. In the separating PBE where a message is sent in state t 2, R strictly prefers to do a 1 when not receiving a message iff

$$ \begin{aligned} & \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right)}}{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right) + \pi_{1} }}u_{R} \left( {t_{2} ,a_{1} } \right) + \frac{{\pi_{1} }}{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right) + \pi_{1} }}u_{R} \left( {t_{1} ,a_{1} } \right) \\ & \quad > \frac{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right)}}{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right) + \pi_{1} }}u_{R} \left( {t_{2} ,a_{2} } \right) + \frac{{\pi_{1} }}{{\pi_{2} \mu \left( {\left. {m_{0} } \right|m} \right) + \pi_{1} }}u_{R} \left( {t_{1} ,a_{2} } \right) \\ & \quad \Leftrightarrow \frac{{\pi_{1} }}{{\pi_{2} }}\frac{{u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)}}{{u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)}} > \mu \left( {\left. {m_{0} } \right|m} \right) \\ \end{aligned} $$
(19)

This is the condition stated in the proposition.

R (and S) prefers the separating PBE where a message is sent in t 1 rather than in t 2 if

$$ \begin{aligned} & \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) + \pi_{1} \left[ {\mu \left( {\left. m \right|m} \right)u_{R} \left( {t_{1} ,a_{1} } \right) + \mu \left( {\left. {m_{0} } \right|m} \right)u_{R} \left( {t_{1} ,a_{2} } \right)} \right] \\ & \quad > \pi_{2} \left[ {\mu \left( {\left. m \right|m} \right)u_{R} \left( {t_{2} ,a_{2} } \right) + \mu \left( {\left. {m_{0} } \right|m} \right)u_{R} \left( {t_{2} ,a_{1} } \right)} \right] + \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) \\ & \quad \Leftrightarrow \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{2} } \right) > \pi_{2} u_{R} \left( {t_{2} ,a_{1} } \right) + \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) \\ \end{aligned} $$
(20)

The latter condition is identical to the condition for a 2 to be the best response in the pooling PBE.

The pooling PBE where R does a 2 in any event is not neologism proof, because when R receives a noisy message m with a common meaning “Do a 1”, R realizes that only S in state t 1 has an incentive to send it, if S acts upon the belief that R will follow the advice contained in the noisy message. For the same reason, the efficient separating PBE is pooling-based neologism proof, whereas the inefficient separating PBE is not. Only the efficient separating PBE is attainable from the pooling PBE where R does a 2 in any event, because in this PBE it is an alternative best response for R to plan to do a 1 when receiving a message m. □

Proof of Proposition 9

  1. (i)

    The pooling PBE takes this form by the fact that \( \pi_{1} \left[ {u_{R} \left( {t_{1} ,x} \right) - u_{R} \left( {t_{1} ,a_{3} } \right)} \right] + \pi_{2} \left[ {u_{R} \left( {t_{2} ,x} \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right] < \pi_{3} \left[ {u_{R} \left( {t_{3} ,a_{3} } \right) - u_{R} \left( {t_{3} ,x} \right)} \right] \) for \( x = a_{1} ,a_{2} \). In any pooling PBE where S never sends any messages, R should conclude that only S in state t 1 or t 2 has an incentive to send a message with commonly known meaning “t 1 or t 2 occurs”, if S believes that R will take the literal meaning of this message to be true. At the same time, R should conclude that only S in state t 1 has an incentive to send a message with commonly known meaning “t 1 occurs”, with the same restrictions on the beliefs of S. This illustrates that the given pooling PBE are not neologism proof.

  2. (ii)

    In the first type of partial separating PBE, t 1 and t 2 get pooled. By \( \frac{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{1} } \right)} \right]}} < \frac{{\pi_{2} }}{{\pi_{1} }} \), R does a 2 when getting a pooled signal. Given that \( u_{S} \left( {t_{1} ,a_{2} } \right) > u_{S} \left( {t_{1} ,a_{3} } \right) \), \( u_{S} \left( {t_{3} ,a_{3} } \right) > u_{S} \left( {t_{3} ,a_{2} } \right) \), and \( u_{S} \left( {t_{2} ,a_{2} } \right) > u_{S} \left( {t_{2} ,a_{3} } \right) \), S prefers to tell the truth. Part (i) of the proof already showed that this PBE is not pooling-based neologism proof. Also, in the pooling PBE where S never sends messages and R does a 3 in any event, an alternative best response for R is to plan to do a 2 when receiving a message, so that the specified separating PBE is attainable from this pooling PBE.

  3. (iii)

    In the second type of partial separating PBE, t 2 and t 3 get pooled. By \( \frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{3} ,a_{3} } \right) - u_{R} \left( {t_{3} ,a_{2} } \right)} \right]}} < \frac{{\pi_{3} }}{{\pi_{2} }} \), R does a 3 when getting a pooled signal. Given that \( u_{S} \left( {t_{1} ,a_{1} } \right) > u_{S} \left( {t_{1} ,a_{3} } \right) \), \( u_{S} \left( {t_{3} ,a_{3} } \right) > u_{S} \left( {t_{3} ,a_{1} } \right) \), and \( u_{S} \left( {t_{2} ,a_{3} } \right) > u_{S} \left( {t_{2} ,a_{1} } \right) \), S prefers to tell the truth. Part (i) of the proof shows that this PBE is not pooling-based neologism proof. Also, in the pooling PBE where S never sends messages and R does a 3 in any event, an alternative best response for R is to plan to do a 1 when receiving a message, so that the specified partial separating PBE is attainable from this pooling PBE.

We end by deriving the condition under which the partial separating PBE under (iii) is Pareto superior to the partial separating PBE under (ii). This is the case iff

$$ \begin{array}{*{20}c} \begin{gathered} \pi_{1} u_{R} \left( {t_{1} ,a_{2} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{2} } \right) + \pi_{3} u_{R} \left( {t_{3} ,a_{3} } \right) \hfill \\ \quad < \pi_{1} u_{R} \left( {t_{1} ,a_{1} } \right) + \pi_{2} u_{R} \left( {t_{2} ,a_{3} } \right) + \pi_{3} u_{R} \left( {t_{3} ,a_{3} } \right) \hfill \\ \end{gathered} & {\text{iff}} & {\frac{{\left[ {u_{R} \left( {t_{2} ,a_{2} } \right) - u_{R} \left( {t_{2} ,a_{3} } \right)} \right]}}{{\left[ {u_{R} \left( {t_{1} ,a_{1} } \right) - u_{R} \left( {t_{1} ,a_{2} } \right)} \right]}} < \frac{{\pi_{1} }}{{\pi_{2} }}.} \\ \end{array} $$

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Jaegher, K., van Rooij, R. Game-Theoretic Pragmatics Under Conflicting and Common Interests. Erkenn 79 (Suppl 4), 769–820 (2014). https://doi.org/10.1007/s10670-013-9465-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10670-013-9465-0

Navigation