Computer Science Colloquium
Time+Place : Thursday 23/12/2010 14:30 room 337-8 Taub  Bld.
Speaker    : Ariel Procaccia
Affiliation: CRCS, Harvard University
Host       : Johann Makowsky
Title      : May the optimal candidate win! Optimization under social choice
Abstract   :
Social choice theory usually takes a normative approach to preference
aggregation, and hence may seem at odds with the concept of optimization.
I will demonstrate though that a computational approach gives rise to
interesting discrete optimization problems in social choice settings, and
will further argue that the solutions, which can be interpreted as voting
rules, should satisfy social choice constraints. I will give two examples:
(i) approximating the distance from consensus, as first proposed by Charles
Dodgson (a.k.a. Lewis Carroll) in 1876, and (ii) seeking optimal solutions
to special Markov decision processes that model collective decision making
under dynamic preferences.
Ariel Procaccia is a fellow of the Center for Research on Computation and
Society (CRCS) at Harvard University. His research interests include the
(pairwise) intersections of AI, social choice, and game theory. He received
his Ph.D. from the Hebrew University of Jerusalem. His dissertation,
entitled "Computational Voting Theory: Of the Agents, By the Agents, For the
Agents", has won the 2008 IFAAMAS Victor Lesser Distinguished Dissertation
Award. He is also a recipient of a Rothschild postdoctoral fellowship, and a
member of the editorial boards of the Journal of AI Research and Autonomous
Agents and Multi-Agent Systems.
Visit our home page-   <>
Thu Dec  2 13:28:10 IST 2010
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <> 
Announcement from: Hadas Heier   <>