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

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