Algorithmic Game Theory
The algorithmic game theory group is an independent research group working on the analysis of
networked systems with rational agents and the design and analysis of efficient algorithms and protocols.
We teach complementing courses that cover topics in algorithms and complexity, microeconomics, distributed
computing, and discrete mathematics. Our group is associated with the Chair of Computer Science 1 of
Prof. Berthold Vöcking.
Research Areas:
- Rational Behavior in Networks
- Equilibrium Analysis and Computation
- Convergence of Dynamics
- Algorithms for Distributed Systems
- Mechanism Design
People
|
Head of the Group:
|
Secretary:
|
Research Assistant:
|
|
|
News
- New paper on algorithms for wireless networks with Rayleigh fading accepted to SPAA 2012.
- New paper on secondary spectrum auctions accepted to EC 2012.
- Full versions of our two ESA'10 papers accepted to Algorithmica and Math. Programming.
- Johannes wins our departmental One-Minute-Madness at TDI 2011.
- See you at Games, Algorithms and Optimization on June 24th, 2011 in Paris.
- Our paper Local Matching Dynamics in Social Networks wins the ICALP 2011 Best Paper Award for Track C!
- Two papers of our group accepted to ICALP 2011 dealing with convergence properties of power control dynamics in wireless networks and matching dynamics in social networks.
- New paper on considerate behavior and coalitional equilibria accepted to IJCAI 2011.
- New paper on truthful combinatorial spectrum auctions accepted to SPAA 2011.
- New paper on competitive power control with limited energy accepted to DySPAN 2011.