Video From 22w5124: Communication Complexity and Applications, III
Raghuvansh Saxena, Microsoft Research
Monday, July 25, 2022 14:34 - 15:14
Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions
![](http://www.birs.ca/files/images/poster.png)