Consensus, communication and knowledge : an extension with bayesian agents

Parikh and Krasucki [1990] showed that pairwise communication of the value of a function f leads to a consensus about the communicated value if the function f is convex. They showed that union consistency of f may not be sufficient to guarantee consensus in any communication protocol. Krasucki [1996] proved that consensus occurs for any union consistent function if the protocol contains no cycle. We show that if agents communicate their optimal action, namely the action that maximizes their expected utility, then consensus obtains in any fair protocol for any action space.