Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
16 Publications
2019 | Dissertation | LibreCat-ID: 8080
Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-588
LibreCat
| Files available
| DOI
| Download (ext.)
2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.
LibreCat
2018 | Mastersthesis | LibreCat-ID: 1186
Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1080
Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1081
Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.
LibreCat
2016 | Dissertation | LibreCat-ID: 200
Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.
LibreCat
| Files available