Video: Raghuvansh Saxena, "Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions"

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

Raghuvansh Saxena, Video: Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions

Raghuvansh Saxena, Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions, Communication Complexity and Applications, III, BIRS, BIRS talk, 22w5124, math, mathematics, video

Banff International Research Station

presentation

mpeg4

52M

http://www.birs.ca/events/2022/5-day-workshops/22w5124/videos

http://www.birs.ca/events/2022/5-day-workshops/22w5124/videos/watch/202207251434-Saxena.html

Download this video (52M)