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

We consider discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or of their equilibrium play are made. Because of this, equilibria will...

We study a market in which k identical and indivisible objects are allocated using a uniform-price auction where n k bidders each demand one object. Before the auction, each bidder receives an informative but imperfect signal about the state of the world. The good that is auctioned is a...

We study all-pay auctions (or wars of attrition), where the highest bidder wins an object, but all bidders pay their bids. We consider such auctions when two bidders alternate in raising their bids and where all aspects of the auction are common knowledge including bidders' valuations. We...

The paper analyzes a first price, sealed bid auction with a random reservation price where the object has an unknown common value, but one buyer has better information than the others. We permit the reservation price to be correlated with the information of the informed buyer, which reflects...