Meet your destiny: A non-manipulable meeting scheduler

Eithan Ephrati, Gilad Zlotkin, Jeffrey S. Rosenschein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

In this paper we present three scheduling mechanisms that are manipulation-proof for closed systems, The amount of information that each user must encode in the mechanism increases with the complexity of the mechanism. On the other hand, the more complex the mechanism is, the more it maintains the privacy of the users. The first mechanism is a centralized, calendar-oriented one. It is the least computationally complex of the three, but does not maintain user privacy. The second is a distributed meeting-oriented mechanism that maintains user privacy, but at the cost of greater computational complexity, The third mechanism, while being the most complex, maintains user privacy (for the most part) and allows users to have the greatest influence on the resulting schedule.

Original languageAmerican English
Title of host publicationProceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994
PublisherAssociation for Computing Machinery, Inc
Pages359-371
Number of pages13
ISBN (Electronic)0897916891, 9780897916899
DOIs
StatePublished - 22 Oct 1994
Event1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994 - Chapel Hill, United States
Duration: 22 Oct 199426 Oct 1994

Publication series

NameProceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994

Conference

Conference1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994
Country/TerritoryUnited States
CityChapel Hill
Period22/10/9426/10/94

Bibliographical note

Publisher Copyright:
© 1994 ACM.

Keywords

  • Game theory
  • Meetings scheduling

Fingerprint

Dive into the research topics of 'Meet your destiny: A non-manipulable meeting scheduler'. Together they form a unique fingerprint.

Cite this