Meetings are an important vehicle for human communication. The Meeting Scheduling problem (MS) is a decision-making process affecting several people, in which it is necessary to decide when and where several meetings could be scheduled. MS is a naturally distributed problem which has a clear motivation to be tried using distributed techniques: people may desire to preserve the already planned meetings in their personal calendars during resolution. In this paper, we evaluate three distributed algorithms for MS according to efficiency and privacy loss. Two of these algorithms view MS as a Distributed Constraint Satisfaction problem.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com