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

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

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 where potential buyers of an indivisible good have liquidity constraints, in that they cannot pay more than their `budget' regardless of their valuation. A buyer's valuation for the good as well as her budget are her private information. We derive constrained-effcient...

Mechanisms where intermediaries charge a commission fee and have the sellers set the price are widely used in practice e.g. by real estate agents, stock brokers, art galleries, or auction houses. We model competition between intermediaries in a dynamic random matching model, where in every...