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

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

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

We analyze nonlinear pricing with finite information. A seller offers a menu to a continuum of buyers with a continuum of possible valuations. The menu is limited to offering a finite number of choices representing a finite communication capacity between buyer and seller. We identify necessary...

We analyze a nonlinear pricing model with limited information. Each buyer can purchase a large variety, d, of goods. His preference for each good is represented by a scalar and his preference over d goods is represented by a d-dimensional vector. The type space of each buyer is given by a...

A strategy is obviously dominant if, for any deviation, at any information set where both strategies first diverge, the best outcome under the deviation is no better than the worst outcome under the dominant strategy. A mechanism is obviously strategy-proof (OSP) if it has an equilibrium in...

We analyze the extent to which efficient trade is possible in an ongoing relationship between impatient agents with hidden valuations (i.i.d. over time), restricting attention to equilibria that satisfy ex post incentive constraints in each period. With ex ante budget balance, efficient trade...

Short-lived buyers arrive to a platform over time and randomly match with sellers. The sellers stay at the platform and sequentially decide whether to accept incoming requests. The platform designs what buyer information the sellers observe before deciding to form a match. We show full...

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...

This paper examines the optimal mechanism design problem when buyers have uncertain valuations. This uncertainty can only be resolved after the actual transactions take place and upon incurring significant post-purchase cost. We focus on two different settings regarding how the seller values a...