Computer Studies Bldg. Room 209
Dr. Piotr Faliszewski
Throughout recent years voting theory has received
significant attention from computer scientists, especially those
interested in artificial intelligence and multiagent systems. This
increased interest comes from the fact that modern information systems
typically involve multiple agents (human or software) that often need
to come at a joint decision. Voting is one of the most natural ways of
reaching such a joint decision. Of course, the result of voting is
most satisfactory if the voting agents agree on what the outcome
should be even before any votes are cast, i.e., if they are in a state
of consensus. Unfortunately, a consensus is hard to come by, but in
this talk we will show that many voting rules can be viewed as
'automatically' seeking consensus. Interestingly, we will see that the
methods in which voting rules seek consensus are remarkably similar to
control and bribery, which are ways of manipulating elections.
Bio: Piotr Faliszewski is an assistant professor at the Department of
Computer Science of the AGH University of Science and Technology in
Krakow, Poland. He received his Ph.D. degree (2009) from the
University of Rochester, where he worked under the supervision of
Prof. Lane A. Hemaspaandra. Piotr's scientific interests include
computational social choice, algorithms, computational complexity, and
game theory.
Refreshments will be provided at 10:45AM