Regret-based Utility Elicitation in Constraint-based Decision Problems
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 929-933.
Abstract
We propose new methods of preference elicitation for constraint-based optimization problems based on the use of minimax regret. Specifically, we assume a constraintbased optimization problem (e.g., product configuration) in which the objective function (e.g., consumer preferences) are unknown or imprecisely specified. Assuming a graphical utility model, 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.
@inproceedings{ijcai2005p19,
title = {Regret-based Utility Elicitation in Constraint-based Decision Problems},
author = {Boutilier, Craig and Patrascu, Relu and Poupart, Pascal and Schuurmans, Dale},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {929--933},
year = {2005},
url = {https://ijcai.org/proceedings/2005/19},
}
TY - CPAPER TI - Regret-based Utility Elicitation in Constraint-based Decision Problems AU - Boutilier, Craig AU - Patrascu, Relu AU - Poupart, Pascal AU - Schuurmans, Dale T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 929 EP - 933 UR - https://ijcai.org/proceedings/2005/19 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
