Britta Peis
Matchings and Matroids in Algorithmic Game Theory
Prof. Dr. Britta Peis
RWTH Aachen University
Chair of Management Science
Time & Place
The presentation on October 25, 2016 will be given in the Lukasklause (Schleinufer 1, 39104 Magdeburg) and starts at 5.00 p.m. (Historischer Raum).
Abstract
Throughout the talk we will see that the theory of combinatorial optimization turns out to be extremely helpful when it comes to analyzing game-theoretic models. We focus on the important role of structures and algorithms known from matching-and matroid theory for network bargaining games and congestion games. For example, we will see that congestion games are immune to Braess' paradox if (and only if) each player's strategy space forms the base set of a matroid.