Consider a decentralized, dynamic market with an infinite horizon and incomplete information in which buyers and sellers' values for the traded good are private and independently drawn. Time is discrete, each period has length [delta], and each unit of time a large number of new buyers and...

We develop a nonparametric approach that allows for discrimination among alternative models of entry in first-price auctions. Three models of entry are considered: those of Levin and Smith (1994), Samuelson (1985), and a new model in which the information received at the entry stage is...

Consider a decentralized, dynamic market with an infinite horizon in which both buyers and sellers have private information concerning their values for the indivisible traded good. Time is discrete, each period has length ä, and each unit of time a large number of new buyers and sellers enter...

We propose a quantile-based nonparametric approach to inference on the probability density function (PDF) of the private values in first-price sealed-bid auctions with independent private values. Our method of inference is based on a fully nonparametric kernel-based estimator of the quantiles...

We consider optimal pricing by a profit-maximizing platform running a dynamic search and matching market. Buyers and sellers enter in cohorts over time, meet and bargain under private information. The optimal centralized mechanism, which involves posting a bid-ask spread, can be decentralized...

We consider a market with dynamic random matching and bargaining with two-sided private information `a la Satterthwaite and Shneyerov (2007). Traders know their valuation for the good before entering the market and steady state distributions in the market are endogenously determined in...

We study a steady state of the market with inflowing cohorts of buyers and sellers. The traders are randomly matched pairwise driven by a Pissarides-style matching function. Two bargaining protocols are considered: random offering and the k-double auction. There are frictions due to time...

We consider optimal pricing by a profit‐maximizing platform running a dynamic search and matching market. Buyers and sellers enter in cohorts over time, meet, and bargain under private information. The optimal centralized mechanism, which involves posting a bid–ask spread, can be...

We propose a quantile-based nonparametric approach to inference on the probability density function (PDF) of the private values in first-price sealed-bid auctions with independent private values. Our method of inference is based on a fully nonparametric kernel-based estimator of the quantiles...

We study slow Dutch auctions, where the clock does not fall instantaneously, but instead falls over time. Buyers are assumed less patient than the seller. In a symmetric setting, we investigate the properties of the optimal revenue-maximizing clock. We find that the clock is genuinely dynamic...