Research map / Bandits and online learning / Online convex optimization and games
Bandit Learning in Matching Markets Robust to Adversarial Corruptions
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
- Improved Analysis for Bandit Learning in Matching Markets (NeurIPS 2024 · similarity 0.90)
- Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility (AAAI 2024 · similarity 0.89)
- Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning (ICML 2024 · similarity 0.89)
- Competing Bandits in Matching Markets via Super Stability (ICML 2025 · similarity 0.89)
- Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification (NeurIPS 2024 · similarity 0.88)
- Stochastic Bandits Robust to Adversarial Attacks (ICLR 2025 · similarity 0.87)
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.