STOC 2016
Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 624570253749950407