Robust Optimization of Recommendation Sets with the Maximin Utility Criterion
نویسندگان
چکیده
We investigate robust decision-making under utility uncertainty, using the maximin criterion, which optimizes utility for the worst case setting. We show how it is possible to efficiently compute the maximin optimal recommendation in face of utility uncertainty, even in large configuration spaces. We then introduce a new decision criterion, setwise maximin utility (SMMU), for constructing optimal recommendation sets: we develop algorithms for computing SMMU and present experimental results showing their performance. Finally, we discuss the problem of elicitation and prove (analogously to previous results related to regret-based and Bayesian elicitation) that SMMU leads to myopically optimal query sets.
منابع مشابه
Optimization and Elicitation with the Maximin Utility Criterion
We investigate robust decision-making under utility uncertainty, using the maximin criterion, which optimizes utility for the worst case setting. We show how it is possible to efficiently compute the maximin optimal recommendation in face of utility uncertainty, even in large configuration spaces. We then introduce a new decision criterion, setwise maximin utility (SMMU), for constructing optim...
متن کاملOptimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets
Bayesian approaches to utility elicitation typically adopt (myopic) expected value of information (EVOI) as a natural criterion for selecting queries. However, EVOI-optimization is usually computationally prohibitive. In this paper, we examine EVOI optimization using choice queries, queries in which a user is ask to select her most preferred product from a set. We show that, under very general ...
متن کاملRegret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty
Stackelberg security games (SSGs) have been deployed in a number of real-world domains. One key challenge in these applications is the assessment of attacker payoffs, which may not be perfectly known. Previous work has studied SSGs with uncertain payoffs modeled by interval uncertainty and provided maximin-based robust solutions. In contrast, in this work we propose the use of the less conserva...
متن کاملOptimal Portfolio Problem with Unknown Dependency Structure
This research studies a single-period expected utility-based optimal portfolio problem. Assets are divided into different groups. It is assumed that the actual dependency structure of the asset returns within each group is unknown, but assets belonging to different groups have independent returns. Instead of assuming any particular dependency structure within each group, we propose the maximin ...
متن کاملOn Simulated Annealing Dedicated to Maximin Latin Hypercube Designs
The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the 1D-move perturbation to improve the space exploration performed by these algorithms. Second, we propose a new evaluation function ψp,σ specifically targeting the Maximin criterion. Exhaustive series of experiments with Simulated Annealing, which we used as a typical...
متن کامل