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...

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue the op- posite. After proving a general impossibility...

The problem of social choice is studied on a domain with countably many individuals. In contrast to most of the existing literature which establish either non-constructive possibilities or approximate (i.e. invisible) dictators, we show that if one adds a continuity property to the usual set of...

Judgment aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of barely judgments of preference. The paper briefly sums it up, privileging the variant that formalizes judgment by a logical syntax. The theory derives from...

We say that a social choice function is sensitive to collective change if whenever all inputs change, the outcome necessarily changes. Then, we prove that a social choice function is sensitive to collective change if and only if it is dictatorial. This provides a new interpretation of the...

We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity – i.e., when every agent ranks a different object at the...

We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity - i.e., when every agent ranks a different object at the...

We analyze bankruptcy problems with an indivisible object, where real owners and outside traders want to allocate an indivisible object among them with monetary compensation. The object might be a company that has gone bankrupt or a house left by a parent who has died, and so on. We show that...

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...