Fetching the paper…
Reading the bibliography…
Online allocation problems with resource constraints are central problems in revenue management and online advertising.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977
Earlier work this paper cites.
The passenger-mix problem in the scheduled airlines
Fred Glover, Randy Glover, Joe Lorenzo, and Claude McMillan · 1982
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
Optimum seat allocation for multi-leg flights with multiple fare types
KW Wang · 1983
Earlier work this paper cites.
An optimal algorithm for on-line bipartite matching
Richard M Karp, Umesh V Vazirani, and Vijay V Vazirani · 1990
Earlier work this paper cites.
Discrete choice theory of product differentiation
Simon P Anderson, Andre De Palma, and Jacques-Francois Thisse · 1992
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using bregman functions
Gong Chen and Marc Teboulle · 1993
Earlier work this paper cites.
Nonlinear Programming
Dimitri Bertsekas · 1999
Earlier work this paper cites.
Essential smoothness, essential strict convexity, and legendre functions in banach spaces
Heinz H Bauschke, Jonathan M Borwein, and Patrick L Combettes · 2001
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
An overview of pricing models for revenue management
Gabriel Bitran and René Caldentey · 2003
Earlier work this paper cites.
The Theory and Practice of Revenue Management
Kalyan T. Talluri and Garrett J. van Ryzin · 2004
Earlier work this paper cites.
The theory and practice of revenue management , volume 68
Kalyan T Talluri and Garrett J Van Ryzin · 2006
Earlier work this paper cites.
Online primal-dual algorithms for maximizing ad-auctions revenue
Niv Buchbinder, Kamal Jain, and Joseph Seffi Naor · 2007
Earlier work this paper cites.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani · 2007
Earlier work this paper cites.
Bregman voronoi diagrams: Properties, algorithms and applications
Frank Nielsen, Jean-Daniel Boissonnat, and Richard Nock · 2007
Earlier work this paper cites.
A primal-dual perspective of online learning algorithms
Shai Shalev-Shwartz and Yoram Singer · 2007
Earlier work this paper cites.
Budget constrained bidding in keyword auctions and online knapsack problems
Yunhong Zhou, Deeparnab Chakrabarty, and Rajan Lukose · 2008
Earlier work this paper cites.
Toward robust revenue management: Competitive analysis of online booking
Michael O. Ball and Maurice Queyranne · 2009
Earlier work this paper cites.
The adwords problem: online keyword matching with budgeted bidders under random permutations
Nikhil R Devanur and Thomas P Hayes · 2009
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Online stochastic packing applied to display ad allocation
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, and Cliff Stein · 2010
Earlier work this paper cites.
An axiomatic theory of fairness in network resource allocation
Tian Lan, David Kao, Mung Chiang, and Ashutosh Sabharwal · 2010
Earlier work this paper cites.
Fairness is an emergent self-organized property of the free market for labor
Venkat Venkatasubramanian · 2010
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Online allocation of display ads with smooth delivery
Anand Bhalgat, Jon Feldman, and Vahab Mirrokni · 2012
Cited alongside, same era.
Dynamic allocation problems with volatile demand
Dragos Florin Ciocan and Vivek F Farias · 2012
Cited alongside, same era.
Ergodic mirror descent
John C. Duchi, Alekh Agarwal, Mikael Johansson, and Michael I. Jordan · 2012
Cited alongside, same era.
Markov chains and stochastic stability
Sean P Meyn and Richard L Tweedie · 2012
Cited alongside, same era.
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Vahab S. Mirrokni, Shayan Oveis Gharan, and Morteza Zadimoghaddam · 2012
Cited alongside, same era.
Diverse weighted bipartite b-matching
Faez Ahmed, John P Dickerson, and Mark Fuge · 2017
Later among the works it cites.
Markov chains and mixing times , volume 107
David A Levin and Yuval Peres · 2017
Later among the works it cites.
Proportional allocation: Simple, distributed, and diverse matching with high entropy
Shipra Agrawal, Morteza Zadimoghaddam, and Vahab Mirrokni · 2018
Later among the works it cites.
Allocation with traffic spikes: Mixing adversarial and stochastic models
Hossein Esfandiari, Nitish Korula, and Vahab Mirrokni · 2018
Later among the works it cites.
Relatively smooth convex optimization by first-order methods, and applications
Haihao Lu, Robert Freund, and Yurii Nesterov · 2018
Later among the works it cites.
Stochastic bandits robust to adversarial corruptions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Real time bid optimization with smooth budget delivery in online advertising
Kuang-Chih Lee, Ali Jalali, and Ali Dasdan · 2013
Cited alongside, same era.
Promoting diversity in recommendation by entropy regularizer
Lijing Qin and Xiaoyan Zhu · 2013
Cited alongside, same era.
Fast algorithms for online stochastic convex programming
Shipra Agrawal and Nikhil R Devanur · 2014
Cited alongside, same era.
A dynamic near-optimal algorithm for online linear programming
Shipra Agrawal, Zizhuo Wang, and Yinyu Ye · 2014
Cited alongside, same era.
Resourceful contextual bandits
Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014
Cited alongside, same era.
Yield optimization of display advertising with ad exchange
Santiago R. Balseiro, Jon Feldman, Vahab Mirrokni, and Shan Muthukrishnan · 2014
Cited alongside, same era.
Thodoris Lykouris, Vahab Mirrokni, and Renato Paes Leme · 2018
Later among the works it cites.
Uniformly bounded regret in the multisecretary problem
Alessandro Arlotto and Itai Gurvich · 2019
Later among the works it cites.
Learning in repeated auctions with budgets: Regret minimization and equilibrium
Santiago R. Balseiro and Yonatan Gur · 2019
Later among the works it cites.
Robust dynamic assortment optimization in the presence of outlier customers
Xi Chen, Akshay Krishnamurthy, and Yining Wang · 2019
Later among the works it cites.
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Nikhil R Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A Wilkens · 2019
Later among the works it cites.
Posted pricing and prophet inequalities with inaccurate priors
Paul Dütting and Thomas Kesselheim · 2019
Later among the works it cites.
Us programmatic ad spending forecast 2019
eMarketer · 2019
Later among the works it cites.
Revenue management and pricing analytics , volume 209
Guillermo Gallego, Huseyin Topaloglu, et al · 2019
Later among the works it cites.
Online linear programming: Dual convergence, new algorithms, and regret bounds
Xiaocheng Li and Yinyu Ye · 2019
Later among the works it cites.
“relative continuity” for non-lipschitz nonsmooth convex optimization using stochastic (or deterministic) mirror descent
Haihao Lu · 2019
Later among the works it cites.
Robust online matching with user arrival distribution drift
Yu-Hang Zhou, Chen Liang, Nan Li, Cheng Yang, Shenghuo Zhu, and Rong Jin · 2019
Later among the works it cites.
Dual mirror descent for online allocation problems
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni · 2020
Closest in time.
Robust Algorithms for the Secretary Problem
Domagoj Bradac, Anupam Gupta, Sahil Singla, and Goran Zuzic · 2020
Closest in time.
Online stochastic optimization with wasserstein based non-stationarity
Jiashuo Jiang, Xiaocheng Li, and Jiawei Zhang · 2020
Closest in time.
Blind dynamic resource allocation in closed networks via mirror backpressure
Yash Kanoria and Pengyu Qian · 2020
Closest in time.
Knapsack secretary with bursty adversary
Thomas Kesselheim and Marco Molinaro · 2020
Closest in time.
Simple and fast algorithm for binary integer and online linear programming
Xiaocheng Li, Chunlin Sun, and Yinyu Ye · 2020
Closest in time.
Near-optimal primal-dual algorithms for quantity-based network revenue management
Rui Sun, Xinshang Wang, and Zijie Zhou · 2020
Closest in time.
Bernoulli factories and black-box reductions in mechanism design
Shaddin Dughmi, Jason Hartline, Robert D Kleinberg, and Rad Niazadeh · 2021
Closest in time.