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

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

In a Shapley-Shubik assignment problem with a supermodular output matrix, we consider games in which each firm makes a take-it-or-leave-it salary offer to one applicant, and a match is made only when the offer is accepted by her. We consider both one-shot and multistage games. In either game, we...