Publications
In descending chronological order:
Forthcoming/In Preparation:
- [BMSxx]
- Yvonne Bleischwitz, Burkhard Monien, and Florian Schoppmann: To Be or Not to Be (Served): Cost-Sharing Without Indifferences. Manuscript. Supersedes [BMS07].
[BibTeX] [PDF]
- [BMSTxx]
- Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, and Karsten Tiemann: The Power of Lexicographic Maximization: Beyond Cross-Monotonicity. Manuscript. Supersedes [BMST07].
[BibTeX] [PDF]
2011:
- [ADGMS11]
- Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, and Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. In: SIAM Journal on Computing. Volume 40, Issue 5, 15 September 2011. Pages 1211–1233. DOI: 10.1137/090748986. Supersedes [ADGMS06].
[BibTeX] [PDF]
- [RS11]
- Tim Roughgarden and Florian Schoppmann: Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. In: Proceedings of the 22th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'11).
[BibTeX] [PDF] [Slides]
2009:
- [PSSW09]
- Paolo Penna, Florian Schoppmann, Riccardo Silvestri, and Peter Widmayer: Pseudonyms in cost-sharing games. In: Proceedings of the 5th International Workshop on Internet and Network Economics (WINE'09). DOI: 10.1007/978-3-642-10841-9_24
[BibTeX] [PDF] [Slides]
- [S09]
- Florian Schoppmann: Collusion-Resistant Cost-Sharing Mechanisms: Design Techniques, Analyses, Trade-Offs. Dissertation. University of Paderborn, Germany. URN (NBN): urn:nbn:de:hbz:466-20090708015
[BibTeX] [PDF] [Slides (in German)]
2008:
- [S08]
- Florian Schoppmann: The Power of Small Coalitions in Cost Sharing. In: Proceedings of the 4th International Workshop on Internet and Network Economics (WINE'08). DOI: 10.1007/978-3-540-85238-4_41
[BibTeX] [PDF] [Slides]
- [MMPS08]
- Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, and Florian Schoppmann: Voronoi Games on Cycle Graphs. In: Processings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08). DOI: 10.1007/978-3-540-85238-4_41
[BibTeX] [PDF] [Slides]
- [BS08b]
- Yvonne Bleischwitz and Florian Schoppmann: Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location. In: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT'08). DOI: 10.1007/978-3-540-79309-0_31
[BibTeX] [PDF]
- [BS08a]
- Yvonne Bleischwitz and Florian Schoppmann: New Efficiency Results for Makespan Cost Sharing. In: Information Processing Letters. Volume 107, Issue 2, 16 July 2008. Pages 64–70. Elsevier B.V. DOI: 10.1016/j.ipl.2008.01.005
[BibTeX] [PDF]
2007:
- [BMS07]
- Yvonne Bleischwitz, Burkhard Monien, and Florian Schoppmann: To be or not to be (served). In: Proceedings of the 3rd International Workshop On Internet and Network Economics (WINE'07). DOI: 10.1007/978-3-540-77105-0_55. Superseded by extended version [BMSxx].
[BibTeX] [PDF]
- [GS07]
- Martin Gairing and Florian Schoppmann: Total Latency in Singleton Congestion Games. In: Proceedings of the 3rd International Workshop On Internet And Network Economics (WINE'07). DOI: 10.1007/978-3-540-77105-0_42
[BibTeX] [PDF] [Slides]
- [BMST07]
- Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, and Karsten Tiemann: The Power of Two Prices: Beyond Cross-Monotonicity. In: Proceedings of the 32nd International Symposium on Mathematical Foundation of Computer Science (MFCS'07). DOI: 10.1007/978-3-540-74456-6_58. Superseded by extended version [BMSTxx].
[BibTeX] [PDF] [Slides]
2006:
- [MMST06]
- Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, and Karsten Tiemann: Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. In: Proceedings of the 2nd Workshop on Internet and Network Economics (WINE'06). DOI: 10.1007/11944874_30
[BibTeX] [PDF] [Slides]
- [ADGMS06]
- Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, and Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS'06). DOI: 10.1007/11672142_17. Superseded by extended version [ADGMSxx].
[BibTeX] [PDF]
2005:
- [S05b]
- Florian Schoppmann: Price of Anarchy for Congestion Games with Polynomial Latency Functions. Diploma's Thesis (Diplomarbeit). University of Paderborn, Germany.
[BibTeX] [PDF] [Slides (in German)]
- [S05a]
- Florian Schoppmann: Online Occlusion Culling. Bachelor's Thesis. University of Paderborn, Germany.
Obligatory Copyright Notice
The documents available on this page have been provided 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 are offered 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.
Teaching
Teaching Assistance
Pre-Ph.D. Studies
During my 2001–2005 studies of computer science with mathematics as minor, I created summaries of various classes (in German). I provide links here because they might prove helpful to current students of similar classes.