Robust Learning of Consumer Preferences
From MaRDI portal
Publication:5080653
DOI10.1287/opre.2021.2157zbMath1493.91073OpenAlexW4206267728MaRDI QIDQ5080653
Yifan Feng, Christopher Thomas Ryan, René Caldentey
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2157
preference learningsequential learningbest arm identificationmaximum selectionrevenue management and market analyticsdynamic assortments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experiments with Kemeny ranking: What works when?
- Statistical ranking and combinatorial Hodge theory
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models
- Pure exploration in finitely-armed and continuous-armed bandits
- Active sequential hypothesis testing
- Generalized Sequential Probability Ratio Test for Separate Families of Hypotheses
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Learning Consumer Tastes Through Dynamic Assortments
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Sequential Design of Experiments
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Concentration Inequalities and Martingale Inequalities: A Survey
- Multihypothesis sequential probability ratio tests .I. Asymptotic optimality
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
- Simple Bayesian Algorithms for Best-Arm Identification
- Rank Aggregation: Together We're Strong
- Ranking Tournaments
- Aggregating inconsistent information
