We examine a firm that can license its production technology to a rival when firms are heterogeneous in production costs. We show that a complete technology transfer from one firm to another always increases joint profit under weakly concave demand when at least three firms remain in the...

We examine experimentally how link costs affect the formation of links between a single seller and two potential buyers as well as the ensuing bargaining. Theory predicts that link costs lead to less competitive networks, with one link rather than two links, and that link costs do not affect the...

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

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

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.