| Lars Olbrich |
Contact
|
Research topics
I am interested in- Algorithmic Game Theory
- Graphs and Networks
- Efficient Algorithms
Publications
-
Doing Good with Spam is Hard
Martin Hoefer, Lars Olbrich, and Alexander Skopalik.
Symposium on Algorithmic Game Theory (SAGT), to appear,
Paphos, Cyprus, October 2009 -
Taxing Subnetworks
Martin Hoefer, Lars Olbrich, and Alexander Skopalik.
In Proc. of 4th Workshop on Internet and Network Economics (WINE),
Shanghai, China, December 2008
(454 kB)
-
Sensitivity of Wardrop Equilibria
Matthias Englert, Thomas Franke, and Lars Olbrich.
In Proc. of 1st Symposium on Algorithmic Game Theory (SAGT),
Paderborn, Germany, May 2008 (233 kB)
Journal version: (234 kB) in
Theory of Computing Systems 2009 (Special Issue SAGT 2008) -
Approximating Wardrop Equilibria with Finitely Many Agents
Simon Fischer, Lars Olbrich, and Berthold Vöcking.
In Proc. of 21st International Symposium on Distributed Computing (DISC),
Lemesos, Cyprus, September 2007 (202 kB)
Journal version: (231 kB) in
Distributed Computing 2008 (Special Issue DISC 2007)
Diploma Thesis
- "Komplexität unendlicher Spiele auf endlichen Graphen"
supervised by Prof. Ambos-Spies and PD Dr. Merkle
Teaching Assistance
- Winter 2010: Seminar Dynamics and Learning in Networks
- Summer 2008: Seminar Highlights der Algorithmik
- Summer 2007: Seminar Strategische Aspekte in Netzwerken
- Winter 2006: Seminar Network Algorithms
© Copyright Notice
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.