Government procurement and allocation programs often use subsidies and set-asides favoring small businesses and other target groups to address fairness concerns. These concerns are in addition to standard objectives such as efficiency and revenue. We study the design of the optimal mechanism for...

When combinatorial bidding is permitted in auctions, such as the proposed FCC Auction #31, the resulting full valuations and winner-determination problem can be computationally challenging. We present a branch-and-price algorithm based on a set-packing formulation originally proposed by Dietrich...

The National Resident Matching program strives for a stable matching of medical students to teaching hospitals. With the presence of couples, stable matchings need not exist. For any student preferences, we show that each instance of a stable matching problem has a ’nearby’ instance with a...

This paper introduces a model of endogenous network formation and systemic risk. In it, agents form networks that efficiently trade-off the possibility of systemic risk with the benefits of trade. Second, fundamentally ‘safer’ economies generate higher interconnectedness, which in turn leads...

The problem of allocating bundles of indivisible objects without transfers arises in the assignment of courses to students, of computing resources like CPU time, memory and disk space to computing tasks and the truck loads of food to food banks. In these settings the complementarities in...

We consider the problem of selling a firm to a single buyer. The magnitude of the post-sale cash flow rights (v) as well as the benefits of control (b) are the buyer’s private information. In contrast to research that assumes the private information of the buyer is one-dimensional, the optimal...