Computational Decision Support: Regret-based Models for Optimization and Preference Elicitation

Decision making is a fundamental human, organizational, and societal activity, involving several key (and sometimes implicit) steps: the formulation of a set of options or decisions; information gathering to help assess the outcomes of these decisions and their likelihood; some assessment of the relative utility or desirability of the possible outcomes; and an assessment of the tradeoffs involved to determine an appropriate course of action. Advances in information and communication technology have changed the nature of the decisions that face individuals, professionals, and organizations. Sophisticated devices, ubiquitous sensors, and the increasing use of online mechanisms to mediate personal, professional, and business communications and transactions has resulted in an explosion in the data available to support decision making. Apart from data proliferation, the range and complexity of the options facing decision makers has also increased: networked communication has drastically reduced search costs, and sophisticated computational models have greatly expanded the capacity for reasoning about complex decision structures (e.g., policies, configurations of decision variables, etc.). Computer-aided decision support is vital for several reasons. First, computational methods are critical in helping decision makers wade through of huge volumes of data to extract relevant information. Tremendous strides in information retrieval and machine learning have offered ever-more sophisticated algorithms for data mining and relevance detection. Second, while computers have long been used for decision support, the new richness of data sources and complexity of decision spaces bring with them demands for more sophisticated forms of algorithmic optimization to help decision makers determine suitable courses of action. However, even with sophisticated algorithms at their disposal, decision support tools require considerable information about the decision maker’s preferences to function effectively. This is especially true when we consider putting decision support in the hands of the “masses,” that is, people who make decisions without having (or needing) a rich understanding of the underlying domain or its dynamics. Many ingredients of a decision scenario can be fixed—options, likelihood of outcomes, relevance of information sources, etc., may be the same for each user of a decision support tool. What varies are the preferences of the users, each of whom has different goals or objectives in mind. Hence, this information cannot be coded into the system in advance. Unfortunately, no decision support system can recommend decisions without some idea of what these preferences are, giving rise to the preference bottleneck: how do we get the preferences of the user (or organization) “into” the decision support system? The preference bottleneck is one of the greatest impediments to the wide-scale deployment of

[1]  Murray Campbell,et al.  Evaluating multiple attribute items using queries , 2001, EC '01.

[2]  Craig Boutilier,et al.  Incremental utility elicitation with minimax regret decision criterion , 2003, IJCAI 2003.

[3]  Craig Boutilier,et al.  Eliciting Additive Reward Functions for Markov Decision Processes , 2011, IJCAI.

[4]  Craig Boutilier,et al.  Local Utility Elicitation in GAI Models , 2005, UAI.

[5]  Shie Mannor,et al.  Percentile optimization in uncertain Markov decision processes with application to efficient exploration , 2007, ICML '07.

[6]  Craig Boutilier,et al.  New Approaches to Optimization and Utility Elicitation in Autonomic Computing , 2005, AAAI.

[7]  Gordon Miller,et al.  Decision Making: Descriptive, Normative, and Prescriptive Interactions , 1990 .

[8]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[9]  Thomas Hofmann,et al.  Latent Class Models for Collaborative Filtering , 1999, IJCAI.

[10]  Sarit Kraus,et al.  Strategic Negotiation in Multiagent Environments , 2001, Intelligent robots and autonomous agents.

[11]  Craig Boutilier,et al.  Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies , 2010, AAAI.

[12]  E. H. Clarke Multipart pricing of public goods , 1971 .

[13]  Sylvia Encheva,et al.  Decision making with incomplete information , 2011 .

[14]  D. J. White,et al.  Decision Theory , 2018, Behavioral Finance for Private Banking.

[15]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[16]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[17]  Ariel D. Procaccia,et al.  Strategyproof Classification with Shared Inputs , 2009, IJCAI.

[18]  Peter C. Fishburn,et al.  INTERDEPENDENCE AND ADDITIVITY IN MULTIVARIATE, UNIDIMENSIONAL EXPECTED UTILITY TIHEORY* , 1967 .

[19]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[20]  Craig Boutilier,et al.  Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions , 2004, AAAI.

[21]  D. Hensher,et al.  Stated Choice Methods: Analysis and Applications , 2000 .

[22]  John R. Hauser,et al.  Polyhedral Methods for Adaptive Choice-Based Conjoint Analysis , 2004 .

[23]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[24]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[25]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[26]  M. Satterthwaite Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .

[27]  Shie Mannor,et al.  Parametric regret in uncertain Markov decision processes , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[28]  John R. Hauser,et al.  Fast Polyhedral Adaptive Conjoint Estimation , 2002 .

[29]  J. Marden Analyzing and Modeling Rank Data , 1996 .

[30]  Chelsea C. White,et al.  Multiobjective intelligent computer-aided design , 1991, IEEE Trans. Syst. Man Cybern..

[31]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[32]  Abraham Wald,et al.  Statistical Decision Functions , 1951 .

[33]  Craig Boutilier,et al.  Elicitation of Factored Utilities , 2008, AI Mag..

[34]  Meir Kalech,et al.  Practical voting rules with partial information , 2010, Autonomous Agents and Multi-Agent Systems.

[35]  Richard S. Zemel,et al.  Collaborative Filtering and the Missing at Random Assumption , 2007, UAI.

[36]  Hitoshi Matsushima,et al.  Handbook of Social Choice and Welfare, Volume 1 (Book) , 2004 .

[37]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[38]  Andrew P. Sage,et al.  A model of multiattribute decisionmaking and trade-off weight determination under uncertainty , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[39]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[40]  Craig Boutilier,et al.  Regret-based Incremental Partial Revelation Mechanisms , 2006, AAAI.

[41]  Craig Boutilier,et al.  Mechanism Design with Partial Revelation , 2007, IJCAI.

[42]  Jérôme Lang,et al.  Voting procedures with incomplete preferences , 2005 .

[43]  Vincent Conitzer,et al.  Vote elicitation: complexity and strategy-proofness , 2002, AAAI/IAAI.

[44]  Jesse Hoey,et al.  A planning system based on Markov decision processes to guide people with dementia through activities of daily living , 2006, IEEE Transactions on Information Technology in Biomedicine.

[45]  David E. Bell,et al.  Regret in Decision Making under Uncertainty , 1982, Oper. Res..

[46]  Craig Boutilier,et al.  Robust Online Optimization of Reward-Uncertain MDPs , 2011, IJCAI.

[47]  Eyke Hüllermeier,et al.  Label ranking by learning pairwise preferences , 2008, Artif. Intell..

[48]  Bradley N. Miller,et al.  GroupLens: applying collaborative filtering to Usenet news , 1997, CACM.

[49]  George Apostolakis,et al.  Decision theory , 1986 .

[50]  A. Tversky,et al.  Choices, Values, and Frames , 2000 .

[51]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[52]  A. Gibbard Manipulation of Voting Schemes: A General Result , 1973 .

[53]  Craig Boutilier,et al.  Constraint-based optimization and utility elicitation using the minimax decision criterion , 2006, Artif. Intell..

[54]  J. Barbenel,et al.  The Use of Artificial Intelligence in the Design of an Intelligent Cognitive Orthosis for People with Dementia , 2001, Assistive technology : the official journal of RESNA.

[55]  Craig Boutilier,et al.  Robust Approximation and Incremental Elicitation in Voting Protocols , 2011, IJCAI.

[56]  Patrice Perny,et al.  GAI Networks for Utility Elicitation , 2004, KR.

[57]  Igor Averbakh Minmax regret solutions for minimax optimization problems with uncertainty , 2000, Oper. Res. Lett..

[58]  Craig Boutilier,et al.  Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation , 2002, UAI.

[59]  John Ferejohn,et al.  The Paradox of Not Voting: A Decision Theoretic Analysis , 1974, American Political Science Review.

[60]  Jesse Hoey,et al.  A Decision-Theoretic Approach to Task Assistance for Persons with Dementia , 2005, IJCAI.

[61]  Craig Boutilier,et al.  Minimax regret based elicitation of generalized additive utilities , 2007, UAI.

[62]  Craig Boutilier,et al.  Regret-based optimal recommendation sets in conversational recommender systems , 2009, RecSys '09.

[63]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[64]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[65]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[66]  Ali E. Abbas,et al.  Entropy methods for adaptive utility elicitation , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[67]  Daphne Koller,et al.  Making Rational Decisions Using Adaptive Utility Elicitation , 2000, AAAI/IAAI.

[68]  A. A. J. Marley,et al.  Behavioral Social Choice - Probabilistic Models, Statistical Inference, and Applications , 2006 .

[69]  Craig Boutilier,et al.  Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets , 2010, NIPS.

[70]  Leonard J. Savage,et al.  The Theory of Statistical Decision , 1951 .

[71]  Vincent Conitzer,et al.  Communication complexity of common voting rules , 2005, EC '05.

[72]  Raimo P. Hämäläinen,et al.  Preference ratios in multiattribute evaluation (PRIME)-elicitation and decision procedures under incomplete information , 2001, IEEE Trans. Syst. Man Cybern. Part A.

[73]  Tuomas Sandholm,et al.  Expressive commerce and its application to sourcing: how we conducted $35 billion of generalized combinatorial auctions , 2007, AI Mag..

[74]  H. Raiffa,et al.  Negotiation Analysis: The Science and Art of Collaborative Decision Making , 2003 .

[75]  R. Sugden,et al.  Regret Theory: An alternative theory of rational choice under uncertainty Review of Economic Studies , 1982 .

[76]  Craig Boutilier,et al.  Regret-based Reward Elicitation for Markov Decision Processes , 2009, UAI.

[77]  Craig Boutilier,et al.  A POMDP formulation of preference elicitation problems , 2002, AAAI/IAAI.

[78]  Craig Boutilier,et al.  Assessing regret-based preference elicitation with the UTPREF recommendation system , 2010, EC '10.

[79]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[80]  Ronen I. Brafman,et al.  UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.