{"total":47,"rows":[{"id":"2102.11050","title":"Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization","created":"2021-02-18","cited_by_count":40,"area":null},{"id":"2306.03928","title":"Designing Decision Support Systems Using Counterfactual Prediction Sets","created":"2023-06-06","cited_by_count":26,"area":null},{"id":"2211.12612","title":"Transfer Learning for Contextual Multi-armed Bandits","created":"2022-11-22","cited_by_count":24,"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":"2105.10721","title":"From Finite to Countable-Armed Bandits","created":"2021-05-22","cited_by_count":8,"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":"2102.07030","title":"Diffusion Approximations for a Class of Sequential Testing Problems","created":"2021-02-13","cited_by_count":7,"area":null},{"id":"2508.13285","title":"Towards Human-AI Complementarity in Matching Tasks","created":"2025-08-18","cited_by_count":7,"area":null},{"id":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"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":"2402.18917","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","created":"2024-02-29","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":"2306.10050","title":"Interpolating Item and User Fairness in Multi-Sided Recommendations","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2312.17229","title":"Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources","created":"2023-12-28","cited_by_count":3,"area":null},{"id":"2409.05798","title":"Enhancing Preference-based Linear Bandits via Human Response Time","created":"2024-09-09","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":"2208.03346","title":"Active Learning for Non-Parametric Choice Models","created":"2022-08-05","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":"2504.02324","title":"Dynamic Assortment Selection and Pricing with Censored Preference Feedback","created":"2025-04-03","cited_by_count":2,"area":null},{"id":"2606.09668","title":"Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret","created":"2026-06-08","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":"2208.02389","title":"Risk-Aware Linear Bandits: Theory and Applications in Smart Order Routing","created":"2022-08-04","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":"2304.02022","title":"Online Joint Assortment-Inventory Optimization under MNL Choices","created":"2023-04-04","cited_by_count":1,"area":null},{"id":"2311.07426","title":"Optimising Human-AI Collaboration by Learning Convincing Explanations","created":"2023-11-13","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":"2301.07243","title":"Complexity Analysis of a Countable-armed Bandit Problem","created":"2023-01-18","cited_by_count":0,"area":null},{"id":"2406.05017","title":"Adaptively Learning to Select-Rank in Online Platforms","created":"2024-06-07","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":"2505.00526","title":"Pre-Training Estimators for Structural Models: Application to Consumer Search","created":"2025-05-01","cited_by_count":0,"area":null},{"id":"2507.00851","title":"Aligning Learning and Endogenous Decision-Making","created":"2025-07-01","cited_by_count":0,"area":null},{"id":"2507.10834","title":"From Small to Large: A Graph Convolutional Network Approach for Solving Assortment Optimization Problems","created":"2025-07-14","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":"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},{"id":"2609.16952","title":"Learning Choice Model Trees for Feature-Based Multi-Product Pricing: Exact Optimization and Field Evidence","created":"2026-09-15","cited_by_count":0,"area":null}],"next_cursor":null}