We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption may be unknown to that agent. The problem is motivated by keyword...

We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. We first consider generalized random-proposer take-it-or-leave-it offer games (GRP TIOLI games). This class of games includes a simple random-proposer...

We consider an environment with a single divisible good and two bidders. The valuations of the bidders are private information but one bidder has a commonly known budget constraint. For this environment we derive the revenue maximizing subsidy free incentive compatible auction. We also examine...

We study an in.nitely-repeated .rst-price auction with common values. Initially, bid-ders receive independent private signals about the objects. value, which itself does not change over time. Learning occurs only through observation of the bids. Under one-sided incomplete information, this...

We study centralized many-to-many matching in markets where agents have private information about (vertical) characteristics that determine match values. Our analysis reveals how matching patterns reflect cross-subsidization between sides. Agents are endogenously partitioned into consumers and...