Separating the communication complexity of truthful and non-truthful combinatorial auctions-Reference-Cited by-同舟云学术

Separating the communication complexity of truthful and non-truthful combinatorial auctions

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Assadi Sepehr¹,Khandeparkar Hrishikesh²,Saxena Raghuvansh R.²,Weinberg S. Matthew²

Affiliation:

1. Rutgers University, USA

2. Princeton University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384267

Reference58 articles.

1. [AS19] Sepehr Assadi and Sahil Singla. Improved truthful mechanisms for [AS19] Sepehr Assadi and Sahil Singla. Improved truthful mechanisms for

2. Sixtieth Annual IEEE Foundations of Computer Science (FOCS) 2019. [BDF+10] David Buchfuhrer Shaddin Dughmi Hu Fu Robert Kleinberg Elchanan Sixtieth Annual IEEE Foundations of Computer Science (FOCS) 2019. [BDF+10] David Buchfuhrer Shaddin Dughmi Hu Fu Robert Kleinberg Elchanan

3. on Discrete Algorithms (SODA) 2010. [BMW18] Mark Braverman Jieming Mao and S. Matthew Weinberg. On simultaneous on Discrete Algorithms (SODA) 2010. [BMW18] Mark Braverman Jieming Mao and S. Matthew Weinberg. On simultaneous

4. Orleans LA USA January 7-10 2018 pages 2256-2273 2018. Orleans LA USA January 7-10 2018 pages 2256-2273 2018.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. On the hardness of dominant strategy mechanism design;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Exponential communication separations between notions of selfishness;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

4. The communication complexity of payment computation;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. The randomized communication complexity of randomized auctions;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15