Dr. Karsten Tiemann
I was a member of
the research group of Prof. Dr. Burkhard Monien
and the International Graduate School of Dynamic Intelligent Systems
from 2004 to 2007. During that time my research was focused on game theory and selfish routing.
I received my Ph.D. degree from the University of Paderborn in August 2007.
PhD project research interests:
- Game theory: Selfish routing and (Bayesian) Nash equilibria for network games
- Cost-sharing mechanisms
Pre-PhD research interests:
- Efficient algorithms for the optimization problem TestCover (in co-operation with Torsten Fahle)
- Meshing algorithms for PadFEM (student assistant PC²)
- Network simulator Sahne (student assistant AG MadH)
Teaching:
- Summer term 2006:
Proseminar "Algorithmische Spieltheorie"
Seminar "Algorithmische Spieltheorie"
- Summer term 2005:
Proseminar & Seminar "Algorithmische Spieltheorie"
- Winter term 2004/2005:
Tutorials for "Equilibria in strategischen Spielen"
- Summer term 2004:
Tutorials for "Datenstrukturen & Algorithmen"
-
Winter term 2003/2004:
Tutorials for "Modellierung"
- Winter term 2002/2003:
Tutorials for "Berechenbarkeit & formale Sprachen"
- Winter term 2001/2002:
Tutorials for "Grundlagen der Rechnerarchitektur"
- Summer term 2001:
Tutorials for "Grundlagen der technischen Informatik"
Publications (Journals and Conference Proceedings):
- Martin Gairing, Burkhard Monien, Karsten Tiemann.
Selfish Routing with Incomplete Information.
Theory of Computing Systems.
Volume 42, Number 1, pp. 91-130, 2008.
- Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann.
Congestion Games with Player-Specific Constants.
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007, Cesky Krumlov / Czech Republic).
Lecture Notes in Computer Science, Vol. 4708, pp. 633-644, 2007.
- Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann.
The Power of Two Prices: Beyond Cross-Monotonicity.
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007, Cesky Krumlov / Czech Republic).
Lecture Notes in Computer Science, Vol. 4708, pp. 657-668, 2007.
- Burkhard Monien, Karsten Tiemann.
Routing and Scheduling with Incomplete Information.
21st International Symposium on Distributed Computing (DISC 2007, Lemesos / Cyprus).
Lecture Notes in Computer Science, Vol. 4731, pp. 1-2, 2007.
- Torsten Fahle, Karsten Tiemann.
A Faster Branch-and-Bound Algorithm for the Test Cover Problem Based on Set Covering Techniques.
ACM Journal of Experimental Algorithmics.
Volume 11, Article No. 2.2, 2006.
- Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann.
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.
2nd international Workshop on Internet & Network Economics (WINE 2006, Patras / Greece).
Lecture Notes in Computer Science, Vol. 4286, pp. 331-342, 2006.
- Martin Gairing, Burkhard Monien, Karsten Tiemann.
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.
33rd International Colloquium on Automata, Languages and Programming (ICALP 2006, Venice / Italy).
Lecture Notes in Computer Science, Vol. 4051, pp. 501-512, 2006.
- Martin Gairing, Burkhard Monien, Karsten Tiemann.
Selfish Routing with Incomplete Information.
17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005, Las Vegas / USA).
Proceedings of the 17th ACM SPAA, pp. 203-212, 2005.
- Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann.
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
32nd International Colloquium on Automata, Languages and Programming (ICALP 2005, Lisboa / Portugal).
Lecture Notes in Computer Science, Vol. 3580, pp. 51-65, 2005.
- Torsten Fahle, Karsten Tiemann.
An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
4th International Workshop on Efficient and Experimental Algorithms (WEA 2005, Santorini Island / Greece).
Lecture Notes in Computer Science, Vol. 3503, pp. 89-100, 2005.
Publications (Theses):
- Karsten Tiemann.
Selfish Routing with Incomplete Information.
PhD thesis, University of Paderborn, 2007.
- Karsten Tiemann.
Nash Equilibria for Connection Games on directed Graphs.
Diplomarbeit, University of Paderborn, 2004.
- Karsten Tiemann.
Ein erweiterter Branch & Bound Algorithmus für das TestCover-Problem.
Bachelor thesis, University of Paderborn, 2002.
Address:
-
Fürstenallee 11
33102 Paderborn
Germany
Contact:
-
eMail: tiemann ät uni - paderborn . de