{'fraction_non_alphanumeric': 0.016417910447761194, 'fraction_numerical': 0.0, 'mean_word_length': 5.390476190476191, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Distributed Meeting Scheduling

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.