Distributed Meeting Scheduling

Authors:
Ismel Brito;Pedro Meseguer
Affiliations:
IIIA, Institut d'Investigació en Intel.ligència Artificial, CSIC, Consejo Superior de Investigaciones Científicas, Campus UAB, 08193 Bellaterra, Spain;IIIA, Institut d'Investigació en Intel.ligència Artificial, CSIC, Consejo Superior de Investigaciones Científicas, Campus UAB, 08193 Bellaterra, Spain
Venue:
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Year:
2007

Citing 3
Cited 4

The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Asynchronous backtracking without adding links: a new member in the ABT family

Artificial Intelligence - Special issue: Distributed constraint satisfaction

A Cryptographic Solution for Private Distributed Simple Meeting Scheduling

Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling

Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Effect of DisCSP variable-ordering heuristics in scale-free networks

PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Effect of DisCSP variable-ordering heuristics in scale-free networks

Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.