Finally Rank-Breaking Conquers MNL Bandits: Optimal and Efficient Algorithms for MNL Assortment

Aadirupa Saha, Pierre Gaillard
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{saha2026finally,
  title  = {Finally Rank-Breaking Conquers MNL Bandits: Optimal and Efficient Algorithms for MNL Assortment},
  author = {Aadirupa Saha and Pierre Gaillard},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:6540d74cf7bb13a66ed8c923aa0a4f37c4889c1b},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/6540d74cf7bb13a66ed8c923aa0a4f37c4889c1b.svg)](https://codeofpaper.com/paper/6540d74cf7bb13a66ed8c923aa0a4f37c4889c1b)

Discussion