{"total":21,"rows":[{"id":"2110.02121","title":"Optimization with Constraint Learning: A Framework and Survey","created":"2021-10-05","cited_by_count":28,"area":null},{"id":"2103.13929","title":"Multinomial Logit Contextual Bandits: Provable Optimality and Practicality","created":"2021-03-25","cited_by_count":21,"area":null},{"id":"2110.10018","title":"Dynamic pricing and assortment under a contextual MNL demand","created":"2021-10-19","cited_by_count":20,"area":null},{"id":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2502.10020","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","created":"2025-02-14","cited_by_count":15,"area":null},{"id":"2103.11489","title":"UCB-based Algorithms for Multinomial Logistic Regression Bandits","created":"2021-03-21","cited_by_count":12,"area":null},{"id":"2308.02918","title":"Spectral Ranking Inferences based on General Multiway Comparisons","created":"2023-08-05","cited_by_count":11,"area":null},{"id":"2309.08634","title":"Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing","created":"2023-09-14","cited_by_count":8,"area":null},{"id":"2402.08126","title":"Contextual Multinomial Logit Bandits with General Value Functions","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2507.17528","title":"Generalized Low-Rank Matrix Contextual Bandits with Graph Information","created":"2025-07-23","cited_by_count":4,"area":null},{"id":"2211.03983","title":"Doubly Inhomogeneous Reinforcement Learning","created":"2022-11-08","cited_by_count":3,"area":null},{"id":"2302.03821","title":"PASTA: Pessimistic Assortment Optimization","created":"2023-02-08","cited_by_count":3,"area":null},{"id":"2404.17592","title":"Low-Rank Online Dynamic Assortment with Dual Contextual Information","created":"2024-04-19","cited_by_count":2,"area":null},{"id":"2510.01693","title":"PASTA: A Unified Framework for Offline Assortment Learning","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2301.12254","title":"Combinatorial Inference on the Optimal Assortment in Multinomial Logit Models","created":"2023-01-28","cited_by_count":1,"area":null},{"id":"2304.02022","title":"Online Joint Assortment-Inventory Optimization under MNL Choices","created":"2023-04-04","cited_by_count":1,"area":null},{"id":"2407.05564","title":"A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints","created":"2024-07-08","cited_by_count":1,"area":null},{"id":"2601.21775","title":"Differentiable Knapsack and Top-k Operators via Dynamic Programming","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2601.06913","title":"Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities","created":"2026-01-11","cited_by_count":0,"area":null},{"id":"2605.25592","title":"Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2607.11684","title":"Diversified Multinomial Logit Contextual Bandits","created":"2026-07-13","cited_by_count":0,"area":null}],"next_cursor":null}