Games of incomplete information: The inconsistent case

From MaRDI portal





In his well known series \textit{J. C. Harsanyi} [1967-68] develops the theory of noncooperative games of incomplete information, in which such games are replaced by games of complete information involving chance. He emphasizes the consistent case, in which the various types of players in a game of incomplete information \(\Gamma\), as generated from the various beliefs, can be thought as being derived from a joint probability matrix. In this case Harsanyi constructs a game \(G\) of perfect recall and in extensive form, whose players represent the various types of the players in \(\Gamma\). They are called agents and \(G\) itself is called the agent-form game representing \(\Gamma\). The game \(G\) has the following properties: (i) Each agent, when he comes to play in \(G\), has the same beliefs as the type in \(\Gamma\) that he represents. (ii) Each agent, when he comes to play in \(G\), has the same choices as the type he represents has in \(\Gamma\). (iii) If the players agree in \(\Gamma\) to play a Nash equilibrium of \(G\), no type will find it beneficial to deviate, because deviating alone will not increase his payoff. It is sometimes erroneously believed that Harsanyi's theory will not work if the beliefs are inconsistent. The purpose of this paper is to dispel this belief. One example which indicates how this can be done already appeared in the book ``Repeated games with incomplete information from \textit{R. J. Aumann} and \textit{M. Maschler} [The MIT Press, Cambridge (1995)]. The present paper generalizes that example and supplies a formal proof. For the entire collection see [Zbl 0866.00071].











This page was built for publication: Games of incomplete information: The inconsistent case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352342)