We develop a model of contests on networks. Each player is “connected” to a set of contests and exerts a single effort to increase the probability of winning each contest to which she is connected. We characterize equilibria under the Tullock contest success function and explore how behavior...

Buyer-seller networks where price is determined by an ascending-bid auction are important in many economic examples such as certain real estate markets, radio spectrum sharing, and buyer-supplier networks. However, it may be that some sellers are better off not participating in the auction. We...

We present a general model of bidding behavior in wildlife corridor auctions. Given (i) some spatial configuration of landowners in a landscape, (ii) the landowners' opportunity costs, and (iii) the value of establishing the corridor, our model predicts individual landowners' bids, overall...

Buyer-seller networks where price is determined by an ascending-bid auction are important in many economic examples such as certain real estate markets, radio spectrum sharing, and buyer-supplier networks. However, it may be that some sellers are better off not participating in the auction. We...

We present a general model of bidding behavior in wildlife corridor auctions. Given (i) some spatial configuration of landowners in a landscape, (ii) the landowners' opportunity costs, and (iii) the value of establishing the corridor, our model predicts individual landowners' bids, overall...

We study auction design when parties cannot commit themselves to the mechanism. The seller may change the rules of the game and the buyers choose their outside option at all stages. We assume that the seller has a leading role in equilibrium selection at any stage of the game. Stationary...

This paper analyzes the signaling effect of bidding in a two-round elimination contest. Before the final round, bids in the preliminary round are revealed and act as signals of the contestants' private valuations. Depending on his valuation, a contestant may have an incentive to bluff or sandbag...

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