Robust Learning of Consumer Preferences
From MaRDI portal
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
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- 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
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Active sequential hypothesis testing
- Aggregating inconsistent information: ranking and clustering
- An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Concentration Inequalities and Martingale Inequalities: A Survey
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Dynamic assortment with demand learning for seasonal consumer goods
- Experiments with Kemeny ranking: What works when?
- Generalized Sequential Probability Ratio Test for Separate Families of Hypotheses
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3418509 (Why is no real title available?)
- Learning consumer tastes through dynamic assortments
- Mallows-smoothed distribution over rankings approach for modeling choice
- MNL-bandit: a dynamic learning approach to assortment selection
- Multihypothesis sequential probability ratio tests .I. Asymptotic optimality
- Noisy sorting without resampling
- On the complexity of best-arm identification in multi-armed bandit models
- Pure exploration in finitely-armed and continuous-armed bandits
- Rank aggregation: together we're strong
- Ranking Tournaments
- Sequential Design of Experiments
- Simple Bayesian algorithms for best-arm identification
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Statistical ranking and combinatorial Hodge theory
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
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)
