Online Stochastic Matching with Unequal Probabilities

DOI10.1137/1.9781611973730.92zbMath1372.68214OpenAlexW4243874603MaRDI QIDQ5363007

Morteza Zadimoghaddam, Bo Waggoner, Aranyak Mehta

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

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) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Adaptive Matching for Expert Systems with Uncertain Task Types ⋮ Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios ⋮ Online stochastic matching: new algorithms and bounds ⋮ Adaptive Bin Packing with Overflow

This page was built for publication: Online Stochastic Matching with Unequal Probabilities