We study auction design in the standard symmetric independent private values environment, where the seller lacks the commitment power to withhold an unsold object off the market. The seller has a single object and can conduct an infinite sequence of standard auctions with reserve prices to maximize her expected profit. In each period, the seller can commit to a reserve price for the current period but cannot commit to future reserve prices. We analyze the problem with limited commitment through an auxiliary mechanism design problem with full commitment, in which an additional constraint reflects the sequential rationality of the seller. We characterize the maximal profit achievable in any perfect Bayesian equilibrium in the limit as the per...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We examine an environment where goods and privately informed buyers arrive stochastically to a marke...
We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to re...
This paper characterizes revenue maximizing auctions for a Önite horizon version of the standard IV ...
First (or second) price auctions with optimally chosen reserve prices maximize revenue among all pos...
First (or second) price auctions with optimally chosen reserve prices maximize revenue among all pos...
We study stationary equilibria in a sequential auction setting. A seller runs a sequence of standard...
This paper studies the optimal mechanism for a seller (she) that sells, in a sequence of periods, an...
This paper studies the optimal mechanism for a seller (she) that sells, in a sequence of periods, an...
We examine a dynamic model of English auctions with independent private values. There is a single ob...
We study a multi-unit auction environment similar to eBay. Sellers, each with a single unit of a hom...
We study auction design when parties cannot commit to the mechanism. The seller may change the rules...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to re...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We examine an environment where goods and privately informed buyers arrive stochastically to a marke...
We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to re...
This paper characterizes revenue maximizing auctions for a Önite horizon version of the standard IV ...
First (or second) price auctions with optimally chosen reserve prices maximize revenue among all pos...
First (or second) price auctions with optimally chosen reserve prices maximize revenue among all pos...
We study stationary equilibria in a sequential auction setting. A seller runs a sequence of standard...
This paper studies the optimal mechanism for a seller (she) that sells, in a sequence of periods, an...
This paper studies the optimal mechanism for a seller (she) that sells, in a sequence of periods, an...
We examine a dynamic model of English auctions with independent private values. There is a single ob...
We study a multi-unit auction environment similar to eBay. Sellers, each with a single unit of a hom...
We study auction design when parties cannot commit to the mechanism. The seller may change the rules...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to re...
We analyze the problem of a buyer who chooses a supplier for a long-term relationship via an auction...
We examine an environment where goods and privately informed buyers arrive stochastically to a marke...
We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to re...