New algorithms, better bounds, and a novel model for online stochastic matching
DOI10.4230/LIPICS.ESA.2016.24zbMATH Open1397.68228MaRDI QIDQ4606293FDOQ4606293
Brian Brubach, Pan Xu, Aravind Srinivasan, Karthik Abinav Sankararaman
Publication date: 2 March 2018
Recommendations
- Online stochastic matching: new algorithms and bounds
- Online stochastic matching: new algorithms with better bounds
- Improved Bounds for Online Stochastic Matching
- Online stochastic matching: online actions based on offline statistics
- Online stochastic matching: online actions based on offline statistics
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Combinatorial optimization (90C27) Stochastic programming (90C15) Marketing, advertising (90B60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Internet topics (68M11)
Cited In (16)
- Stochastic Online Metric Matching
- Stochastic Matching with Few Queries: New Algorithms and Tools
- Title not available (Why is that?)
- Online matching with concave returns
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Title not available (Why is that?)
- Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
- Online Vertex-Weighted Bipartite Matching
- An Experimental Study of Algorithms for Online Bipartite Matching
- Advice complexity of online non-crossing matching
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- The power of multiple choices in online stochastic matching
- On conceptually simple algorithms for variants of online bipartite matching
- Improved Bounds for Online Stochastic Matching
This page was built for publication: New algorithms, better bounds, and a novel model for online stochastic matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606293)
