Seminar announcement: Computational Social Choice
We are pleased to announce the following seminar:
Title: Computational Social Choice
Speaker: Edith Elkind, University of Oxford
Dates: 12-15 March 2018
Location: Universidad Carlos III de Madrid, Leganés Campus
Summary
The rapidly growing field of computational social choice, which lies at the intersection of computer science and economics, deals with algorithmic and complexity-theoretic aspects of collective decision making and voting in particular. The ingredients of a typical voting problem are agents (or voters) and alternatives (or candidates). Agents express their opinions over the alternatives (either in the form of approval ballots, or partial orders, or complete rankings), and the task is typically to produce an outcome (which can be a single winner, a fixed-size set of alternatives, or a ranking of all alternatives), which reflects the overall societal opinion. This model finds applications in various scenarios, ranging from political elections, hiring committees, to recommender systems and crowdsourcing. This course discusses a number of prominent topics in computational social choice, such as the design of efficient preference aggregation mechanisms for a given task, the role of computational complexity as a barrier against strategic behaviour, and the exploitation of input structure to work around axiomatic impossibility issues.
Schedule:
Monday, 12nd March: from 11 to 14 hours. Classroom 4.0E06
Monday, 12nd March: from 16:15 to 19:15 hours. Classroom 4.2E02
Tuesday, 13rd March: from 11 to 14 hours. Classroom 7.2J02
Tuesday, 13rd March: from 16:15 to 19:15 hours. Classroom 7.2J02
Thursday, 15th March: from 10:00 to 14:00 hours. Classroom 4.0E02
