We consider a connection networks model. Every agent has a demand in the form of pairs of locations she wants connected, and a willingness to pay for connectivity. A planner aims at implementing a welfare maximizing network and allocating the resulting cost, but information is asymmetric: agents...

We generalize the canonical problem of Nash implementation by allowing agents to voluntarily provide discriminatory signals, i.e. evidence. Evidence can either take the form of hard information or, more generally, have differential but non-prohibitive costs in different states. In such...

This paper investigates the robustness of Dutta and Sen's (2012) Theorem 1 to weaker notions of truth-telling. An individual honesty standard is modeled as a subgroup of the society, including the individual herself, for which she feels truth-telling concerns. An individual i is honest when she...

A partially-honest individual is a person who follows the maxim, "Do not lie if you do not have to" to serve your material interest. By assuming that the mechanism designer knows that there is at least one partially-honest individual in a society of n ≥ 3 individuals, a social choice rule...

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...