A wareness, belief, and communication reaching consensus

摘要

This article studies graph-theoretical conditions under which communication will lead to consensus among players about their decisions in circumstances where there are more than tow players and they interact in pair without public announcement. It is shown that comsensus on their decisions can be guaranteed if the communication graph contains no cycle. Where none of the requirements for player's knowledge is imposed as in the standard model of knowledg with partitional information structure.