Under the assumption of common priors, if the information partitions of two agents are finite, then simply by communicating back and forth and revising their posteriors the two agents will converge to a common equilibrium posterior, even though they may base their posteriors on quite different information. Furthermore, given any integer, n, one can construct an example in which the revision process not only takes n steps to converge, but no evident revision occurs ñ for (n-1) steps both agents repeat the same conflicting posteriors ñ until the last step when the two agents decide to agree. Common knowledge of each other's posterior does not necessarily lead agents to the posterior they would have agreed upon had information been directly exchanged. On the other hand, the examples that are characterized by a discrepancy between the direct and indirect communication equilibrium are rare: with probability 1, the revision process constructed here leads the two agents in one step to the direct communication equilibrium.
