Price Discrimination Through Communication

We study a seller's optimal mechanism for maximizing revenue when the buyer may present evidence relevant to the buyer's value, or when different types of buyer have a differential ability to communicate. We introduce a dynamic bargaining protocol in which the buyer first makes a sequence of concessions in a cheap talk phase, and then at a time determined by the seller, the buyer presents evidence to support his previous assertions, and then the seller makes a take-it-or-leave-it offer. Our main result is that the optimal mechanism can be implemented as a sequential equilibrium of our dynamic bargaining protocol. Unlike the optimal mechanism to which the seller can commit, the equilibrium of the bargaining protocol also provides incentives for the seller to behave as required. We thereby provide a natural procedure whereby the seller can optimally price discriminate on the basis of the buyer's evidence. JEL Code: C78, D82, D83.price discrimination, communication, bargaining, commitment, evidence, network flows

Calibration: Respice, Adspice, Prospice

“Those who claim for themselves to judge the truth are bound to possess a criterion of truth.” JEL Code: C18, C53, D89calibration, prediction

Optimal Auctions with Financially Constrained Bidders

We consider an environment where potential buyers of an indi- visible good have liquidity constraints, in that they cannot pay more than their `budget' regardless of their valuation. A buyer's valuation for the good as well as her budget are her private information. We derive constrained-efficient and revenue maximizing auctions for this setting. In general, the optimal auction requires `pooling' both at the top and in the middle despite the maintained assumption of a mono- tone hazard rate. Further, the auctioneer will never¯find it desirable to subsidize bidders with low budgets.the universal type space, the strategic topology; the uniform strategic topology; the uniform-weak topology; interim correlated rationalizable actions

Single and Multi-Dimensional Optimal Auctions - A Network Approach

This paper highlights connections between the discrete and continuous approaches to optimal auction design with single and multi-dimensional types. We provide an interpretaion of an optimal auction design problem in terms of a linear program that is an instance of a parametric shortest path problem on a lattice. We also solve some cases explicitly in the discrete framework.Auctions, Networks, Linear Programming

Dominant Strategy Mechanisms with Multidimensional Types

This paper provides a characterization of dominant strategy mechanisms with quasi-linear utilities and multi-dimensional types for a variety of preference domains. These characterizations are in terms of a monotonicity property on the underlying allocation rule.operations research and management science;

Characterization of revenue equivalence

The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called \emph{revenue equivalence}. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The characterization holds for any (possibly infinite) outcome space and many of the known results are immediate consequences. Moreover, revenue equivalence can be identified in cases where existing theorems are silent