BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:880@lincs.fr
DTSTART;TZID=Europe/Paris:20250228T110000
DTEND;TZID=Europe/Paris:20250228T120000
DTSTAMP:20250324T151404Z
URL:https://www.lincs.fr/events/communication-complexity-of-common-voting-
 rules/
SUMMARY:Communication Complexity of Common Voting Rules
DESCRIPTION:In this presentation\, I will discuss the paper Communication
 Complexity of Common Voting Rules [1]\, which examines how many bits must
 be exchanged to elicit voters’ preferences and determine the outcome of
 an election\, depending on the voting rule used. I begin by presenting the
 concept of deterministic and non-deterministic communication complexity\,
 followed by an introduction of the main voting rules analyzed in the paper.
 I then explain the paper’s main results\, which primarily establish lower
 and upper bounds on the communication complexity of several well-known
 voting rules\, such as plurality\, Borda count\, and the Condorcet rule.
 This talk aims to provide a deeper understanding of the communication
 requirements of different voting systems.\n\n\n\nReferences\n[1] Vincent
 Conitzer and Tuomas Sandholm. Communication complexity of common voting
 rules. In Proceedings of the 6th ACM conference on Electronic commerce\,
 pages 78–87\,
 2005.\n\n&nbsp\;\n\nhttps://www.irif.fr/~mdr/cours2-2019.pdf
CATEGORIES:Network Theory,Working Group
LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\,
 Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20241027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR