Research map / Learning theory and algorithms / Prediction and decision losses
Secretary and Online Matching Problems with Machine Learned Advice
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
- The Secretary Problem with Predicted Additive Gap (NeurIPS 2024 · similarity 0.88)
- Fair Secretaries with Unfair Predictions (NeurIPS 2024 · similarity 0.88)
- Online bipartite matching with imperfect advice (ICML 2024 · similarity 0.87)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.87)
- Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning (ICML 2024 · similarity 0.86)
- DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models (ICML 2025 · 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.