We consider collective decision problems where some agents have private information about alternatives and others don't. Voting takes place under strategy-proof rules. Prior to voting, informed agents may or may not disclose their private information, thus eventually influencing the preferences...

The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...

The problem of how to rationally aggregate probability measures occurs in particular (i) when a group of agents, each holding probabilistic beliefs, needs to rationalise a collective decision on the basis of a single 'aggregate belief system' and (ii) when an individual whose belief system is...