We consider assignment problems where individuals are to be assigned at most one indivisible object and monetary transfers are not allowed. We provide a characterization of assignment rules that are Pareto efficient, non-bossy, and implementable in obviously strategy-proof (OSP) mechanisms. As...

We consider assignment problems where individuals are to be assigned at most one indivisible object and monetary transfers are not allowed. We provide a characterization of assignment rules that are Pareto efficient, non-bossy, and implementable in obviously strategy-proof (OSP) mechanisms. As...

We characterize all domains for which the set of unanimous and strategy-proof social choice functions coincides with the set of min-max rules. As an application of our result, we obtain a characterization of unanimous and strategy-proof social choice functions on maximal single-peaked domains...

We characterize all domains on which (i) every unanimous and strategy-proof social choice function is a min-max rule, and (ii) every min-max rule is strategy-proof. As an application of our result, we obtain a characterization of unanimous and strategy-proof social choice functions on maximal...

This paper presents a unified characterization of the unanimous and strategy-proof random rules on a class of domains that are based on some prior ordering over the alternatives. It identifies a condition called top-richness so that, if a domain satisfies top-richness, then an RSCF on it is...

We consider domains with a natural property called top-circularity. We show that if such a domain satisfies either the maximal conflict property or the weak conflict property, then it is dictatorial. We obtain the result in Sato (2010) as a corollary. Further, it follows from our results that...

We consider social choice problems where different agents can have different sets of admissible single-peaked preferences. We show every unanimous and strategy-proof social choice function on such domains satisfies Pareto property and tops-onlyness. Further, we characterize all domains on which...

We consider domains that exhibit single-peakedness only over a subset of alternatives. We call such domains partially single-peaked and provide a characterization of the unanimous and strategy-proof social choice functions on these domains. As an application of this result, we obtain a...

We explore the structure of local ordinal Bayesian incentive compatible (LOBIC) random Bayesian rules (RBRs). We show that under lower contour monotonicity, almost all (with Lebesgue measure 1) LOBIC RBRs are local dominant strategy incentive compatible (LDSIC). We also provide conditions on...

We consider the problem of dividing one unit of an infinitely divisible object among a finite number of agents. We provide a characterization of all single-peaked domains on which the uniform rule is the unique division rule satisfying efficiency, strategy-proofness, and equal treatment of...