We extend the equivalence between Bayesian and dominant strategy implementation established by Gershkov et al. (Econometrica, 2013) to environments with non-linear utilities satisfying the average single-crossing property and the convex-valued assumption. The new equivalence result produces...

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...

We consider general social choice environments with private values and correlated types. Each agent's matrix of conditional probabilities satisfies the full rank condition. We show that for any Bayesian incentive compatible mechanism there exists a dominant strategy incentive compatible...

We consider general social choice environments with private values and correlated types. Each agent's matrix of conditional probabilities satisfies the full rank condition. We show that for any Bayesian incentive compatible mechanism there exists a dominant strategy incentive compatible...

We extend the equivalence between Bayesian and dominant strategy implementation established by Gershkov et al. (Econometrica, 2013) to environments with non-linear utilities satisfying the average single-crossing property and the convex-valued assumption. The new equivalence result produces...

We consider general social choice environments with private values and correlated types. Each agent's matrix of conditional probabilities satisfies the full rank condition. We show that for any Bayesian incentive compatible mechanism there exists a dominant strategy incentive compatible...

We develop a novel geometric approach to mechanism design using an important result in convex analysis: the duality between a closed convex set and its support function. By deriving the support function for the set of feasible interim values we extend the wellknown Maskin-Riley-Matthews-Border...

An important result in convex analysis is the duality between a closed convex set and its support function. We exploit this duality to develop a novel geometric approach to mechanism design. For a general class of social choice problems we characterize the feasible set, which is closed and...

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...

We provide sufficient conditions for a monotone function with a finite set of outcomes to be cyclically monotone. Using these conditions, we show that any monotone function defined on the domain of gross substitutes is cyclically monotone. The result also extends to the domain of generalized...