This paper studies sequential auctions in the presence of Knightian uncertainty about the distribution of values. We propose equilibrium notions based on the multiple selves approach to deal with the possible time inconsistency that arises with dynamic bidding for max-min bidders. We...

Dynamic mechanisms offer powerful techniques to improve on both revenue and efficiency by linking sequential auctions using state information, but these techniques rely on exact distributional information of the buyers' valuations (present and future), which limits their use in learning...

We design a non-clairvoyant dynamic mechanism under budget and ex-post individual rationality constraints that is dynamic incentive-compatible and achieves non-trivial revenue performance, even without any knowledge about the future. In particular, our dynamic mechanism obtains a constant...

Italian Abstract: Vengono esposti i principi base della teoria delle aste. Quali le questioni da risolvere, quali ingredienti, quali ipotesi necessarie per semplificare una teoria altrimenti piuttosto complessa. Vengono sviluppati i meccanismi d'asta al I e al II prezzo, risolvendo per le...

We introduce a new family of dynamic mechanisms that restricts sellers from using future distributional knowledge. Since the allocation and pricing of each auction period do not depend on the type distributions of future periods, we call this family of dynamic mechanisms non-clairvoyant.We...

This paper studies the use of posted prices and auctions in a large dynamic market with many short-lived sellers and long-lived buyers. Although a reserve-price auction maximizes the expected revenue, the optimal revenue decreases when the market becomes more buyer-friendly; namely, when buyers...

Dynamic mechanisms are a powerful technique in designing revenue-maximizing repeated auctions. Despite their strength, these types of mechanisms have not been widely adopted in practice for several reasons, e.g., for their complexity, and for their sensitivity to the accuracy of predicting...

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private...

We analyze a dynamic market in which buyers compete in a sequence of private-value auctions for differentiated goods. New buyers and new objects may arrive at random times. Since objects are imperfect substitutes, buyers' values are not persistent. Instead, each buyer's private value for a new...

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