"A Mildly Personal Summary of COMSOC 2010 --- Dusseldorf, September 2010"

Speaker: Omer Lev, The Hebrew University
Date: Wednesday, 27 October 2010
Time: 12noon
Place: Ross 201

Abstract:

I'll be speaking about a few interesting papers that were presented at
COMSOC 2010 (DC<sseldorf, 13-16 September). Among them are Toby
Walsh's presentation regarding results that empirical work can give in
the field of computational social choice (focusing on manipulation of
the Veto rule), a paper by Elkind, Faliszewski and Slinko attempting
to define a useful framework for metrics over elections (and not
voters!), and a paper by Alon, Fischer, Procaccia and Tennenholtz
dealing with a specific type of election (that can be modeled by a
directed, unweighted graph), and trying to find deterministic and
randomized strategyproof algorithms for that type of election. Also,
following a short explanation on cake cutting in general, I will
present Chen, Lai, Parkes and Proccacia's paper attempting to find
algorithms which fulfill several requirements, ultimately achieving
the goal by focusing on specific families of cake-cutting problems.