Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers
- Award ID(s):
- 1717899
- PAR ID:
- 10204982
- Date Published:
- Journal Name:
- Foundations of Computer Science
- Page Range / eLocation ID:
- 249 to 272
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/FOCS.2019.00025
