This paper considers a multi-period setting where a monopolist, with short-term commitment, rents one unit of a durable good to a single consumer in every period. The consumer's valuation constitutes his private information and remains constant over time. By using a mechanism design approach,...

This paper studies the cost requirement for two-agent collusion-proof mechanism design. Unlike the existing results for general environments with three or more agents, it is shown that collusive behavior cannot be prevented freely in two-agent nonlinear pricing environments with correlated...

This paper investigates the optimal design of crowdfunding where crowdfunders are potential consumers with standard motivations and entrepreneurs are profit-maximizing agents. We characterize the typical crowdfunding mechanism where the entrepreneur commits to produce only if aggregate funding...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. Inparticular,...

We solve for the optimal mechanism for selling two goods when the buyer's demand characteristics are unobservable. In the case of substitutable goods, the seller has an incentive to offer lotteries over goods in order to charge the buyers with large differences in the valuations a higher price...

We extend the 'no-haggling' result of Riley and Zeckhauser (1983) to the class of linear multiproduct monopoly problems when the buyer's valuations are smoothly distributed. In particular we show that there is no loss for the seller in optimizing over mechanisms such that all allocations belong...

This paper considers a multi-period setting where a monopolist, with short-term commitment, rents one unit of a durable good to a single consumer in every period. The consumer's valuation constitutes his private information and remains constant over time. By using a mechanism design approach,...

Consider a revenue-maximizing seller who can sell an object to one of n potential buyers. Each buyer either has hard information about his valuation (i.e., evidence that cannot be forged) or is ignorant. The optimal mechanism is characterized. It turns out that more ignorance can increase the...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. In particular,...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. In particular,...