BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:826@lincs.fr
DTSTART;TZID=Europe/Paris:20240327T103000
DTEND;TZID=Europe/Paris:20240327T113000
DTSTAMP:20240405T072633Z
URL:https://www.lincs.fr/events/tournament-solutions/
SUMMARY:Tournament Solutions
DESCRIPTION:A tournament is an oriented graph where there is exactly one
 edge between each pair of nodes\, in one direction or the other\, with the
 implicit interpretation that one node "beats" the other. If the binary
 relation induced by the tournament is transitive\, then there is a natural
 notion of winner\, which is the maximal element. But in the general case\,
 it would be interesting to have a function that\, to each tournament\,
 associates a set of cowinners\, and that has intuitively appealing
 properties. We will investigate such functions\, called "tournament
 solutions".\n\nReferences:\nLaslier\, Jean-François. Tournament solutions
 and majority voting. Springer\, 1997.\nBrandt\, Felix\, Markus Brill and
 Paul Harrenstein. Tournament Solution. In: Brandt\, Felix\, Vincent
 Conitzer\, Ulle Endriss\, et al (ed.). Handbook of computational social
 choice. Cambridge University Press\, 2016.\n\nSlides
CATEGORIES:Network Theory,Working Group,Youtube
LOCATION:Room 4B01\, 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=Room 4B01:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR