Balasubramanian Sivan
Balasubramanian Sivan is a Research Scientist at Google New York. His research interests are in Algorithmic Game Theory, Online + Approximation algorithms and Online Learning. He got his undergraduate degree in Computer Science from Indian Institute of Technology Madras (2008) and PhD in Computer Science (2013) from the University of Wisconsin-Madison advised by Prof. Shuchi Chawla, and joined Google in August 2015 after spending two years at Microsoft Research Redmond as a postdoctoral researcher. His PhD thesis on Prior Robust Optimization received the ACM SIGecom doctoral dissertation award.
See his personal webpage http://pages.cs.wisc.edu/~balu2901/ for more details on his publications.
Research Areas
Authored Publications
Sort By
Google
A Field Guide for Pacing Budget and ROS Constraints
Haihao (Sean) Lu
ICML (2024)
Auto-bidding and Auctions in Online Advertising: A Survey
Ashwinkumar Badanidiyuru Varadaraja
Christopher Liaw
Haihao (Sean) Lu
Andres Perlroth
Georgios Piliouras
Ariel Schvartzman
Kelly Spendlove
Hanrui Zhang
Mingfei Zhao
ACM SIGecom Exchanges, 22 (2024)
Optimal Pricing Schemes for an Impatient Buyer
Kangning Wang
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2023), pp. 382-398
Approximately Efficient Bilateral Trade
Kangning Wang
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (2022), 718–721
Welfare-maximizing Guaranteed Dashboard Mechanisms
Jason Hartline
Proceedings of the 22nd ACM Conference on Economics and Computation (2021), pp. 370
