Research
Talks
- "Complexity of equilibria in games on networks", Disputation, Kaiserslautern, December 2009
- "How to find Nash equilibria with extreme total latency in network congestion games?, International Conference on Game Theory for Networks (GameNets 2009), Istanbul, May 2009
- "How hard is it to find extreme Nash equilibria in network congestion games?", Workshop on Internet and Network Economics (WINE 2008), Shanghai, December 2008
- "On Nash flows in series-parallel graphs", Workshop on Network Optimization 2006, Lambrecht (Pfalz), October 2006
Publications & Theses
- "Earliest-arrival flows in series-parallel graphs", joint work with Stefan Ruzika and Mechthild Steiner, Networks 57, no. 2 (2011), pages 169–173, DOI: 10.1002/net.20398
A preliminary version is available as a technical report: Report in Wirtschaftsmathematik 122 (2009) - "Efficient computation of equilibria in bottleneck games via game transformation", joint work with Sven O. Krumke and Thomas L. Werth, Report in Wirtschaftsmathematik 134, TU Kaiserslautern (2011)
- "How to find Nash equilibria with extreme total latency in network congestion games?", Mathematical Methods of Operations Research 71, no. 2 (2010), pages 245-265, DOI: 10.1007/s00186-009-0293-6
A preliminary version is available as a technical report: Report in Wirtschaftsmathematik 116, TU Kaiserslautern (2008) - "Selfish bin coloring", joint work with Leah Epstein, Sven O. Krumke, and Asaf Levin, Journal of Combinatorial Optimization (2010), online first, DOI: 10.1007/s10878-010-9302-1
A preliminary version is available as a technical report: Report in Wirtschaftsmathematik 123, TU Kaiserslautern (2009) - "Complexity of equilibria in games on networks", Dissertation, TU Kaiserslautern (2009)
- "How hard is it to find extreme Nash equilibria in network congestion games?", joint work with Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke and Gerhard J. Woeginger, Theoretical Computer Science 410, no. 47-49 (2009), pages 4989 - 4999, DOI: 10.1016/j.tcs.2009.07.046
- "How hard is it to find extreme Nash equilibria in network congestion games?" (extended abstract), joint work with Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke and Gerhard J. Woeginger, in: Proceedings of the 4th international Workshop on Internet and Network Economics (WINE 2008), Christos Papadimitriou and Shuzhong Zhang (eds.), LNCS vol. 5385 (2008), pp. 82-93, Springer, DOI: 10.1007/978-3-540-92185-1_17
- "Network design and selfish routing", Diplomarbeit, TU Kaiserslautern (2006)

