Fetching the paper…
Reading the bibliography…
We study the classical Network Revenue Management (NRM) problem with accept/reject decisions and $T$ IID arrivals.
The behavior of maximum likelihood estimates under nonstandard conditions
P. J. Huber · 1967
Earlier work this paper cites.
Minimizing a submodular function on a lattice
D. M. Topkis · 1978
Earlier work this paper cites.
Optimal auction design
R. B. Myerson · 1981
Earlier work this paper cites.
Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems
O. L. Mangasarian and T.-H. Shiau · 1987
Earlier work this paper cites.
Who solved the secretary problem?
T. S. Ferguson · 1989
Earlier work this paper cites.
On the ε \varepsilon -perturbation method for avoiding degeneracy
N. Megiddo and R. Chandrasekaran · 1989
Earlier work this paper cites.
Optimization and nonsmooth analysis
F. H. Clarke · 1990
Earlier work this paper cites.
Perturbation analysis of optimization problems in banach spaces
A. Shapiro · 1992
Earlier work this paper cites.
Asymptotic behavior of optimal solutions in stochastic programming
A. Shapiro · 1993
Earlier work this paper cites.
A multiproduct dynamic pricing problem and its applications to network yield management
G. Gallego and G. Van Ryzin · 1997
Earlier work this paper cites.
Average-case analysis of off-line and on-line knapsack problems
G. S. Lueker · 1998
Earlier work this paper cites.
An analysis of bid-price controls for network revenue management
K. Talluri and G. Van Ryzin · 1998
Earlier work this paper cites.
Adwords and generalized online matching
A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani · 2007
Earlier work this paper cites.
An asymptotically optimal policy for a quantity-based network revenue management problem
M. I. Reiman and Q. Wang · 2008
Earlier work this paper cites.
Online primal-dual algorithms for covering and packing
N. Buchbinder and J. Naor · 2009
Earlier work this paper cites.
Multi-parameter mechanism design and sequential posted pricing
S. Chawla, J. D. Hartline, D. L. Malec, and B. Sivan · 2010
Earlier work this paper cites.
A re-solving heuristic with bounded revenue loss for network revenue management with customer choice
S. Jasin and S. Kumar · 2012
Cited alongside, same era.
Perturbation analysis of optimization problems
J. F. Bonnans and A. Shapiro · 2013
Cited alongside, same era.
Mechanism design and approximation
J. D. Hartline · 2013
Cited alongside, same era.
Analysis of deterministic lp-based booking limit and bid price controls for revenue management
S. Jasin and S. Kumar · 2013
Cited alongside, same era.
A dynamic near-optimal algorithm for online linear programming
S. Agrawal, Z. Wang, and Y. Ye · 2014
Cited alongside, same era.
How experts can solve lps online
A. Gupta and M. Molinaro · 2014
Cited alongside, same era.
Online resource allocation with stochastic resource consumption
J. Jiang and J. Zhang · 2020
Later among the works it cites.
Online stochastic optimization with wasserstein based non-stationarity
J. Jiang, X. Li, and J. Zhang · 2020
Later among the works it cites.
Simple and fast algorithm for binary integer and online linear programming
X. Li, C. Sun, and Y. Ye · 2020
Later among the works it cites.
Survey of dynamic resource constrained reward collection problems: Unified model and analysis
S. Balseiro, O. Besbes, and D. Pizarro · 2021
Later among the works it cites.
Online linear programming: Dual convergence, new algorithms, and regret bounds
X. Li and Y. Ye · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Reoptimization and self-adjusting price control for network revenue management
S. Jasin · 2014
Cited alongside, same era.
Primal beats dual on online packing lps in the random-order model
T. Kesselheim, A. Tönnis, K. Radke, and B. Vöcking · 2014
Cited alongside, same era.
The geometry of online packing linear programs
M. Molinaro and R. Ravi · 2014
Cited alongside, same era.
Uniformly bounded regret in the multisecretary problem
A. Arlotto and I. Gurvich · 2019
Cited alongside, same era.
Does the multisecretary problem always have bounded regret?
R. Bray · 2019
Cited alongside, same era.
Good prophets know when the end is near
D. Freund and S. Banerjee · 2019
Cited alongside, same era.
The bayesian prophet: A low-regret framework for online decision making
A. Vera and S. Banerjee · 2021
Later among the works it cites.
Online allocation and pricing: Constant regret via bellman inequalities
A. Vera, S. Banerjee, and I. Gurvich · 2021
Later among the works it cites.
Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources
J. Baek and W. Ma · 2022
Closest in time.
Uniformly bounded regret in dynamic fair allocation
S. R. Balseiro and S. Xia · 2022
Closest in time.
The best of many worlds: Dual mirror descent for online allocation problems
S. R. Balseiro, H. Lu, and V. Mirrokni · 2022
Closest in time.
The multi-secretary problem with many types
O. Besbes, Y. Kanoria, and A. Kumar · 2022
Closest in time.
R. Bray · 2022
Closest in time.
Overbooking with bounded loss
D. Freund and J. Zhao · 2022
Closest in time.
Constant regret resolving heuristics for price-based revenue management
Y. Wang and H. Wang · 2022
Closest in time.
Dynamic resource allocation: Algorithmic design principles and spectrum of achievable performances
O. Besbes, Y. Kanoria, and A. Kumar · 2023
Closest in time.