Balasubramanian Sivan

Orcid: 0000-0002-0188-7622

According to our database1, Balasubramanian Sivan authored at least 61 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Online Bipartite Matching with Reusable Resources.
Math. Oper. Res., 2024

Auto-bidding and Auctions in Online Advertising: A Survey.
CoRR, 2024

Rate-Preserving Reductions for Blackwell Approachability.
CoRR, 2024

Winner-Pays-Bid Auctions Minimize Variance.
CoRR, 2024

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions.
CoRR, 2024

A Field Guide for Pacing Budget and ROS Constraints.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Best of Both Worlds Ad Contracts: Guaranteed Allocation and Price with Programmatic Efficiency.
Manag. Sci., July, 2023

Joint Feedback Loop for Spend and Return-On-Spend Constraints.
CoRR, 2023

Pricing Query Complexity of Revenue Maximization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Pricing Schemes for an Impatient Buyer.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Description Complexity of Regular Distributions.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Robust Budget Pacing with a Single Sample.
Proceedings of the International Conference on Machine Learning, 2023

Pseudonorm Approachability and Applications to Regret Minimization.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Simple pricing schemes for consumers with evolving values.
Games Econ. Behav., 2022

From Online Optimization to PID Controllers: Mirror Descent with Momentum.
CoRR, 2022

Price Manipulability in First-Price Auctions.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Online Allocation and Display Ads Optimization with Surplus Supply.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Approximately efficient bilateral trade.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Online Bipartite Matching with Reusable Resources.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Strategizing against Learners in Bayesian Games.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms.
Oper. Res., 2021

Variable Decomposition for Prophet Inequalities and Optimal Ordering.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Welfare-maximizing Guaranteed Dashboard Mechanisms.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Robust Repeated First Price Auctions.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Jointly Learning Prices and Product Features.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Learning to Price Against a Moving Target.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Separation between second price auctions with personalized reserves and the revenue optimal auction.
Oper. Res. Lett., 2020

Competing Optimally Against An Imperfect Prophet.
CoRR, 2020

Why Do Competitive Markets Converge to First-Price Auctions?
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems.
J. ACM, 2019

Perfect Bayesian Equilibria in repeated sales.
Games Econ. Behav., 2019

Optimal crowdsourcing contests.
Games Econ. Behav., 2019

Dynamic First Price Auctions Robust to Heterogeneous Buyers.
CoRR, 2019

Prior-Free Dynamic Auctions with Low Regret Buyers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Strategizing against No-regret Learners.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Improved Approximations for Free-Order Prophets and Second-Price Auctions.
CoRR, 2018

Testing Incentive Compatibility in Display Ad Auctions.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Truthful Multi-Parameter Auctions with Online Supply: an Impossible Combination.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Robust Repeated Auctions under Heterogeneous Buyer Behavior.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Stability of service under time-of-use pricing.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Tight Lower Bounds for Multiplicative Weights Algorithmic Families.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Optimal Crowdsourcing Contests.
Encyclopedia of Algorithms, 2016

Multi-Score Position Auctions.
Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

Towards Optimal Algorithms for Prediction with Expert Advice.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Single-Call Mechanisms.
ACM Trans. Economics and Comput., 2015

Revenue Maximization with Nonexcludable Goods.
ACM Trans. Economics and Comput., 2015

The power of randomness in Bayesian optimal mechanism design.
Games Econ. Behav., 2015

Multi-parameter Auctions with Online Supply.
CoRR, 2015

Price Competition, Fluctuations and Welfare Guarantees.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Bayesian algorithmic mechanism design.
SIGecom Exch., 2014

How to sell an app: pay-per-play or buy-it-now?
CoRR, 2014

2013
Auctions vs Negotiations in Irregular Markets.
CoRR, 2013

Vickrey Auctions for Irregular Distributions.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Prior-independent mechanisms for scheduling.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Cost-recovering bayesian algorithmic mechanism design.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
Lower Bounds on Revenue of Approximately Optimal Auctions.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Asymptotically optimal algorithm for stochastic adwords.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2010
On Conditional Covering Problem.
Math. Comput. Sci., 2010

Multi-parameter mechanism design and sequential posted pricing.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Sequential Posted Pricing and Multi-parameter Mechanism Design
CoRR, 2009

Core and Conditional Core Path of Specified Length in Special Classes of Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009


  Loading...