In a multi-stage contest known as a two-player race, players display two fundamental behaviors: (1) the laggard will make a last stand in order to avoid the cost of losing; and (2) the player who is ahead will defend his lead if it is threatened. Last stand behavior, in particular, contrasts...

From the regulation of sports to lawmaking in parliament, in many situations one group of people (“agents”) make decisions that affect the payoffs of others (“principals”) who may offer action-contingent transfers in order to sway the agents' decisions. Prat and Rustichini (2003)...

The lack of price guidance towards efficiency relevant packages in ascending combinatorial clock auctions (ACCA) can lead to a low-efficiency allocation of goods. We propose a descending price combinatorial clock auction (DCCA) with a newly devised pricing strategy to improve on this problem....

We consider all-pay auctions in the presence of interdependent, affiliated valuations and private budget constraints. For the sealed-bid, all-pay auction we characterize a symmetric equilibrium in continuous strategies for the case of N bidders. Budget constraints encourage more aggressive...

We explore the performance of multi-round, price-guided combinatorial auctions for a previously untested class of value profiles in which synergies arise from shared fixed costs. We find that, in many cases, a simulator that bids straightforwardly does well in predicting auction performance, but...

I consider first-price auctions (FPA) and second-price auctions (SPA) with two asymmetric bidders. The FPA is known to be more profitable than the SPA if the strong bidder's distribution function is convex and the weak bidder's distribution is obtained by truncating or horizontally shifting the...

We consider all-pay auctions in the presence of interdependent, affiliated valuations and private budget constraints. For the sealed-bid, all-pay auction we characterize a symmetric equilibrium in continuous strategies for the case of N bidders. Budget constraints encourage more aggressive...

A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

We analyze a simultaneous ascending auction with anonymous item prices, for two items that are substitutes. This popular format entails increased opportunities for coordination among bidders, since bids are observable and can be used as signaling. This has happened, e.g., in the Netherlands 3G...

We study, theoretically and experimentally, sealed-bid first-price auctions with and without package bidding. In the model, a global bidder bids for multiple items and can benefit from synergies, while local bidders bid for a single item. In the equilibrium, package bidding improves (hurts)...