They show that the game-theoretic assumptions can be extended to introduce a kind of subjective probability. Agents meet and hold elections, though they don't necessarily change their own assessement results. All sorts of complex possibilities are considered, such as mechanisms for coping with incorrect information and contradiction resulting from some degree of incompetence. Each node is equipped with its own belief revision module. This approach looks very promising, but is computationally expensive to simulate.
Local experts direct other agents, whose competence is more global.
He offers a formal model to establish the mathematical basis for the manipulation of CMs. Unfortunately that model can only give partial advice. The candidate agent is rewarded after its integration through the growth of its own utility function. They demonstrate that distributed problem solving may be viewed as concurrent theorem proving. His definition is particularly useful for information-rich applications such as electronic commerce.