Robust Learning of Consumer Preferences
From MaRDI portal
Publication:5080653
DOI10.1287/OPRE.2021.2157zbMATH Open1493.91073OpenAlexW4206267728MaRDI QIDQ5080653FDOQ5080653
Authors: Yifan Feng, René Caldentey, Christopher Thomas Ryan 
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
Recommendations
- scientific article; zbMATH DE number 2159448
- Efficiently learning the preferences of people
- Learning consumer tastes through dynamic assortments
- Learning Preference Models in Recommender Systems
- Learning and Optimizing with Preferences
- Robust consumer preference analysis with a social network
- scientific article; zbMATH DE number 2018601
- Modelling Human Decision Behaviour with Preference Learning
preference learningsequential learningbest arm identificationmaximum selectionrevenue management and market analyticsdynamic assortments
Cites Work
- Title not available (Why is that?)
- On the complexity of best-arm identification in multi-armed bandit models
- Experiments with Kemeny ranking: What works when?
- Statistical ranking and combinatorial Hodge theory
- Aggregating inconsistent information: ranking and clustering
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Title not available (Why is that?)
- Ranking Tournaments
- Concentration Inequalities and Martingale Inequalities: A Survey
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Title not available (Why is that?)
- Dynamic assortment with demand learning for seasonal consumer goods
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Multihypothesis sequential probability ratio tests .I. Asymptotic optimality
- Rank aggregation: together we're strong
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Sequential Design of Experiments
- Noisy sorting without resampling
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
- Pure exploration in finitely-armed and continuous-armed bandits
- Generalized Sequential Probability Ratio Test for Separate Families of Hypotheses
- Learning consumer tastes through dynamic assortments
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Simple Bayesian algorithms for best-arm identification
- MNL-bandit: a dynamic learning approach to assortment selection
- Active sequential hypothesis testing
- A nearly instance optimal algorithm for top-\(k\) ranking under the multinomial logit model
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models
- Mallows-smoothed distribution over rankings approach for modeling choice
Cited In (1)
This page was built for publication: Robust Learning of Consumer Preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080653)
