Regret-based Utility Elicitation in Constraint-based Decision Problems
نویسندگان
چکیده
Constraint-based optimization requires the formulation of a precise objective function. However, in many circumstances, the objective is to maximize the utility of a specific user among the space of feasible configurations (e.g., of some system or product). Since elicitation of utility functions is known to be difficult, we consider the problem of incremental utility elicitation in constraintbased settings. Assuming graphical utility models, and adopting the minimax regret decision criterion for optimization in the presence of imprecise utility, we describe several elicitation strategies that require the user to answer only binary (bound) queries on the utility model parameters. While a theoretically motivated algorithm can provably reduce regret quickly (in terms of number of queries), we demonstrate that, in practice, heuristic strategies perform much better, and are able to find optimal (or near-optimal) configurations with far fewer queries, while leaving much of the utility function unspecified.
منابع مشابه
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making suitable decisions requires that the preferences of a specific user for different configurations be articulated or elicited, something generally acknowledged to be onerous. We address two problems associated with prefere...
متن کاملNew Approaches to Optimization and Utility Elicitation in Autonomic Computing
Autonomic (self-managing) computing systems face the critical problem of resource allocation to different computing elements. Adopting a recent model, we view the problem of provisioning resources as involving utility elicitation and optimization to allocate resources given imprecise utility information. In this paper, we propose a new algorithm for regret-based optimization that performs signi...
متن کاملOptimal Set Recommendations Based on Regret
Current conversational recommender systems do not offer guarantees on the quality of their recommendations, either because they do not maintain a model of a user’s utility function, or do so in an ad hoc fashion. In this paper, we propose an approach to recommender systems that incorporates explicit utility models into the recommendation process in a decision-theoretically sound fashion. The sy...
متن کاملRegret-based Incremental Partial Revelation Mechanisms
Classic direct mechanisms suffer from the drawback of requiring full type (or utility function) revelation from participating agents. In complex settings with multi-attribute utility, assessing utility functions can be very difficult, a problem addressed by recent work on preference elicitation. In this work we propose a framework for incremental, partial revelation mechanisms and study the use...
متن کامل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...
متن کامل