Online Resource Allocation with Matching Constraints
暂无分享,去创建一个
Aravind Srinivasan | Kun-Lung Wu | John P. Dickerson | Pan Xu | Karthik Abinav Sankararaman | Kanthi Kiran Sarpatwar | Kun-Lung Wu | A. Srinivasan | Pan Xu
[1] Nikhil R. Devanur,et al. Bandits with concave rewards and convex knapsacks , 2014, EC.
[2] John Langford,et al. Resourceful Contextual Bandits , 2014, COLT.
[3] Jieping Ye,et al. Flexible Online Task Assignment in Real-Time Spatial Data , 2017, Proc. VLDB Endow..
[4] Aleksandrs Slivkins,et al. Combinatorial Semi-Bandits with Knapsacks , 2017, AISTATS.
[5] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[6] Nikhil R. Devanur,et al. Linear Contextual Bandits with Knapsacks , 2015, NIPS.
[7] E. Pierson,et al. A large-scale analysis of racial disparities in police stops across the United States , 2017, 1706.05678.
[8] Aleksandrs Slivkins,et al. Online decision making in crowdsourcing markets: theoretical challenges , 2013, SECO.
[9] Yu Zheng,et al. T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[10] Fabrizio Grandoni,et al. Improved Approximation Algorithms for Stochastic Matching , 2015, ESA.
[11] Nikhil R. Devanur,et al. Fast Algorithms for Online Stochastic Convex Programming , 2014, SODA.
[12] Archana Ganapathi,et al. Analysis and Lessons from a Publicly Available Google Cluster Trace , 2010 .
[13] J. Chaiken,et al. A Patrol Car Allocation Model: Background , 1978 .
[14] Will Ma. Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Full Version , 2013, SODA 2014.
[15] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[16] Scott Shenker,et al. Choosy: max-min fair sharing for datacenter jobs with constraints , 2013, EuroSys '13.
[17] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[18] Omar Besbes,et al. Blind Network Revenue Management , 2011, Oper. Res..
[19] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[20] Mohammad Taghi Hajiaghayi,et al. The Online Stochastic Generalized Assignment Problem , 2013, APPROX-RANDOM.
[21] Bo An,et al. Computing Optimal Mixed Strategies for Security Games with Dynamic Payoffs , 2015, IJCAI.
[22] Tansu Alpcan,et al. Security Games for Vehicular Networks , 2008, IEEE Transactions on Mobile Computing.
[23] Mung Chiang,et al. Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework , 2013, TNET.
[24] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[25] Pramodita Sharma. 2012 , 2013, Les 25 ans de l’OMC: Une rétrospective en photos.
[26] Aravind Srinivasan,et al. Allocation Problems in Ride-sharing Platforms , 2017, AAAI.
[27] Aravind Srinivasan,et al. Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals , 2018, AAMAS.
[28] Richard F. Crowther,et al. Quantitative Methods for Optimizing the Allocation of Police Resources , 1966 .
[29] Nikhil R. Devanur,et al. An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives , 2015, COLT.
[30] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[31] James Allan,et al. Matching resumes and jobs based on relevance models , 2007, SIGIR.
[32] Lori S. Franz,et al. Optimizing State Patrol Manpower Allocation , 1979 .
[33] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[34] Rong Yang,et al. Adaptive resource allocation for wildlife protection against illegal poachers , 2014, AAMAS.
[35] Vyas Sekar,et al. Multi-resource fair queueing for packet processing , 2012, CCRV.
[36] Xiang-Yang Li,et al. How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[37] Arnoud V. den Boer,et al. Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution , 2014, Math. Oper. Res..
[38] A. James. 2010 , 2011, Philo of Alexandria: an Annotated Bibliography 2007-2016.
[39] Ruoming Jin,et al. Large Scale Real-time Ridesharing with Service Guarantee on Road Networks , 2014, Proc. VLDB Endow..
[40] Aleksandrs Slivkins,et al. Bandits with Knapsacks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[41] Oded Schwartz,et al. On the complexity of approximating k-set packing , 2006, computational complexity.
[42] Andreas Krause,et al. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.
[43] A. Subramanian,et al. Online incentive mechanism design for smartphone crowd-sourcing , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).
[44] Berthold Vöcking,et al. Primal beats dual on online packing LPs in the random-order model , 2014, STOC.
[45] Sepehr Assadi,et al. Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets , 2015, HCOMP.
[46] Ricardo Guedes,et al. Multiagent models for police resource allocation and dispatch , 2014, 2014 IEEE Joint Intelligence and Security Informatics Conference.
[47] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[48] Van-Anh Truong,et al. Online Advance Admission Scheduling for Services with Customer Preferences. , 2018 .
[49] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[50] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[51] Chien-Ju Ho,et al. Online Task Assignment in Crowdsourcing Markets , 2012, AAAI.
[52] Yaron Singer,et al. Pricing mechanisms for crowdsourcing markets , 2013, WWW.
[53] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[54] Ariel D. Procaccia,et al. No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.
[55] David Simchi-Levi,et al. Assortment Planning for Recommendations at Checkout under Inventory Constraints , 2016 .