Fetching the paper…
Reading the bibliography…
Online allocation problems with resource constraints have a rich history in operations research.
The bargaining problem
John F Nash Jr · 1950
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.
Fair end-to-end window-based congestion control
Jeonghoon Mo and Jean Walrand · 2000
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
The santa claus problem
Nikhil Bansal and Maxim Sviridenko · 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.
Toward robust revenue management: Competitive analysis of online booking
Michael O. Ball and Maurice Queyranne · 2009
Earlier work this paper cites.
Convex optimization theory
Dimitri P Bertsekas · 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.
Online ad assignment with free disposal
Jon Feldman, Nitish Korula, Vahab Mirrokni, S. Muthukrishnan, and Martin Pál · 2009
Earlier work this paper cites.
How to allocate goods in an online market?
Yossi Azar, Niv Buchbinder, and Kamal Jain · 2010
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.
The price of fairness
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis · 2011
Earlier work this paper cites.
On the efficiency-fairness trade-off
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis · 2012
Earlier work this paper cites.
Online matching with concave returns
Nikhil R. Devanur and Kamal Jain · 2012
Earlier work this paper cites.
Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation , pages 1690–1701
Vahab S. Mirrokni, Shayan Oveis Gharan, and Morteza Zadimoghaddam · 2012
Earlier work this paper cites.
Online learning and online convex optimization
Shai Shalev-Shwartz et al · 2012
Earlier work this paper cites.
Online matching and ad allocation
Aranyak Mehta · 2013
Cited alongside, same era.
Dynamic cloud pricing for revenue maximization
Hong Xu and Baochun Li · 2013
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.
Yield optimization of display advertising with ad exchange
Santiago R Balseiro, Jon Feldman, Vahab Mirrokni, and Shan Muthukrishnan · 2014
Cited alongside, same era.
Sequential resource allocation for nonprofit operations
Robert W. Lien, Seyed M. R. Iravani, and Karen R. Smilowitz · 2014
Cited alongside, same era.
Fast algorithms for online stochastic convex programming
Shipra Agrawal and Nikhil R. Devanur · 2015
Cited alongside, same era.
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.
Balancing relevance and diversity in online bipartite matching via submodularity
John P Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu · 2019
Later among the works it cites.
Achieving high individual service-levels without safety stock? optimal rationing policy of pooled resources
Jiashuo Jiang, Shixin Wang, and Jiawei Zhang · 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.
The best of many worlds: Dual mirror descent for online allocation problems
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex optimization: Algorithms and complexity
S. Bubeck · 2015
Cited alongside, same era.
Performance of an lp-based control for revenue management with unknown demand parameters
Stefanus Jasin · 2015
Cited alongside, same era.
Cvxpy: A python-embedded modeling language for convex optimization
Steven Diamond and Stephen Boyd · 2016
Cited alongside, same era.
Designing smoothing functions for improved worst-case competitive ratio in online optimization
Reza Eghbali and Maryam Fazel · 2016
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan et al · 2016
Cited alongside, same era.
Online optimization and regret guarantees for non-additive long-term constraints
Rodolphe Jenatton, Jim Huang, Dominik Csiba, and Cedric Archambeau · 2016
Cited alongside, same era.
Online planning with offline simulation
Wang Chi Cheung, Guodong Lyu, Chung-Piaw Teo, and Hai Wang · 2020
Closest in time.
Fair allocation of scarce medical resources in the time of covid-19
Ezekiel J. Emanuel, Govind Persad, Ross Upshur, Beatriz Thome, Michael Parker, Aaron Glickman, Cathy Zhang, Connor Boyle, Maxwell Smith, and James P. Phillips · 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.
Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios
Will Ma and David Simchi-Levi · 2020
Closest in time.
Group-level fairness maximization in online bipartite matching
Will Ma and Pan Xu · 2020
Closest in time.
Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours
Vedant Nanda, Pan Xu, Karthik Abhinav Sankararaman, John Dickerson, and Aravind Srinivasan · 2020
Closest in time.
Mechanism design for online resource allocation: A unified approach
Xiaoqi Tan, Bo Sun, Alberto Leon-Garcia, Yuan Wu, and Danny HK Tsang · 2020
Closest in time.
Regularized online allocation problems: Fairness and beyond
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni · 2021
Closest in time.
When algorithms discriminate
Claire Cain Miller · 2021
Closest in time.
The parity ray regularizer for pacing in auction markets
Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, and Eric Sodomka · 2021
Closest in time.
Optimal bidding, allocation, and budget spending for a demand-side platform with generic auctions
Paul Grigas, Alfonso Lobos, Zheng Wen, and Kuang-Chih Lee · 2021
Closest in time.
Fair dynamic rationing
Vahideh Manshadi, Rad Niazadeh, and Scott Rodilitz · 2021
Closest in time.