A planner wants to elicit information about an agent's preference relation, but not the entire ordering. Specifically, preferences are grouped into "types", and the planner only wants to elicit the agent's type. We first assume beliefs about randomization are subjective, and show that a space of...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

A planner wants to elicit information about an agent's preference relation, but not the entire ordering. Specifically, preferences are grouped into “types,” and the planner wants only to elicit the agent's type. We first assume that beliefs about randomization are subjective, and show that a...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...