A Preference Model for Over-Constrained Meeting Requests

Pauline M. Berry, Melinda Gervasio, Bart Peintner, Neil Yorke-Smith

To have value for an individual tasked with arranging a meeting, a scheduling tool must actively account for the individual’s scheduling preferences, especially when the meeting request must be relaxed. We develop a preference model designed to capture user scheduling preferences for overconstrained meeting requests between multiple people, and a methodology for preference elicitation to initially populate this model. The model is built around a 2-order Choquet integral representation. We explain a natural-language-based elicitation of the meeting request details and constraints, and outline the solving of the resulting constrained scheduling problem (with preferences). We then describe the display of solutions to the scheduling problem to the user, as candidate scheduling options with explanations, and detail unobtrusive learning of revisions to the preference model from the user’s choices among the candidates. We report on initial assessment of the efficacy of such a preference model in terms of elicitation, learning, and reasoning.

Subjects: 1.12 Scheduling; 11. Knowledge Representation

Submitted: May 12, 2007


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.