default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSantiago R. Balseiro
Person information
- affiliation: Columbia University, New York, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Santiago R. Balseiro
, Omar Besbes, Francisco Castro:
Mechanism Design Under Approximate Incentive Compatibility. Oper. Res. 72(1): 355-372 (2024)- [j22]Santiago R. Balseiro, Omar Besbes, Dana Pizarro:
Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis. Oper. Res. 72(5): 2168-2189 (2024) - [c25]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 - [i16]Jerry Anunrojwong, Santiago R. Balseiro, Omar Besbes, Bolun Xu:
Battery Operations in Electricity Markets: Strategic Behavior and Distortions. CoRR abs/2406.18685 (2024) - [i15]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
- [j21]Santiago R. Balseiro, Haihao Lu, Vahab Mirrokni:
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. Oper. Res. 71(1): 101-119 (2023) - [j20]Santiago R. Balseiro, Antoine Désir:
Incentive-Compatible Assortment Optimization for Sponsored Products. Manag. Sci. 69(8): 4668-4684 (2023) - [j19]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees. Manag. Sci. 69(11): 6837-6854 (2023) - [j18]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. Math. Oper. Res. 48(3): 1607-1629 (2023) - [c24]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. ICML 2023: 1636-1659 - [c23]Jerry Anunrojwong, Santiago R. Balseiro, Omar Besbes:
Robust Auction Design with Support Information. EC 2023: 113 - [c22]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Single-Leg Revenue Management with Advice. EC 2023: 207 - [c21]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Online Resource Allocation under Horizon Uncertainty. SIGMETRICS (Abstracts) 2023: 63-64 - [i14]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. CoRR abs/2302.02006 (2023) - [i13]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) - [i12]Jerry Anunrojwong, Santiago R. Balseiro, Omar Besbes:
Robust Auction Design with Support Information. CoRR abs/2305.09065 (2023) - [i11]Santiago R. Balseiro, Will Ma, Wenxin Zhang:
Dynamic Pricing for Reusable Resources: The Power of Two Prices. CoRR abs/2308.13822 (2023) - 2022
- [j17]Santiago R. Balseiro, Vahab Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Toward First Best. Oper. Res. 70(4): 2299-2317 (2022) - [c20]Jerry Anunrojwong, Santiago R. Balseiro, Omar Besbes:
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design. EC 2022: 151-152 - [c19]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping. EC 2022: 475 - [c18]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees. EC 2022: 476 - [i10]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) - [i9]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Single-Leg Revenue Management with Advice. CoRR abs/2202.10939 (2022) - [i8]Santiago R. Balseiro, Shangzhou Xia:
Uniformly Bounded Regret in Dynamic Fair Allocation. CoRR abs/2205.12447 (2022) - [i7]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Online Resource Allocation under Horizon Uncertainty. CoRR abs/2206.13606 (2022) - 2021
- [j16]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69(3): 859-876 (2021) - [j15]Santiago R. Balseiro, Anthony Kim, Daniel Russo:
On the Futility of Dynamics in Robust Mechanism Design. Oper. Res. 69(6): 1767-1783 (2021) - [j14]Santiago R. Balseiro, David B. Brown, Chen Chen:
Dynamic Pricing of Relocating Resources in Large Networks. Manag. Sci. 67(7): 4075-4094 (2021) - [j13]Santiago R. Balseiro, Ozan Candogan, Huseyin Gurkan:
Multistage Intermediation in Display Advertising. Manuf. Serv. Oper. Manag. 23(3): 714-730 (2021) - [c17]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. ICML 2021: 630-639 - [c16]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. NeurIPS 2021: 17777-17788 - [c15]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization. EC 2021: 132-133 - [c14]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Non-Excludable Dynamic Mechanism Design. SODA 2021: 1357-1373 - [i6]Santiago R. Balseiro, Christian Kroer, Rachitesh Kumar:
Contextual First-Price Auctions with Budgets. CoRR abs/2102.10476 (2021) - [i5]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. CoRR abs/2111.02468 (2021) - 2020
- [j12]Hana Choi, Carl F. Mela, Santiago R. Balseiro, Adam Leary:
Online Display Advertising Markets: A Literature Review and Future Directions. Inf. Syst. Res. 31(2): 556-575 (2020) - [c13]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Dual Mirror Descent for Online Allocation Problems. ICML 2020: 613-628 - [c12]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC 2020: 607-608 - [i4]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. CoRR abs/2007.00514 (2020) - [i3]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. CoRR abs/2011.10124 (2020)
2010 – 2019
- 2019
- [j11]Santiago R. Balseiro, David B. Brown:
Approximations to Stochastic Dynamic Programs via Information Relaxation Duality. Oper. Res. 67(2): 577-597 (2019) - [j10]Santiago R. Balseiro, Omar Besbes, Gabriel Y. Weintraub:
Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment. Oper. Res. 67(3): 711-730 (2019) - [j9]Santiago R. Balseiro, Huseyin Gurkan, Peng Sun:
Multiagent Mechanism Design Without Money. Oper. Res. 67(5): 1417-1436 (2019) - [j8]Santiago R. Balseiro, Yonatan Gur:
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. Manag. Sci. 65(9): 3952-3968 (2019) - [c11]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. NeurIPS 2019: 9676-9685 - [c10]Santiago R. Balseiro, David B. Brown, Chen Chen:
Dynamic Pricing of Relocating Resources in Large Networks: Extended Abstract. SIGMETRICS (Abstracts) 2019: 29-30 - [c9]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Towards First Best. SODA 2019: 157-172 - 2018
- [j7]Santiago R. Balseiro, David B. Brown, Chen Chen:
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality. Oper. Res. 66(6): 1641-1660 (2018) - [j6]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. Manag. Sci. 64(11): 5062-5082 (2018) - [i2]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-learning. CoRR abs/1809.09582 (2018) - 2017
- [j5]Santiago R. Balseiro, Ozan Candogan:
Optimal Contracts for Intermediaries in Online Advertising. Oper. Res. 65(4): 878-896 (2017) - [c8]Santiago R. Balseiro, Max Lin, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Revenue Sharing. NIPS 2017: 2681-2689 - [c7]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. EC 2017: 165 - [c6]Santiago R. Balseiro, Yonatan Gur:
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. EC 2017: 609 - [c5]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget Management Strategies in Repeated Auctions. WWW 2017: 15-23 - 2016
- [j4]Felipe Balmaceda, Santiago R. Balseiro, José R. Correa, Nicolás E. Stier Moses:
Bounds on the welfare loss from moral hazard with limited liability. Games Econ. Behav. 95: 137-155 (2016) - [c4]Santiago R. Balseiro, Omar Besbes, Gabriel Y. Weintraub:
Dynamic Mechanism Design with Budget Constrained Buyers under Limited Commitment. EC 2016: 815 - 2015
- [j3]Santiago R. Balseiro, Omar Besbes, Gabriel Y. Weintraub:
Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design. Manag. Sci. 61(4): 864-884 (2015) - 2014
- [j2]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. Manag. Sci. 60(12): 2886-2907 (2014) - 2013
- [c3]Santiago R. Balseiro, Omar Besbes, Gabriel Y. Weintraub:
Auctions for online display advertising exchanges: approximations and design. EC 2013: 53-54 - 2011
- [j1]Santiago R. Balseiro, Irene Loiseau, J. Ramonet:
An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 38(6): 954-966 (2011) - [c2]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield optimization of display advertising with ad exchange. EC 2011: 27-28 - [i1]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. CoRR abs/1102.2551 (2011) - 2010
- [c1]Felipe Balmaceda, Santiago R. Balseiro, José R. Correa, Nicolás E. Stier Moses:
The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem. WINE 2010: 63-74
Coauthor Index
aka: Vahab Mirrokni
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-23 20:26 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:
