A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters (Q5051208): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: MNL-Bandit: A Dynamic Learning Approach to Assortment Selection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on a tight lower bound for capacitated MNL-bandit assortment selection models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Assortment Personalization in High Dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4595047 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint / rank | |||
Normal rank | |||
Latest revision as of 22:41, 30 July 2024
scientific article; zbMATH DE number 7621914
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters |
scientific article; zbMATH DE number 7621914 |
Statements
A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters (English)
0 references
22 November 2022
0 references
assortment optimization
0 references
incomplete information
0 references
multinomial logit model
0 references
regret lower bound
0 references
