AI Paper Atlas

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

NeurIPS 2021 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use GREEDY rather than RANKINGOnline matching on a 2-regular bipartite configuration model · 2-regular bipartite configuration modelcompetitive ratioImproved
Increase the common degree in regular configuration modelsGREEDY · d-regular bipartite configuration models, d ≥ 2competitive ratioImproved
Use a fixed degree d for online vertices instead of Poisson-distributed degrees with mean dGREEDY · Configuration models with the offline degree distribution fixedmatching sizeImproved
Merge equal-degree vertices into fewer vertices with higher capacityGREEDY · Configuration models with capacitiesexpected performanceImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy