Combinatorial Auctions Do Need Modest Interaction
ACM Transactions on Economics and Computation, pp. 1-23, 2020.
We study the necessity of interaction for obtaining efficient allocations in combinatorial auctions with subadditive bidders. This problem was originally introduced by Dobzinski, Nisan, and Oren (STOC’14) as the following simple market scenario: m items are to be allocated among n bidders in a distributed setting where bidders valuations ...More
Full Text (Upload PDF)
PPT (Upload PPT)