We study the problem of efficient auction design in environments with interdependent values, under arbitrary common knowledge assumptions. We propose a simple mechanism and show that, under a rather mild condition, it "robustly" achieves efficiency. Our mechanism consists in a standard Vickrey...

We consider the efficient allocation of a single good with interdependent values in a quasi-linear environment. We present an approach to modelling interdependent preferences distinguishing between "payoff types" and "belief types" and report a characterization of when the efficient allocation...

Many empirical studies of auctions show that prices of identical goods sold sequentially follow a declining path. Declining prices have been viewed as an anomaly, because the theoretical models of auctions predict that the price sequence should either be a martingale (with independent signals...

The purpose of this paper is to propose allocatively efficient auction mechanisms for the distributed transportation procurement problem (DTPP), which is generally the problem of matching demands and supplies over a transportation network. We first construct a one-sided Vickrey–Clarke–Groves...

We apply a Bernheim-Whinston (1986) type mechanism to a situation where a single buyer with uncertain demand wishes to buy from a small number of suppliers. We let suppliers bid a payment contingent on own quantity supplied, and another payment contingent on the realization of total demand. We...

Changes in the parameters of an n-dimensional system of equations induce changes in its solutions. For a class of such systems, we determine the qualitative change in solutions given certain qualitative changes in parameters. Our methods and results are elementary yet useful. They highlight the...