| Heiner Ackermann |
Contact
|
(in real life) |
Preprints
- Concurrent Imitation Dynamics in Congestion Games
Heiner Ackermann, Petra Berenbrink, Simon Fischer, and Martin HoeferTechnical Report arXiv:0808.2081
- On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games
Heiner Ackermann and Heiko RöglinTechnical Report arXiv:0805.1130
- Uncoordinated Two-Sided Matching Markets
Heiner Ackermann, Paul Goldberg, Vahab Mirrokni, Heiko Röglin, and Berthold Vöcking.Outstanding Paper Award.In Proc. 9th EC, Chicago, USA, 2008, p. 256-263. [ DOI ]
- Who Should Pay for Forwarding Packets?
Heiner Ackermann, Alexander Fanghänel, Patrick Briest, and Berthold Vöcking.In Proc. 3rd WINE, San Diego, USA, 2007, p. 208-219. [ DOI ]
- On the Complexitiy of Pure Nash Equilibria in Player-Specific Network Congestion Games.
Heiner Ackermann, and Alexander Skopalik.In Proc. 3rd WINE, San Diego, USA, 2007, p. 419-430. [ DOI ]- A Unified Approach to Congestion Games and Two-Sided Markets.
Heiner Ackermann, Paul Goldberg, Vahab Mirrokni, Heiko Röglin, and Berthold Vöcking.In Proc. 3rd WINE, San Diego, USA, 2007, p. 30-41. [ DOI ]- A First Step towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games.
Heiner Ackermann.In Proc. 4th SAGA, Zürich, Switzerland, 2007, p. 58 - 69. [ DOI ]- Pure Nash Equilibria in Player-Specific and Weighted Congestion Games.
Heiner Ackermann, Heiko Röglin, and Berthold Vöcking.In Proc. 2nd WINE, Patras, Greece, 2006, p. 50 - 61. [ DOI ]- On the Impact of Combinatorial Structure on Congestion Games.
Heiner Ackermann, Heiko Röglin, and Berthold Vöcking.In Proc. 47th FOCS, Berkeley, USA, 2006, p. 613 - 622. [ DOI ]- Decision Making Based on Approximate and Smoothed Pareto Curves.
Heiner Ackermann, Alantha Newman, Heiko Röglin, and Berthold Vöcking.In Proc. 16th ISAAC, Sanya, China, 2005, p. 675 - 684. [ DOI ]Publications in Journals- Decision Making Based on Approximate and Smoothed Pareto Curves.
Heiner Ackermann, Alantha Newman, Heiko Röglin, and Berthold Vöcking.In Theoretical Computer Science, Volume 378 (3), 2007, p. 253-270. (Special issue ISAAC 2005). [ DOI ]
-
Approximationsalgorithmen für nicht-additive Optimierungsprobleme.
Diplomarbeit, Lehrstuhl für Informatik 2, Universität Dortmund, Mai 2005.
Teaching Assistance- Sommer 2007: Seminar Algorithmische Spieltheorie
- Winter 2006/07: Berechenbarkeit und Komplexität
- Winter 2005/06: Berechenbarkeit und Komplexität
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. - On the Complexitiy of Pure Nash Equilibria in Player-Specific Network Congestion Games.