HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Combinatorial Auctions Do Need Modest Interaction

Sepehr Assadi
Sepehr Assadi

ACM Transactions on Economics and Computation, pp. 1-23, 2020.

Cited by: 0|Bibtex|Views5|DOI:https://doi.org/10.1145/3381521
EI
Other Links: dl.acm.org|dblp.uni-trier.de|arxiv.org
Keywords:
Combinatorial auctionsmulti-party communication complexityround-approximation tradeoff

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments