BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T205326Z
UID:Seminar-dept-442@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20170606T130000
DTEND:20170606T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Martin Lackner: The varied landscape of consistent approval-based multi-winner rules\n\nThe goal of this talk is to provide an overview of recent work on approval-based multi-winner rules. Approval-based multi-winner rules are voting rules that select a fixed-size group of candidates based on approval ballots. Such rules are applicable to a wide range of scenarios concerning group decision making and consequently may aim for widely diverging objectives.\n\n\n\nIn this talk, I introduce the class of counting rules and discuss axiomatic characterizations of rules in this class. In particular, I present axiomatic characterizations of three import consistent multi-winner rules: Proportional Approval Voting, Multi-Winner Approval Voting and Approval Chamberlin--Courant.\n\nThese results demonstrate the variety of multi-winner rules and the different, orthogonal goals that multi-winner voting rules may pursue.\n\n\n\nThis talk is based on joint work with Piotr Skowron.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=442
LOCATION:George Holt H223
END:VEVENT
END:VCALENDAR