Preference-Based Group Scheduling
Traditional group scheduling applications often treat users’ availability as binary: free or busy. This is an unrealistic representation because not all times are equally free or busy. The inflexibility makes it difficult to find times with which everyone is truly satisfied. We present an online group scheduling approach by which users indicate four-tier preferences for meeting times on a calendar, which dynamically adjusts to provide instant feedback and suggests optimal meeting times for all participants. Our prototype is geared toward college students and the scheduling is done through a democratic and open negotiation process where everyone’s preference is heard. Students who evaluated the prototype thought that the scheduling process was more efficient than the widely-used e-mail scheduling among college students, which is largely based on binary availability.
- 2.Grudin, J.: Groupware and Social Dynamics: Eight Challenges for Developers. Comm. of the ACM, 93–105 (January 1994)Google Scholar
- 3.Horvitz, E., Koch, P., Kadi, C.M., Jacobs, A.: Coordinate: Probabilistic Forecasting of Presence and Availability. In: Proc. Of the 18th Conference on Uncertainty and Artificial Intelligence, pp. 224–233. Morgan Kaufmann, San Francisco (2002)Google Scholar
- 4.Beard, D., Palaniappan, M., Humm, A., Banks, D., Nair, A., Shan, Y.: A Visual Calendar for Scheduling Group Meetings. In: Proc. of the 1990 ACM Conference on CSCW, pp. 279–290. ACM Press, New York (1990)Google Scholar
- 5.Evite, http://www.evite.com
- 6.Tullio, J., Goecks, J., Mynatt, E.D., Nguyen, D.H.: Augmenting Shared Personal Calendars. In: Proc. of the 15th Annual ACM Symposium on UIST, pp. 11–20. ACM Press, New York (2002)Google Scholar