Research map / Bandits and online learning / Online convex optimization and games
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Online bipartite matching with imperfect advice (ICML 2024 · similarity 0.93)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.91)
- (Optimal) Online Bipartite Matching with Degree Information (NeurIPS 2022 · similarity 0.90)
- DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models (ICML 2025 · similarity 0.86)
- Beyond the Half Approximation: Fair and Efficient Online Class Matching (NeurIPS 2026 · similarity 0.86)
- Fairness and Efficiency in Online Class Matching (NeurIPS 2024 · similarity 0.85)
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.