暂无分享,去创建一个
Eric Sodomka | Christian Kroer | Riccardo Colini-Baldeschi | Andrea Celli | Eric Sodomka | Riccardo Colini-Baldeschi | Christian Kroer | A. Celli
[1] Yinyu Ye,et al. Simple and fast algorithm for binary integer and online linear programming , 2020, Mathematical Programming.
[2] Kartik Hosanagar,et al. Optimal bidding in stochastic budget constrained slot auctions , 2008, EC '08.
[3] Nicole Immorlica,et al. Dynamics of bid optimization in online advertisement auctions , 2007, WWW '07.
[4] Stefanus Jasin,et al. Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters , 2015, Oper. Res..
[5] Nikhil R. Devanur,et al. Asymptotically optimal algorithm for stochastic adwords , 2012, EC '12.
[6] Souvik Ghosh,et al. Budget pacing for targeted online advertisements at LinkedIn , 2014, KDD.
[7] J. Borwein,et al. Convex Analysis And Nonlinear Optimization , 2000 .
[8] John Langford,et al. Resourceful Contextual Bandits , 2014, COLT.
[9] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[10] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[11] Yinyu Ye,et al. Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds , 2019, ArXiv.
[12] Francesco Orabona. A Modern Introduction to Online Learning , 2019, ArXiv.
[13] Vashist Avadhanula,et al. Stochastic bandits for multi-platform budget optimization in online advertising , 2021, WWW.
[14] Michael Carl Tschantz,et al. Bidding strategies with gender nondiscrimination constraints for online ad auctions , 2019, FAT*.
[15] V. Mirrokni,et al. The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems , 2020, Oper. Res..
[16] Vijay Kamble. Revenue Management on an On-Demand Service Platform , 2018, WINE.
[17] Vahab Mirrokni,et al. Regularized Online Allocation Problems: Fairness and Beyond , 2021, ICML.
[18] Vincent Conitzer,et al. Pacing Equilibrium in First-Price Auction Markets , 2018, EC.
[19] Gabriel Y. Weintraub,et al. Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design , 2014, Manag. Sci..
[20] Yonatan Gur,et al. Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium , 2017, EC.
[21] Jian Xu,et al. Smart Pacing for Effective Online Ad Campaign Optimization , 2015, KDD.
[22] Nikhil R. Devanur,et al. An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives , 2015, COLT.
[23] Jun Wang,et al. Feedback Control of Real-Time Display Advertising , 2016, WSDM.
[24] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[25] Amin Saberi,et al. Online Optimization with Uncertain Information , 2012, ACM Trans. Algorithms.
[26] Morteza Zadimoghaddam,et al. Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.
[27] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[28] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[29] Vahab S. Mirrokni,et al. Dual Mirror Descent for Online Allocation Problems , 2020, ICML.
[30] Jon Feldman,et al. Budget optimization in search-based advertising auctions , 2006, EC '07.
[31] Peter Key,et al. Optimal Bidding Strategies and Equilibria in Dynamic Auctions with Budget Constraints , 2013 .
[32] Hao Wang,et al. Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertising , 2018, CIKM.
[33] SaberiAmin,et al. AdWords and generalized online matching , 2007 .
[34] Vahab S. Mirrokni,et al. Budget Management Strategies in Repeated Auctions , 2016, WWW.
[35] Kamesh Munagala,et al. Advertising for Demographically Fair Outcomes , 2020, ArXiv.
[36] Itay Gurvich,et al. Uniformly bounded regret in the multi-secretary problem , 2017, Stochastic Systems.
[37] Nikhil R. Devanur,et al. Fast Algorithms for Online Stochastic Convex Programming , 2014, SODA.
[38] Deeparnab Chakrabarty,et al. Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.
[39] Anton Schwaighofer,et al. Budget Optimization for Sponsored Search: Censored Learning in MDPs , 2012, UAI.
[40] Tie-Yan Liu,et al. Joint optimization of bid and budget allocation in sponsored search , 2012, KDD.
[41] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[42] Weinan Zhang,et al. Optimal real-time bidding for display advertising , 2014, KDD.