Constraint-based optimization and utility elicitation using the minimax decision criterion

DOI10.1016/j.artint.2006.02.003zbMath1131.91317OpenAlexW2145996207MaRDI QIDQ2457617

Relu Patrascu, Pascal Poupart, Craig Boutilier, Dale Schuurmans

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.02.003

zbMATH Keywords

optimizationdecision theoryminimax regretconstraint satisfactionpreference elicitationimprecise utility

Mathematics Subject Classification ID

Decision theory (91B06) Utility theory (91B16) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Invariants for time-series constraints ⋮ Preferences in artificial intelligence ⋮ Efficient pairwise preference elicitation allowing for indifference ⋮ Simple ranking method using reference profiles: incremental elicitation of the preference parameters ⋮ Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems ⋮ A multi-objective supplier selection framework based on user-preferences ⋮ Heuristics for selecting pair-wise elicitation questions in multiple criteria choice problems ⋮ A decomposition based minimax regret approach for inverse multiple criteria sorting problem ⋮ Relational networks of conditional preferences ⋮ Simultaneous elicitation of scoring rule and agent preferences for robust winner determination ⋮ Incremental elicitation of preferences: optimist or pessimist? ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ On the equivalence of optimal recommendation sets and myopically optimal query sets ⋮ On the value of using group discounts under price competition ⋮ Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra ⋮ An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information ⋮ Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions ⋮ Learning modulo theories for constructive preference elicitation ⋮ Robust winner determination in positional scoring rules with uncertain weights ⋮ Monotone decomposition of 2-additive generalized additive independence models ⋮ Easy and optimal queries to reduce set uncertainty ⋮ Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Combining local search and elicitation for multi-objective combinatorial optimization ⋮ Exploiting bounded rationality in risk-based cyber camouflage games

Uses Software

• PRIME Decisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision making with incomplete information
• Partitioning procedures for solving mixed-variables programming problems
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Minmax regret solutions for minimax optimization problems with uncertainty
• Question selection for multi-attribute decision-aiding.
• On the complexity of minmax regret linear programming
• Contribution to nonserial dynamic programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Regret in Decision Making under Uncertainty
• Semiring-based constraint satisfaction and optimization
• Stochastic Dominance in Regret Theory
• Interdependence and Additivity in Multivariate, Unidimensional Expected Utility Theory
• Interactive Goal Programming
• The Theory of Statistical Decision