Interactive preference elicitation under noisy preference models: an efficient non-Bayesian approach
From MaRDI portal
Cites work
- A Survey of Preference-Based Online Learning with Bandit Algorithms
- An efficient non-Bayesian approach for interactive preference elicitation under noisy preference models
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Anytime algorithms for adaptive robust optimization with OWA and WOWA
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Ellipsoidal methods for adaptive choice-based conjoint analysis
- Information efficient learning of complexly structured preferences: elicitation procedures and their application to decision making under uncertainty
- Interactive Goal Programming
- On the equivalence of optimal recommendation sets and myopically optimal query sets
- Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory
- Probability Inequalities for Sums of Bounded Random Variables
- Quantifying degrees of E-admissibility in decision making with imprecise probabilities
- Using Choquet integral as preference model in interactive evolutionary multiobjective optimization
This page was built for publication: Interactive preference elicitation under noisy preference models: an efficient non-Bayesian approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016609)
