Informatics, TU Vienna

Economics and Computation

Five Challenges in Algorithmic Game Theory, Computational Social Choice, and Fair Division

Abstract

In this talk, a number of interesting models, results, and challenges from algorithmic game theory, computational social choice, and fair division will be surveyed. In particular, the complexity of beneficial merging and splitting in weighted voting games, of stability notions in hedonic games, and of manipulating and controlling elections will be presented.

Note

With kind support of the Vienna Center for Logic and Algorithms and the Wolfgang Pauli Institute.