Fair Resource Allocation in a Volatile Marketplace

Published Online:https://doi.org/10.1287/opre.2020.2049

References

  • Adelman, Daniel, Mersereau AJ (2013) Dynamic capacity allocation to customers who remember past service. Management Sci. 59(3):592–612.LinkGoogle Scholar
  • Adsul B, Babu CS, Garg JG, Mehta R, Sohoni M (2010) Nash Equilibria in Fisher Market (Springer, Berlin), 30–41.CrossrefGoogle Scholar
  • Aflaki S, Popescu I (2013) Managing retention in service relationships. Management Sci. 60(2):415–433.LinkGoogle Scholar
  • Agrawal S, Devanur NR (2015) Fast algorithms for online stochastic convex programming. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM), 1405–1424.Google Scholar
  • Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.LinkGoogle Scholar
  • Azar Y, Buchbinder N, Jain K (2010) How to allocate goods in an online market? Algorithms—ESA 2010 (Springer, Berlin), 51–62.CrossrefGoogle Scholar
  • Babaioff M, Blumrosen L, Roth A (2010) Auctions with online supply. Proceedings of the 11th ACM conference on Electronic commerce (ACM), 13–22.Google Scholar
  • Balseiro SR, Gurkan H, Sun P (2019) Multiagent mechanism design without money. Oper. Res. 67(5):1417–1436.LinkGoogle Scholar
  • Balseiro SR, Feldman J, Mirrokni V, Muthukrishnan S (2014) Yield optimization of display advertising with ad exchange. Management Sci. 60(12):2886–2907.LinkGoogle Scholar
  • Barnhart C, Bertsimas D, Caramanis C, Fearing D (2012) Equitable and efficient coordination in traffic flow management. Transportation Sci. 46(2):262–280.LinkGoogle Scholar
  • Bertsekas DP, Gallager RG, Humblet P (1992) Data Networks, Vol. 2 (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
  • Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
  • Bertsimas D, Vivek F, Farias NT (2011) The price of fairness. Oper. Res. 59(1):17–31.LinkGoogle Scholar
  • Bertsimas D, Vivek F, Farias NT (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.LinkGoogle Scholar
  • Bertsimas D, Vivek F, Farias NT (2013) Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61(1):73–87.LinkGoogle Scholar
  • Besbes O, Maglaras C (2009) Revenue optimization for a make-to-order queue in an uncertain market environment. Oper. Res. 57(6):1438–1450.LinkGoogle Scholar
  • Bhalgat A, Feldman J, Mirrokni V (2012) Online allocation of display ads with smooth delivery. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM), 1213–1221.Google Scholar
  • Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Brânzei S, Chen Y, Deng X, Filos-Ratsikas A, Fredericksen S, Zhang J (2014) The fisher market game: equilibrium and welfare. Proceedings of the AAAI Conference on Artificial Intelligence, 587–593.Google Scholar
  • Brockwell PJ, Davis RA (2013) Time Series: Theory and Methods (Springer Science & Business Media, Berlin).Google Scholar
  • Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. European Symposium on Algorithms (Springer, Berlin), 253–264.Google Scholar
  • Chen Y, Farias VF (2013) Simple policies for dynamic pricing with imperfect forecasts. Oper. Res. 61(3):612–624.LinkGoogle Scholar
  • Ciocan DF, Farias V (2012) Model predictive control for dynamic resource allocation. Math. Oper. Res. 37(3):501–525.LinkGoogle Scholar
  • Cole R, Tao Y 2015. The price of anarchy of large walrasian auctions. arXiv preprint arXiv:1508.07370.Google Scholar
  • Devanur, Nikhil R, Papadimitriou CH, Saberi A, Vazirani VV (2008) Market equilibrium via a primal–dual algorithm for a convex program. J. ACM 55(5):22.CrossrefGoogle Scholar
  • Eghbali R, Fazel M (2016) Designing smoothing functions for improved worst-case competitive ratio in online optimization. Adv. Neural Inform. Processing Systems. vol. 29, 3287–3295.Google Scholar
  • Eisenberg E, Gale D (1959) Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Statist. 30(1):165–168.CrossrefGoogle Scholar
  • Eryilmaz A, Srikant R (2005) Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3 (IEEE), 1794–1803.Google Scholar
  • Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. Algorithms—ESA 2010 (Springer, Berlin), 182–194.CrossrefGoogle Scholar
  • Fink AM, Jodei M Jr (1984) On chebyshev’s other inequality. Inequalities in Statistics and Probability (Institute of Mathematical Statistics), 115–120.Google Scholar
  • Gallego G, Van Ryzin G (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24–41.LinkGoogle Scholar
  • Goel G, Mirrokni V, Leme RP (2015) Clinching auctions with online supply. Games Econom. Behav. 123:342–358.CrossrefGoogle Scholar
  • Gorokh A, Banerjee S, Iyer K (2021) From monetary to nonmonetary mechanism design via artificial currencies. Math. Oper. Res., ePub ahead of print Feb 11, https://doi.org/10.1287/moor.2020.1098.LinkGoogle Scholar
  • Iancu DA, Trichakis N (2014) Fairness and efficiency in multiportfolio optimization. Oper. Res. 62(6):1285–1301.LinkGoogle Scholar
  • Jain K (2007) A polynomial time algorithm for computing an arrow-debreu market equilibrium for linear utilities. SIAM J. Comput. 37(1):303–318.CrossrefGoogle Scholar
  • Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (ACM), 352–358.Google Scholar
  • Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49:237–252.CrossrefGoogle Scholar
  • Kilcioglu C, Maglaras C (2015) Revenue maximization for cloud computing services. Perform. Eval. Rev. 43(3):1–35.CrossrefGoogle Scholar
  • Liao H, Peng L, Liu Z, Shen X (2014) Ipinyou global rtb bidding algorithm competition data set. Proceedings of the Eighth International Workshop on Data Mining for Online Advertising (ACM), 1–6.Google Scholar
  • Lobos A, Grigas P, Wen Z, Lee K (2018) Optimal bidding, allocation and budget spending for a demand side platform under many auction types. Preprint, submitted May 29, 2018, https://arxiv.org/abs/1805.11645.Google Scholar
  • Mahdian M, Saberi A (2006) Multi-unit auctions with unknown supply. Proceedings of the 7th ACM Conference on Electronic Commerce (ACM), 243–249.Google Scholar
  • Megiddo N, Vazirani VV (2007) Continuity properties of equilibrium prices and allocations in linear fisher markets. Internet and Network Economics. (Springer, Berlin), 362–367.CrossrefGoogle Scholar
  • Mehta R, Thain N, Végh LA (2014) To save or not to save: The fisher game. International Conference on Web and Internet Economics, 294–307.Google Scholar
  • Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM. 54(5):22.CrossrefGoogle Scholar
  • Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8(5):556–567.CrossrefGoogle Scholar
  • Nash JF (1950) The bargaining problem. Econometrica. 18(2):155–162.CrossrefGoogle Scholar
  • Nisan N, Bayer J, Chandra D, Franji T, Gardner R, Matias Y, Rhodes N, et al. (2009) Google’s auction for TV ads. ICALP 2009: Automata, Languages, and Programming (Springer, Berlin), 309–327.Google Scholar
  • Pan American Health Organization, Division of Emergency, Humanitarian Action (2001) Humanitarian Supply Management and Logistics in the Health Sector. (Pan American Health Organization, Washington, DC).Google Scholar
  • Su X, Zenios SA (2006) Recipient choice can address the efficiency-equity trade-off in kidney transplantation: A mechanism design model. Management Sci. 52(11):1647–1660.LinkGoogle Scholar
  • Talluri K, Van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Manage. Sci. 44(11):1577–1593.LinkGoogle Scholar
  • Talluri KT, Van Ryzin G (2006) The Theory and Practice of Revenue Management, Vol. 68 (Springer Science & Business Media, Berlin).Google Scholar
  • Tomasini RM, Van Wassenhove LM (2009) From preparedness to partnerships: case study research on humanitarian logistics. Internat. Trans. Oper. Res. 16(5):549–559.CrossrefGoogle Scholar
  • Truong VA, Wang X (2018) Online two-sided bipartite matching. Working paper, Columbia University, New York.Google Scholar
  • Vazirani VV (2010) Spending constraint utilities with applications to the adwords market. Math. Oper. Res. 35(2):458–478.LinkGoogle Scholar
  • Wang X, Truong VA, Bank D (2018) Online advance admission scheduling for services with customer preferences. Preprint, submitted May 26, 2018, https://arxiv.org/abs/1805.10412.Google Scholar
  • Wang X, Truong VA, Zhu S, Zhang Q (2016) Dynamic optimization of mobile push advertising campaigns. Working paper, Columbia University, New York.Google Scholar
  • Ye Y (2008) A path to the arrow–debreu competitive market equilibrium. Math. Program. 111(1-2):315–348.CrossrefGoogle Scholar
  • Zhang C, Atasu A, Ayer T, Toktay LB (2017) Truthful mechanisms for medical surplus product allocation. Manufacturing Service Oper. Management 22(4):645–867.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.