Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
- 13 July 2019
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 82 (1) , 64-87
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Directorate for Computer and Information Science and Engineering (1010789, 1422569)
- Directorate for Computer and Information Science and Engineering (1749864)
- Adobe
This publication has 16 references indexed in Scilit:
- A Dynamic Near-Optimal Algorithm for Online Linear ProgrammingOperations Research, 2014
- Online Stochastic Matching: New Algorithms with Better BoundsMathematics of Operations Research, 2014
- Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract2013
- Online Stochastic Matching: Online Actions Based on Offline StatisticsMathematics of Operations Research, 2012
- Online Stochastic Weighted Matching: Improved Approximation Algorithms2011
- Improved Bounds for Online Stochastic Matching2010
- Approximating Matches Made in Heaven2009
- AdWords and generalized online matchingJournal of the ACM, 2007
- Dependent rounding and its applications to approximation algorithmsJournal of the ACM, 2006
- An optimal deterministic algorithm for online b-matchingTheoretical Computer Science, 2000