We study the general problem of public choice. We consider environments where agents’ identities may not be observable. A “rule” associates a preference profile with an alternative. An agent may create fictitious identities and submit multiple preference relations under them. We study...

In a model with finitely many agents who have single-dipped Euclidean preferences on a disc in the Euclidean plane, a rule assigns to each profile of reported dips a point of the disc. It is proved that any strategy-proof and Pareto optimal rule is dictatorial. This framework models situations...

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

We provide a short proof for the following characterization of the core in housing markets first proved by Ma (1994): the core is the only rule that satisfies strategy-proofness, Pareto efficiency and individual rationality.

We prove the following result which is equivalent to the Gibbard–Satterthwaite Theorem: when there are at least 3 alternatives, for any unanimous and strategy-proof social choice function, at any given profile if an individual’s top ranked alternative differs from the social choice, then she...

We show that any deterministic mechanism, for allocating identical items that are complements to budget-constrained bidders, cannot simultaneously satisfy individual-rationality, strategy-proofness, Pareto-efficiency, and no-positive-transfers. This holds even for two bidders, two items, and...

This paper is concerned with the problem of extending an antisymmetric binary relation on a set to a linear order on the power set. A necessary and sufficient condition is offered.

We show that every strategy-proof random social choice function is a convex combination of strategy-proof deterministic social choice functions in a two-alternative voting model. This completely characterizes all strategy-proof random social choice functions in this setting.

We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of strategy-proof and non-wasteful rules yields a strategy-proof rule with the following efficiency...

We test the effect of the amount of information on the strategies played by others in the theoretically strategy-proof Top Trading Cycles (TTC) mechanism. We find that providing limited information on the strategies played by others has a negative and significant effect in truth-telling rates...