Research map / Bandits and online learning / Multi-armed bandits
Matching in Multi-arm Bandit with Collision
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use ML-ETC instead of Phased-ETC | decentralized bandit matching · simulation, 5 agents 5 arms, T=2.5e7, gap 0.05 | cumulative regret | Mixed |
| use ML-ETC instead of CA-UCB | decentralized bandit matching · simulation, 5 agents 5 arms, T=2.5e7 | cumulative regret | Helped |
| require very high estimation confidence before exploitation in ML-ETC | ML-ETC · simulation, small time horizon | cumulative regret | Hurt |
Closest papers by meaning
- Heterogeneous Multi-Agent Bandits with Parsimonious Hints (AAAI 2025 · similarity 0.89)
- Stochastic Matching Bandits with Rare Optimization Updates (NeurIPS 2026 · similarity 0.88)
- Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility (AAAI 2024 · similarity 0.88)
- Improved Analysis for Bandit Learning in Matching Markets (NeurIPS 2024 · similarity 0.88)
- Optimal Algorithm for Max-Min Fair Bandit (ICML 2025 · similarity 0.88)
- Competing Bandits in Matching Markets via Super Stability (ICML 2025 · similarity 0.88)
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.