Research map / Bandits and online learning / Online convex optimization and games
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
Nathan Noiry, Vianney Perchet, Flore Sentenac
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use GREEDY rather than RANKING | Online matching on a 2-regular bipartite configuration model · 2-regular bipartite configuration model | competitive ratio | Improved |
| Increase the common degree in regular configuration models | GREEDY · d-regular bipartite configuration models, d ≥ 2 | competitive ratio | Improved |
| Use a fixed degree d for online vertices instead of Poisson-distributed degrees with mean d | GREEDY · Configuration models with the offline degree distribution fixed | matching size | Improved |
| Merge equal-degree vertices into fewer vertices with higher capacity | GREEDY · Configuration models with capacities | expected performance | Improved |
Closest papers by meaning
- (Optimal) Online Bipartite Matching with Degree Information (NeurIPS 2022 · similarity 0.92)
- Online bipartite matching with imperfect advice (ICML 2024 · similarity 0.88)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.87)
- DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models (ICML 2025 · similarity 0.87)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.86)
- Stochastic Matching via Local Sparsification (NeurIPS 2026 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
