Online stochastic matching with unequal probabilities
DOI10.1137/1.9781611973730.92zbMATH Open1372.68214OpenAlexW4243874603MaRDI QIDQ5363007FDOQ5363007
Authors: Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam 
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.92
Recommendations
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (13)
- Adwords in a panorama
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online matching with concave returns
- Approximation algorithms for stochastic combinatorial optimization problems
- Adaptive Bin Packing with Overflow
- Adaptive matching for expert systems with uncertain task types
- Online stochastic matching: new algorithms and bounds
- Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
- Online minimum matching with uniform metric and random arrivals
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Online 2-stage stable matching
- The power of multiple choices in online stochastic matching
- Improved Bounds for Online Stochastic Matching
This page was built for publication: Online stochastic matching with unequal probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363007)
