New algorithms, better bounds, and a novel model for online stochastic matching
DOI10.4230/LIPICS.ESA.2016.24zbMATH Open1397.68228MaRDI QIDQ4606293FDOQ4606293
Authors: Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 
Publication date: 2 March 2018
Recommendations
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 (18)
- 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
- A polyhedral approach to online bipartite 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
- Stochastic online metric matching
- Online stochastic matching: new algorithms and bounds
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
- Online stochastic matching: new algorithms with better bounds
- 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
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- The power of multiple choices in online stochastic 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)
