default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalasubramanian Sivan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j13]Steven Delong, Alireza Farhadi, Rad Niazadeh
, Balasubramanian Sivan, Rajan Udwani:
Online Bipartite Matching with Reusable Resources. Math. Oper. Res. 49(3): 1825-1854 (2024)- [c43]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
A Field Guide for Pacing Budget and ROS Constraints. ICML 2024 - [i40]Rachitesh Kumar, Jon Schneider, Balasubramanian Sivan:
Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions. CoRR abs/2402.07363 (2024) - [i39]R. Preston McAfee, Renato Paes Leme, Balasubramanian Sivan, Sergei Vassilvitskii:
Winner-Pays-Bid Auctions Minimize Variance. CoRR abs/2403.04856 (2024) - [i38]Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan:
Rate-Preserving Reductions for Blackwell Approachability. CoRR abs/2406.07585 (2024) - [i37]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [j12]Maxime C. Cohen, Antoine Désir, Nitish Korula, Balasubramanian Sivan:
Best of Both Worlds Ad Contracts: Guaranteed Allocation and Price with Programmatic Efficiency. Manag. Sci. 69(7): 4027-4050 (2023) - [c42]Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan:
Pseudonorm Approachability and Applications to Regret Minimization. ALT 2023: 471-509 - [c41]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. ICML 2023: 1636-1659 - [c40]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. EC 2023: 959 - [c39]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Optimal Pricing Schemes for an Impatient Buyer. SODA 2023: 382-398 - [c38]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. SODA 2023: 399-415 - [i36]Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan:
Pseudonorm Approachability and Applications to Regret Minimization. CoRR abs/2302.01517 (2023) - [i35]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. CoRR abs/2302.02006 (2023) - [i34]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Joint Feedback Loop for Spend and Return-On-Spend Constraints. CoRR abs/2302.08530 (2023) - [i33]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. CoRR abs/2305.05590 (2023) - 2022
- [j11]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple pricing schemes for consumers with evolving values. Games Econ. Behav. 134: 344-360 (2022) - [c37]Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan:
Strategizing against Learners in Bayesian Games. COLT 2022: 5221-5252 - [c36]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. EC 2022: 962-963 - [c35]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Approximately efficient bilateral trade. STOC 2022: 718-721 - [c34]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. WINE 2022: 41-59 - [c33]Johannes Brustle, Paul Dütting, Balasubramanian Sivan:
Price Manipulability in First-Price Auctions. WWW 2022: 58-67 - [i32]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni, Balasubramanian Sivan:
From Online Optimization to PID Controllers: Mirror Descent with Momentum. CoRR abs/2202.06152 (2022) - [i31]Johannes Brustle, Paul Dütting, Balasubramanian Sivan:
Price Manipulability in First-Price Auctions. CoRR abs/2203.12042 (2022) - [i30]Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan:
Strategizing against Learners in Bayesian Games. CoRR abs/2205.08562 (2022) - 2021
- [j10]Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pál, Balasubramanian Sivan:
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms. Oper. Res. 69(6): 1805-1822 (2021) - [c32]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. ICML 2021: 6223-6232 - [c31]Ehsan Emamjomeh-Zadeh, Renato Paes Leme, Jon Schneider, Balasubramanian Sivan:
Jointly Learning Prices and Product Features. IJCAI 2021: 2360-2366 - [c30]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated First Price Auctions. EC 2021: 4 - [c29]Yuan Deng, Jason D. Hartline, Jieming Mao, Balasubramanian Sivan:
Welfare-maximizing Guaranteed Dashboard Mechanisms. EC 2021: 370 - [c28]Allen Liu, Renato Paes Leme, Martin Pál, Jon Schneider, Balasubramanian Sivan:
Variable Decomposition for Prophet Inequalities and Optimal Ordering. EC 2021: 692 - [i29]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Optimal Pricing Schemes for an Impatient Buyer. CoRR abs/2106.02149 (2021) - [i28]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. CoRR abs/2106.04689 (2021) - [i27]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. CoRR abs/2107.06980 (2021) - [i26]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. CoRR abs/2110.07084 (2021) - [i25]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. CoRR abs/2111.03158 (2021) - [i24]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Approximately Efficient Bilateral Trade. CoRR abs/2111.03611 (2021) - 2020
- [j9]Will Ma, Balasubramanian Sivan:
Separation between second price auctions with personalized reserves and the revenue optimal auction. Oper. Res. Lett. 48(2): 176-179 (2020) - [c27]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? WWW 2020: 596-605 - [i23]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? CoRR abs/2001.06074 (2020) - [i22]Allen Liu, Renato Paes Leme, Martin Pal, Jon Schneider, Balasubramanian Sivan:
Competing Optimally Against An Imperfect Prophet. CoRR abs/2004.10163 (2020)
2010 – 2019
- 2019
- [j8]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal crowdsourcing contests. Games Econ. Behav. 113: 80-96 (2019) - [j7]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in repeated sales. Games Econ. Behav. 118: 570-588 (2019) - [j6]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. J. ACM 66(1): 7:1-7:41 (2019) - [c26]Yuan Deng, Jon Schneider, Balasubramanian Sivan:
Strategizing against No-regret Learners. NeurIPS 2019: 1577-1585 - [c25]Yuan Deng, Jon Schneider, Balasubramanian Sivan:
Prior-Free Dynamic Auctions with Low Regret Buyers. NeurIPS 2019: 4804-4814 - [i21]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. CoRR abs/1903.03944 (2019) - [i20]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Dynamic First Price Auctions Robust to Heterogeneous Buyers. CoRR abs/1906.03286 (2019) - [i19]Will Ma, Balasubramanian Sivan:
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction. CoRR abs/1906.11657 (2019) - [i18]Yuan Deng, Jon Schneider, Balasubramanian Sivan:
Strategizing against No-regret Learners. CoRR abs/1909.13861 (2019) - 2018
- [c24]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. EC 2018: 171 - [c23]Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis:
Truthful Multi-Parameter Auctions with Online Supply: an Impossible Combination. SODA 2018: 753-769 - [c22]Sébastien Lahaie, Andrés Muñoz Medina, Balasubramanian Sivan, Sergei Vassilvitskii:
Testing Incentive Compatibility in Display Ad Auctions. WWW 2018: 1419-1428 - [i17]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. CoRR abs/1803.00494 (2018) - [i16]Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, Balasubramanian Sivan:
Improved Approximations for Free-Order Prophets and Second-Price Auctions. CoRR abs/1807.03435 (2018) - 2017
- [c21]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. ICALP 2017: 48:1-48:14 - [c20]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of service under time-of-use pricing. STOC 2017: 184-197 - [i15]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of Service under Time-of-Use Pricing. CoRR abs/1704.02364 (2017) - 2016
- [c19]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. SODA 2016: 528-547 - [c18]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple Pricing Schemes For Consumers With Evolving Values. SODA 2016: 1476-1490 - [c17]Denis Xavier Charles, Nikhil R. Devanur, Balasubramanian Sivan:
Multi-Score Position Auctions. WSDM 2016: 417-425 - [r1]Balasubramanian Sivan:
Optimal Crowdsourcing Contests. Encyclopedia of Algorithms 2016: 1464-1467 - [i14]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. CoRR abs/1607.02834 (2016) - 2015
- [j5]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in Bayesian optimal mechanism design. Games Econ. Behav. 91: 297-317 (2015) - [j4]Christopher A. Wilkens, Balasubramanian Sivan:
Single-Call Mechanisms. ACM Trans. Economics and Comput. 3(2): 10:1-10:60 (2015) - [j3]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. ACM Trans. Economics and Comput. 3(4): 18:1-18:16 (2015) - [c16]Moshe Babaioff, Renato Paes Leme, Balasubramanian Sivan:
Price Competition, Fluctuations and Welfare Guarantees. EC 2015: 759-776 - [c15]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. SODA 2015: 983-1002 - [i13]Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis:
Multi-parameter Auctions with Online Supply. CoRR abs/1511.03699 (2015) - 2014
- [j2]Shuchi Chawla, Balasubramanian Sivan:
Bayesian algorithmic mechanism design. SIGecom Exch. 13(1): 5-49 (2014) - [i12]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. CoRR abs/1409.3040 (2014) - [i11]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. CoRR abs/1409.3062 (2014) - [i10]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
How to sell an app: pay-per-play or buy-it-now? CoRR abs/1411.1381 (2014) - [i9]Moshe Babaioff, Renato Paes Leme, Balasubramanian Sivan:
Price Competition, Fluctuations, and Welfare Guarantees. CoRR abs/1411.2036 (2014) - 2013
- [c14]Hu Fu, Brendan Lucier, Balasubramanian Sivan, Vasilis Syrgkanis:
Cost-recovering bayesian algorithmic mechanism design. EC 2013: 453-470 - [c13]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Prior-independent mechanisms for scheduling. STOC 2013: 51-60 - [c12]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. WINE 2013: 40-53 - [c11]Balasubramanian Sivan, Vasilis Syrgkanis:
Vickrey Auctions for Irregular Distributions. WINE 2013: 422-435 - [i8]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Prior-Independent Mechanisms for Scheduling. CoRR abs/1305.0597 (2013) - [i7]Hu Fu, Brendan Lucier, Balasubramanian Sivan, Vasilis Syrgkanis:
Cost-Recovering Bayesian Algorithmic Mechanism Design. CoRR abs/1305.0598 (2013) - [i6]Balasubramanian Sivan, Vasilis Syrgkanis:
Auctions vs Negotiations in Irregular Markets. CoRR abs/1306.4022 (2013) - 2012
- [c10]Nikhil R. Devanur, Balasubramanian Sivan, Yossi Azar:
Asymptotically optimal algorithm for stochastic adwords. EC 2012: 388-404 - [c9]Christopher A. Wilkens, Balasubramanian Sivan:
Single-call mechanisms. EC 2012: 946-963 - [c8]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal crowdsourcing contests. SODA 2012: 856-868 - [c7]Balasubramanian Sivan, Vasilis Syrgkanis, Omer Tamuz:
Lower Bounds on Revenue of Approximately Optimal Auctions. WINE 2012: 526-531 - [i5]Balasubramanian Sivan, Vasilis Syrgkanis, Omer Tamuz:
Lower Bounds on Revenue of Approximately Optimal Auctions. CoRR abs/1210.0275 (2012) - 2011
- [c6]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
Near optimal online algorithms and fast approximation algorithms for resource allocation problems. EC 2011: 29-38 - [i4]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal Crowdsourcing Contests. CoRR abs/1111.2893 (2011) - 2010
- [j1]Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
On Conditional Covering Problem. Math. Comput. Sci. 3(1): 97-107 (2010) - [c5]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Multi-parameter mechanism design and sequential posted pricing. BQGT 2010: 22:1 - [c4]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in bayesian optimal mechanism design. EC 2010: 149-158 - [c3]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Multi-parameter mechanism design and sequential posted pricing. STOC 2010: 311-320 - [i3]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in Bayesian optimal mechanism design. CoRR abs/1002.3893 (2010) - [i2]Balasubramanian Sivan, Christopher A. Wilkens:
Single-Call Mechanisms. CoRR abs/1011.6134 (2010)
2000 – 2009
- 2009
- [c2]Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. WALCOM 2009: 262-273 - [i1]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Sequential Posted Pricing and Multi-parameter Mechanism Design. CoRR abs/0907.2435 (2009) - 2008
- [c1]Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
On Conditional Covering Problem. IWOCA 2008: 224-238
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
