Preference Elicitation with Interdependency and User Bother Cost

Agent-based scheduling systems, such as automated systems that schedule meetings for users and systems that schedule smart devices in smart homes, require the elicitation of user preferences in oder to operate in a manner that is consistent with user expectations. Unfortunately, interactions between such systems and users can be limited as human users prefer to not be overly bothered by such systems. As such, a key challenge is for the system to efficiently elicit key preferences without bothering the users too much. To tackle this problem, we propose a cost model that captures the cognitive or bother cost associated with asking a question. We incorporate this model into our iPLEASE system, an interactive preference elicitation approach. iPLEASE represents a user's preferences as a matrix, called preference matrix, and uses heuristics to select, from a given set of questions, an efficient sequence of questions to ask the user such that the total bother cost incurred to the user does not exceed a given bother cost budget. The user's response to those questions will partially populate the preference matrix. It then performs an exact matrix completion via convex optimization to approximate the remaining preferences that are not directly elicited. We empirically apply iPLEASE on randomly-generated problems as well as on a real-world dataset for the smart device scheduling problem to demonstrate that our approach outperforms other non-trivial benchmarks in eliciting user preferences.

[1]  Robin Cohen,et al.  Why bother about bother : Is it worth it to ask the user ? , 2005 .

[2]  Judy Goldsmith,et al.  Preference Handling for Artificial Intelligence , 2008, AI Mag..

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

[4]  Rahul Singh RCal: An Autonomous Agent for Intelligent Distributed Meeting Scheduling , 2003 .

[5]  Enrico Pontelli,et al.  A Multiagent System Approach to Scheduling Devices in Smart Homes , 2017, AAMAS.

[6]  Luo Si,et al.  A Bayesian Approach toward Active Learning for Collaborative Filtering , 2004, UAI.

[7]  Robin Cohen,et al.  Reasoning about interaction in mixed-initiative artificial intelligence systems , 2004 .

[8]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[9]  Gauthier Picard,et al.  Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems , 2016, IJCAI.

[10]  Kenneth N. Brown,et al.  Preference Elicitation and Reasoning While Smart Shifting of Home Appliances , 2015 .

[11]  Sarvapali D. Ramchurn,et al.  Agent-based homeostatic control for green energy in the smart grid , 2011, TIST.

[12]  Ilaria Liccardi,et al.  Negotiation as an Interaction Mechanism for Deciding App Permissions , 2016, CHI Extended Abstracts.

[13]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[14]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[15]  Sarvapali D. Ramchurn,et al.  Doing the laundry with agents: a field trial of a future smart energy system in the home , 2014, CHI.

[16]  Sarvapali D. Ramchurn,et al.  Forecasting Multi-Appliance Usage for Smart Home Energy Management , 2013, IJCAI.

[17]  Sami Tabbane,et al.  Sigmoid utility function formulation for handoff reducing Access model in cognitive radio , 2013, 2013 13th International Symposium on Communications and Information Technologies (ISCIT).

[18]  William D. Penny,et al.  Behavioral Modeling of Human Choices Reveals Dissociable Effects of Physical Effort and Temporal Delay on Reward Devaluation , 2015, PLoS Comput. Biol..

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

[20]  Chao Lan,et al.  A disagreement-based active matrix completion approach with provable guarantee , 2016, 2016 International Joint Conference on Neural Networks (IJCNN).

[21]  Andrea Passerini,et al.  Coactive Critiquing: Elicitation of Preferences and Features , 2016, AAAI.

[22]  Craig Boutilier,et al.  Active Collaborative Filtering , 2002, UAI.

[23]  Michael Kaisers,et al.  The Value of Information in Automated Negotiation: A Decision Model for Eliciting User Preferences , 2017, AAMAS.

[24]  Boi Faltings,et al.  Open constraint programming , 2005, Artif. Intell..

[25]  Gerald Tesauro,et al.  Active Collaborative Prediction with Maximum Margin Matrix Factorization , 2008, ISAIM.

[26]  Barnabás Póczos,et al.  Active learning and search on low-rank matrices , 2013, KDD.

[27]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[28]  Sarvapali D. Ramchurn,et al.  Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid , 2011, J. Artif. Intell. Res..

[29]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, ISIT.

[30]  Jeffrey S. Rosenschein,et al.  Knowing What to Ask: A Bayesian Active Learning Approach to the Surveying Problem , 2017, AAAI.

[31]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[32]  Alex Rogers,et al.  Non-Intrusive Load Monitoring Using Prior Models of General Appliance Types , 2012, AAAI.

[33]  J. Zico Kolter,et al.  REDD : A Public Data Set for Energy Disaggregation Research , 2011 .

[34]  Evelina Lamma,et al.  Constraint Propagation and Value Acquisition: Why we should do it Interactively , 1999, IJCAI.

[35]  Toby Walsh,et al.  Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies , 2010, Artif. Intell..

[36]  Sarvapali D. Ramchurn,et al.  Interactive Scheduling of Appliance Usage in the Home , 2016, IJCAI.

[37]  Jiayu Zhou,et al.  Active Matrix Completion , 2013, 2013 IEEE 13th International Conference on Data Mining.

[38]  Ferdinando Fioretto,et al.  Preference Elicitation for DCOPs , 2017, CP.

[39]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

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

[41]  Milind Tambe,et al.  Electric Elves: What Went Wrong and Why , 2006, AAAI Spring Symposium: What Went Wrong and Why: Lessons from AI Research and Applications.