The randomized communication complexity of randomized auctions

DOI10.1145/3406325.3451111arXiv2104.11275OpenAlexW3166375539MaRDI QIDQ6087052

Aviad Rubinstein, Unnamed Author

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.11275

zbMATH Keywords

communication complexityalgorithmic game theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: The randomized communication complexity of randomized auctions