{"total":32,"rows":[{"id":"2102.13202","title":"Online Multi-Armed Bandits with Adaptive Inference","created":"2021-02-25","cited_by_count":22,"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":"2101.01301","title":"Adversarial Combinatorial Bandits with General Non-linear Reward Functions","created":"2021-01-05","cited_by_count":14,"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":"2202.13227","title":"Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework","created":"2022-02-26","cited_by_count":11,"area":null},{"id":"2402.01845","title":"Multi-Armed Bandits with Interference","created":"2024-02-02","cited_by_count":10,"area":null},{"id":"2406.09882","title":"Harm Mitigation in Recommender Systems under User Preference Dynamics","created":"2024-06-14","cited_by_count":5,"area":null},{"id":"2503.07555","title":"Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2102.05502","title":"On the Suboptimality of Thompson Sampling in High Dimensions","created":"2021-02-10","cited_by_count":4,"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":"2502.06777","title":"Learning an Optimal Assortment Policy under Observational Data","created":"2025-02-10","cited_by_count":4,"area":null},{"id":"2302.01543","title":"Multiplier Bootstrap-based Exploration","created":"2023-02-03","cited_by_count":3,"area":null},{"id":"2507.05306","title":"Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm","created":"2025-07-07","cited_by_count":3,"area":null},{"id":"2106.01135","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","created":"2021-06-02","cited_by_count":2,"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":"2410.19705","title":"Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks","created":"2024-10-25","cited_by_count":2,"area":null},{"id":"2504.02324","title":"Dynamic Assortment Selection and Pricing with Censored Preference Feedback","created":"2025-04-03","cited_by_count":2,"area":null},{"id":"2103.02741","title":"Combinatorial Bandits without Total Order for Arms","created":"2021-03-03","cited_by_count":1,"area":null},{"id":"2109.02519","title":"Online Learning of Independent Cascade Models with Node-level Feedback","created":"2021-09-06","cited_by_count":1,"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":"2303.02504","title":"MNL-Bandit in non-stationary environments","created":"2023-03-04","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":"2204.10787","title":"MNL-Bandits under Inventory and Limited Switches Constraints","created":"2022-04-22","cited_by_count":0,"area":null},{"id":"2410.22488","title":"Privacy-Preserving Dynamic Assortment Selection","created":"2024-10-29","cited_by_count":0,"area":null},{"id":"2501.19277","title":"On Pareto Optimality for Parametric Choice Bandits","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2509.04194","title":"Stochastic Matching Bandits with Rare Optimization Updates","created":"2025-09-04","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}