Algorithmic Aspects of Game Theory and Social Choice

All Lectures will take place in MTL3.

More about the workshop

Morning Session. Chair: Arkadii Slinko

9:00 - 10:00 Breakfast/Morning tea/Registration: Mathematics Staff Common Room.
10:00 - 10:50 Toby Walsh "Where are the hard manipulation problems for STV election".
11:00 - 11:30 Mark Wilson "A measure of the difficulty of manipulation of voting rules".
11:30 - 12:00 Geoff Pritchard "Asymptotic analysis of a measure of strategic manipulation for scoring rules and Copeland's method".

Afternoon Session. Chair: Joerg Rothe

2:00 - 2:50 Detlef Seese "From decidability of theories to parameterized complexity:

observations on logical ways to avoid complexity".

3:00 - 3:30 Fran Rosamond "Fixed-Parameter Algorithms for Kemeny Score".
3:30 - 4:00 Afternoon tea. Mathematics Staff Common Room.
4:00 - 4:30 Reyhaneh Reyhani "Duverger's law: a general model for effects of polls on voters' behavior".
4:30 - 5:00 Arkadii Slinko "Cloning Candidates as Manipulation in Elections".

6:30 Dinner at Wine Chambers.

Morning Session. Chair: Matthew Ryan

9:00 - 9:50 Andy McLennan "Coalitional Bargaining: How Complex Is It?".
10:00 - 10:30 Morning tea. Mathematics Staff Common Room.
10:30 - 11:00 Tatiana Gvozdeva "Weighted and Roughly Weighted Simple Games".
11:00 - 11:45 Claudia Lindner "Not Everyone Likes Mushrooms: Fair Division and Degrees of Guaranteed Envy-Freeness".

Afternoon Session. Chair: Mark Wilson

2:00 - 2:50 Edith Elkind "Algorithms for Safe Manipulation".
3:00 - 3:30 Joerg Rothe "The Shield that Never Was: Societies with Single-Peaked Preferences

are More Open to Manipulation and Control".

3:30 - 4:00 Afternoon tea. Mathematics Staff Common Room.
4:00 - 4:30 Dorothea Baumeister "The Complexity of Computing Minimal Unidirectional Covering Sets".
4:30 - 5:10 Markus Brill "Minimal Retentive Sets in Tournaments".

(Boarding on the waterfront opposite Copthorne Hotel).

Contents