We consider the problem of defining all possible Bayesian truth serums for agents represented by a singly connected network (a tree graph). Agents receive signals according to a probability distribution that is common knowledge and that matches the network structure. The planner knows the...

We consider the following ’truth serum’ mechanism problem: Two players observe signals drawn from a common prior on n x m. They are risk neutral, care only about mechanism payoffs, and will not provide information without incentives. A counterexample shows that one cannot construct a robust...