Economics and Computation
Five Challenges in Algorithmic Game Theory, Computational Social Choice, and Fair Division
- Starts at
-
TU Wien, Campus Gußhaus
EI 1 Petritsch-Hörsaal -
1040 Vienna, Gußhausstraße 25
Stiege 8, 2. Stock, Raum CF0242
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.
Speakers
- Prof. Jörg Rothe, Heinrich-Heine-Universität Düsseldorf
Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.
Note: This is one of the thousands of items we imported from the old website. We’re in the process of reviewing each and every one, but if you notice something strange about this particular one, please let us know. — Thanks!