BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T132844Z
UID:Seminar-EcCo-612@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20191030T130000
DTEND:20191030T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Nicos Protopapas: Truthful Aggregation of Budget Proposals\n\nThe authors consider a participatory budget problem, where each voter submits a proposal on how to divide a single divisible source among several alternatives (for example public projects) and this proposal should be aggregated into a single division. Voters have a single most preferred division and suffer a disutility equal to the ?1 distance of their most preferred division and the aggregated division. They provide a broad class of mechanisms that are incentive-compatible by generalizing the generalized median rules for single-peaked preferences. They introduce a mechanism from this class that is proportional, in the sense that when voters are single-minded (assign the whole budget to only one alternative) the fraction of the budget assigned to each alternative is equal to the proportion of voters who favor that alternative. They also show that there is a unique  Pareto-optimal mechanism in this class, suggesting an inherent tradeoff between Pareto optimality and proportionality.\n\nAuthors: Rupert Freeman, David Pennock, Dominik Peters, Jennifer Wortman Vaughan\nAppeared at EC '19.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=612
LOCATION:
END:VEVENT
END:VCALENDAR