Meet your destiny: A non-manipulable meeting scheduler

Eithan Ephrati; Gilad Zlotkin; Jeffrey S. Rosenschein

doi:10.1145/192844.193049

Meet your destiny: A non-manipulable meeting scheduler

Eithan Ephrati, Gilad Zlotkin, Jeffrey S. Rosenschein

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994
Publisher	Association for Computing Machinery, Inc
Pages	359-371
Number of pages	13
ISBN (Electronic)	0897916891, 9780897916899
DOIs	https://doi.org/10.1145/192844.193049
State	Published - 22 Oct 1994
Event	1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994 - Chapel Hill, United States Duration: 22 Oct 1994 → 26 Oct 1994

Publication series

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

Conference

Conference	1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994
Country/Territory	United States
City	Chapel Hill
Period	22/10/94 → 26/10/94

Bibliographical note

Publisher Copyright:
© 1994 ACM.

Keywords

Game theory
Meetings scheduling

Access to Document

10.1145/192844.193049

Cite this

Ephrati, E., Zlotkin, G., & Rosenschein, J. S. (1994). Meet your destiny: A non-manipulable meeting scheduler. In Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994 (pp. 359-371). (Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994). Association for Computing Machinery, Inc. https://doi.org/10.1145/192844.193049

@inproceedings{09afb10450ac47dcb471d47efffa9ddd,

title = "Meet your destiny: A non-manipulable meeting scheduler",

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.",

keywords = "Game theory, Meetings scheduling",

author = "Eithan Ephrati and Gilad Zlotkin and Rosenschein, {Jeffrey S.}",

note = "Publisher Copyright: {\textcopyright} 1994 ACM.; 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994 ; Conference date: 22-10-1994 Through 26-10-1994",

year = "1994",

month = oct,

day = "22",

doi = "10.1145/192844.193049",

language = "אנגלית",

series = "Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994",

publisher = "Association for Computing Machinery, Inc",

pages = "359--371",

booktitle = "Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994",

}

Ephrati, E, Zlotkin, G & Rosenschein, JS 1994, Meet your destiny: A non-manipulable meeting scheduler. in Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994. Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994, Association for Computing Machinery, Inc, pp. 359-371, 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994, Chapel Hill, United States, 22/10/94. https://doi.org/10.1145/192844.193049

Meet your destiny: A non-manipulable meeting scheduler. / Ephrati, Eithan; Zlotkin, Gilad; Rosenschein, Jeffrey S.
Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994. Association for Computing Machinery, Inc, 1994. p. 359-371 (Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Meet your destiny

T2 - 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994

AU - Ephrati, Eithan

AU - Zlotkin, Gilad

AU - Rosenschein, Jeffrey S.

PY - 1994/10/22

Y1 - 1994/10/22

N2 - 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.

AB - 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.

KW - Game theory

KW - Meetings scheduling

UR - http://www.scopus.com/inward/record.url?scp=2442750748&partnerID=8YFLogxK

U2 - 10.1145/192844.193049

DO - 10.1145/192844.193049

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:2442750748

T3 - Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994

SP - 359

EP - 371

BT - Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994

PB - Association for Computing Machinery, Inc

Y2 - 22 October 1994 through 26 October 1994

ER -

Meet your destiny: A non-manipulable meeting scheduler

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this