Adaptive Matching for Expert Systems with Uncertain Task Types

References

• Agrawal S, Goyal N (2012) Analysis of thompson sampling for the multi-armed bandit problem. Proc. 25th Conf. Learn. Theory 23:39.1–39.26.Google Scholar
• Alresaini M, Sathiamoorthy M, Krishnamachari B, Neely M (2012) Backpressure with adaptive redundancy (BWAR). Proc. IEEE INFOCOM (IEEE, Piscataway, NJ), 2300–2308.Google Scholar
• Asmussen S (2003) Applied Probability and Queues, 2nd ed. (Springer Science & Business Media, New York).Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Bell SL, Williams RJ (2001) Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11(3):608–649.Google Scholar
• Bimpikis K, Markakis MG (2019) Learning and hierarchies in service systems. Management Sci. 75(3):955–1453.Google Scholar
• Brémaud P (2013) Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues, vol. 31 (Springer Science & Business Media, New York).Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations Trends Machine Learn. 5(1):1–122.Crossref, Google Scholar
• Bui L, Srikant R, Stolyar A (2011) A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm. IEEE/ACM Trans. Networking 19(6):1597–1609.Crossref, Google Scholar
• Chen Y, Krause A (2013) Near-optimal batch mode active learning and adaptive submodular optimization. Internat. Conf. Machine Learn. 13:160–168.Google Scholar
• Cui Y, Yeh E, Liu R (2015) Enhancing the delay performance of dynamic backpressure algorithms. IEEE/ACM Trans. Networking 24(2):954–967.Crossref, Google Scholar
• Dai JG (1995) On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5(1):49–77.Crossref, Google Scholar
• Daltayanni M, De Alfaro L, Papadimitriou P (2015) WorkerRank: Using employer implicit judgements to infer worker reputation. Proc. 8th ACM Internat. Conf. Web Search Data Mining (ACM, New York), 263–272.Google Scholar
• Fujii K, Kashima H (2016) Budgeted stream-based active learning via adaptive submodular maximization. Neural Inform. Processing Systems Conf. 16:514–522.Google Scholar
• Gao C, Lu Y, Zhou D (2016) Exact exponent in optimal rates for crowdsourcing. Internat. Conf. Machine Learn. 16:603–611.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
• Gittins J, Glazebrook K, Weber R (2011) Multi-Armed Bandit Allocation Indices (John Wiley & Sons, Chichester, UK).Crossref, Google Scholar
• Golovin D, Krause A, Ray D (2010) Near-optimal bayesian active learning with noisy observations. Neural Inform. Processing Systems Conf. 10:766–774.Google Scholar
• Harrison JM (1998) Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8(3):822–848.Crossref, Google Scholar
• Ho CJ, Vaughan JW (2012) Online task assignment in crowdsourcing markets. AAAI’12 Proc. 26th AAAI Conf. Artificial Intelligence (ACM, New York), 45–51.Google Scholar
• Javdani S, Chen Y, Karbasi A, Krause A, Bagnell D, Srinivasa SS (2014) Near optimal bayesian active learning for decision making. AISTATS Conf. 14:430–438.Google Scholar
• Ji B, Joo C, Shroff N (2013) Delay-based back-pressure scheduling in multihop wireless networks. IEEE/ACM Trans. Networking 21(5):1539–1552.Crossref, Google Scholar
• Johari R, Kamble V, Kanoria Y (2017) Matching while learning. Preprint, submitted March 15, 2016, http://arxiv.org/abs/1603.04549.Google Scholar
• Karger DR, Oh S, Shah D (2014) Budget-optimal task allocation for reliable crowdsourcing systems. Oper. Res. 62(1):1–24.Link, Google Scholar
• Kleinberg J, Sandler M (2003) Convergent algorithms for collaborative filtering. Proc. 4th ACM Conf. Electronic Commerce (ACM, New York), 1–10.Google Scholar
• Kleinberg J, Sandler M (2004) Using mixture models for collaborative filtering. Proc. 36th Annual ACM Sympos. Theory Comput. (ACM, New York).Google Scholar
• Kumar A (2014) Discrete Event Stochastic Processes: Lecture Notes for an Engineering Curriculum. Accessed May 27, 2020, https://ece.iisc.ac.in/~anurag/books/anurag/spqt.pdf.Google Scholar
• Lai T, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, Google Scholar
• Maguluri ST, Burle SK, Srikant R (2016) Optimal heavy-traffic queue length scaling in an incompletely saturated switch. SIGMETRICS Performance Evaluation Rev. 44(1):13–24.Crossref, Google Scholar
• Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.Link, Google Scholar
• Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• Massoulié L (2007) Structural properties of proportional fairness: Stability and insensitivity. Ann. Appl. Probab. 17(3):809–839.Crossref, Google Scholar
• Massoulié L, Xu K (2016) On the capacity of information processing systems. 29th Annual Conf. Learn. Theory, New York, 49:1–6.Google Scholar
• Mehta A, Panigrahi D (2012) Online matching with stochastic rewards. IEEE 53rd Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 728–737.Google Scholar
• Mehta A, Waggoner B, Zadimoghaddam M (2015) Online stochastic matching with unequal probabilities. SODA '15 Proc. 26th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1388–1404.Google Scholar
• Neely MJ, Modiano E, Rohrs CE (2003) Dynamic power allocation and routing for time-varying wireless networks. Proc. IEEE INFOCOM (IEEE, Piscataway, NJ), 745–755.Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization, vol. 18 (Wiley, New York).Crossref, Google Scholar
• Robert P (2003) Stochastic Networks and Queues, Stochastic Modelling and Applied Probability Series, vol. 52 (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
• Rybko AN, Stolyar AL (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problemy Peredachi Informatsii 28(3):3–26.Google Scholar
• Shah NB, Zhou D, Peres Y (2015) Approval voting and incentives in crowdsourcing. Internat. Conf. Machine Learn. 15:10–19.Google Scholar
• Shah V, de Veciana G, Kesidis G (2016) A stable approach for routing queries in unstructured p2p networks. IEEE/ACM Trans. Networking 24(5):3136–3147.Crossref, Google Scholar
• Stern DH, Herbrich R, Graepel T (2009) Matchbox: Large scale online Bayesian recommendations. Proc. 18th Internat. Conf. World Wide Web (ACM, New York), 111–120.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. Automation Control 37(12):1936–1948.Crossref, Google Scholar
• Tezcan T, Dai JG (2010) Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.Link, Google Scholar
• Ye HQ, Ou J, Yuan XM (2005) Stability of data networks: Stationary and bursty models. Oper. Res. 53(1):107–125.Link, Google Scholar
• Ying L, Shakkottai S, Reddy A, Liu S (2011) On combining shortest-path and back-pressure routing over multihop wireless networks. IEEE/ACM Trans. Networking 19(3):841–854.Google Scholar
• Zhang Y, Chen X, Zhou D, Jordan MI (2016) Spectral methods meet em: A provably optimal algorithm for crowdsourcing. J. Machine Learn. Res. 17(1):3537–3580.Google Scholar