Preference-based group scheduling

被引:0
作者
Hu, J [1 ]
Brzozowski, M [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
来源
HUMAN-COMPUTER INTERACTION - INTERACT 2005, PROCEEDINGS | 2005年 / 3585卷
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:990 / 993
页数:4
相关论文
共 6 条
[1]  
[Anonymous], COMMUN ACM
[2]  
Beard D., 1990, P 1990 ACM C COMP SU, P279
[3]  
Horvitz E., 2002, P 18 C UNC ART INT U, P224
[4]  
PALEN L, 2003, DISCRETIONARY ADOPTI, P159
[5]  
Tullio J., 2002, P 15 ANN S US INT SO, P11
[6]  
EVITE