Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings which have to be scheduled among subsets of agents. MS is a naturally distributed problem with a clear motivation to avoid centralization: agents desire to keep their personal calendars as private as possible during resolution. MS can be formulated as Distributed CSP, but due to the form of its constraints the PKC model does not bring any benefit here. We take entropy as a measure for privacy, and evaluate several distributed algorithms for MS according to efficiency and privacy loss. Experiments show interesting results with respect to the kind of tested algorithms.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(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 firstname.lastname@example.org