ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders
Article URLs:
Alternative Article URLs:
Authors: Shahar Dobzinski
  • Weizmann Institute of Science
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/Dobzinski16
Author Comments:

Discuss this paper and its artifacts below