Online stochastic matching with unequal probabilities

DOI10.1137/1.9781611973730.92MaRDI QIDQ5363007zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Online stochastic matching: new algorithms with better bounds
• Online stochastic matching: new algorithms and bounds
• Improved Bounds for Online Stochastic Matching

Cited in

(13)

• Online minimum matching with uniform metric and random arrivals
• The power of multiple choices in online stochastic matching
• Adaptive Bin Packing with Overflow
• Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
• Online matching with concave returns
• Adwords in a panorama
• Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
• Adaptive matching for expert systems with uncertain task types
• Improved Bounds for Online Stochastic Matching
• Approximation algorithms for stochastic combinatorial optimization problems
• Online 2-stage stable matching
• Online stochastic matching: new algorithms and bounds
• Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation

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)