Strategy/false-name proof protocols for combinatorial multi-attribute procurement auction: handling arbitrary utility of the buyer

This paper develops new protocols for a combinatorial, multi-attribute procurement auction in which each sales item (task) is defined by several attributes called quality, the buyer is the auctioneer (e.g., a government), and the sellers are the bidders. Furthermore, multiple tasks exist, and both buyer and sellers can have arbitrary (e.g., complementary/substitutable) preferences on a bundle of tasks.