Theorem 1 in Bhargava, Mohit et al. (2015) provides a necessary condition for a social choice function to be LOBIC with respect to a belief system satisfying top-set (TS) correlation. In this paper, we provide a counter example to that theorem and consequently provide a new necessary condition...

We consider social choice functions (SCFs) that are locally robust ordinal Bayesian incentive compatible (LOBIC) with respect to correlated priors. We model such priors using a betweenness property and assume the coexistence of both positively and negatively correlated priors. We introduce the...

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

We consider a weaker notion of strategy-proofness called upper contour strategy-proofness (UCSP) and investigate its relation with strategy-proofness (SP) for random social choice functions (RSCFs). Apart from providing a simpler way to check whether a given RSCF is SP or not, UCSP is useful in...

We show that a large class of restricted domains such as single-peaked, single-crossing, single-dipped, tree-single-peaked with top-set along a path, Euclidean, multi-peaked, intermediate (Grandmont (1978)), etc., can be characterized by using betweenness property, and we present a unified...

We explore the structure of locally ordinal Bayesian incentive compatible (LOBIC) random Bayesian rules (RBRs). We show that under lower contour monotonicity, for almost all prior profiles (with full Lebesgue measure), a LOBIC RBR is locally dominant strategy incentive compatible (LDSIC). We...

We consider assignment problems where heterogeneous indivisible goods are to be assigned to individuals so that each individual receives at most one good. Individuals have single-peaked preferences over the goods. In this setting, first we show that there is no strategy-proof, non-bossy, Pareto...

We consider voting rules on a multidimensional policy space for a continuum of voters with elliptic preferences. Assuming continuity, gamma -strategy-proofnessmeaning that coalitions of size smaller or equal to a small number gamma cannot manipulateand unanimity, we show that such rules are...