Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure

References

• Adan I, Weiss G (2012) A loss system with skill-based servers under assign to longest idle server policy. Probability Engrg. Inform. Sci. 26(3):307–321.Crossref, Google Scholar
• Agarwal N, Ashlagi I, Azevedo E, Featherstone CR, Karaduman Ö (2019) Market failure in kidney exchange. Amer. Econom. Rev. 109(11):4026–4070.Crossref, Google Scholar
• Agrawal S, Devanur NR (2014) Fast algorithms for online stochastic convex programming. Krauthgamer R, ed. Proc. 26th Annual ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 1405–1424.Google Scholar
• Balseiro SR, Brown DB, Chen C (2021) Dynamic pricing of relocating resources in large networks. Management Sci. 67(7):4075–4094.Link, Google Scholar
• Banerjee S, Freund D, Lykouris T (2021) Pricing and optimization in shared vehicle systems: An approximation framework. Oper. Res. 70(3):1783–1805.Google Scholar
• Banerjee S, Kanoria Y, Qian P (2018) Dynamic assignment control of a closed queueing network under complete resource pooling. Preprint, submitted March 13, https://arxiv.org/abs/1803.04959.Google Scholar
• Beck A, Teboulle M (2003) Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3):167–175.Crossref, Google Scholar
• Bertsekas DP (1995) Dynamic Programming and Optimal Control, vol. 1 (Athena Scientific, Belmont, MA).Google Scholar
• Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Link, Google Scholar
• Bubeck S, Cohen MB, Lee YT, Lee JR, Ma¸dry A (2018) K-server via multiscale entropic regularization. Proc. 50th Annual ACM SIGACT Sympos. on Theory of Comput. (ACM, New York), 3–16.Google Scholar
• Buchholz N (2022) Spatial equilibrium, search frictions, and dynamic efficiency in the taxi industry. Rev. Econom. Stud. 89(2):556–591.Crossref, Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Bušić A, Meyn S (2015) Approximate optimality with bounded regret in dynamic matching models. Performance Evaluation Rev. 43(2):75–77.Crossref, Google Scholar
• Caldentey R, Kaplan EH, Weiss G (2009) Fcfs infinite bipartite matching of servers and customers. Adv. Appl. Probability 41(3):695–730.Crossref, Google Scholar
• Chung H, Freund D, Shmoys DB (2018) Bike angels: An analysis of Citi bike’s incentive program. Proc. 1st ACM SIGCAS Conf. on Comput. and Sustainable Societies (ACM, New York), 5.Google Scholar
• Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
• Dai JG, Lin W (2008) Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probability 18(6):2239–2299.Crossref, Google Scholar
• Désir A, Goyal V, Wei Y, Zhang J (2016) Sparse process flexibility designs: Is the long chain really optimal? Oper. Res. 64(2):416–431.Link, Google Scholar
• Eryilmaz A, Srikant R (2007) Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. IEEE/ACM Trans. Networks 15(6):1333–1344.Crossref, Google Scholar
• Eryilmaz A, Srikant R (2012) Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems 72(3–4):311–359.Crossref, Google Scholar
• Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Georgiadis L, Neely MJ, Tassiulas L (2006) Resource allocation and cross-layer control in wireless networks. Foundations Trends Networking 1(1):1–144.Crossref, Google Scholar
• Gupta A, Molinaro M (2016) How the experts algorithm can help solve lps online. Math. Oper. Res. 41(4):1404–1431.Link, Google Scholar
• Gupta V, Radovanović A (2020) Interior-point-based online stochastic bin packing. Oper. Res. 68(5):1474–1492.Link, Google Scholar
• Harrison JM (2003) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probability 13(1):390–393.Crossref, Google Scholar
• Huang L, Neely MJ (2009) Delay reduction via Lagrange multipliers in stochastic network optimization. Proc. 7th Internat. Sympos. on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (IEEE, Piscataway, NJ), 1–10.Google Scholar
• Huang L, Neely MJ (2011) Utility optimal scheduling in processing networks. Performance Evaluation 68(11):1002–1021.Crossref, Google Scholar
• Jiang L, Walrand J (2009) Stable and utility-maximizing scheduling for stochastic processing networks. Proc. 47th Annual Allerton Conf. on Comm., Control, and Comput. (IEEE, Piscataway, NJ), 1111–1119.Google Scholar
• Johnson K, Simchi-Levi D, Sun P (2014) Analyzing scrip systems. Oper. Res. 62(3):524–534.Link, Google Scholar
• Jordan WC, Graves SC (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
• Ma H, Fang F, Parkes DC (2019) Spatio-temporal pricing for ridesharing platforms. Proc. ACM Conf. on Econom. and Comput., 583–583.Google Scholar
• Mairesse J, Moyal P (2016) Stability of the stochastic matching model. J. Appl. Probability 53(4):1064–1077.Crossref, Google Scholar
• Neely MJ (2006) Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks. IEEE J. Selected Areas Comm. 24(8):1489–1501.Crossref, Google Scholar
• Neely MJ (2010) Stochastic network optimization with application to communication and queueing systems. Synthesis Lectures Comm. Networks 3(1):1–211.Crossref, Google Scholar
• Nemirovsky AS, Yudin DB (1983) Problem complexity and method efficiency in optimization. Problem Complexity and Method Efficiency in Optimization (John Wiley & Sons, New York).Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Shi C, Wei Y, Zhong Y (2019) Process flexibility for multiperiod production systems. Oper. Res. 67(5):1300–1320.Link, Google Scholar
• Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probability 14(1):1–53.Crossref, Google Scholar
• Stolyar AL (2005) Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems 50(4):401–457.Crossref, Google Scholar
• Talluri KT, Van Ryzin GJ (2006) The Theory and Practice of Revenue Management, vol. 68 (Springer Science & Business Media, Boston).Google Scholar
• Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automated Control 37(12):1936–1948.Crossref, Google Scholar
• Walton N (2015) Concave switching in single-hop and multihop networks. Queueing Systems 81(2):265–299.Crossref, Google Scholar
• Williamson DP (2019) Network Flow Algorithms (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar