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.
61 Publications
2018 | Journal Article | LibreCat-ID: 669
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.
LibreCat
| Files available
| DOI
| arXiv
2018 | Mastersthesis | LibreCat-ID: 1186
Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.
LibreCat
2018 | Journal Article | LibreCat-ID: 1369
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 113
Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 17652
Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 17653
Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 17654
Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.
LibreCat
| Files available
| DOI
2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1080
Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1081
Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 1094
Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 1095 | 
John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In Proceedings of the 25th European Conference on Information Systems (ECIS), 2970–79, 2017.
LibreCat
| Files available
| Download (ext.)
2016 | Dissertation | LibreCat-ID: 200
Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.
LibreCat
| Files available
2016 | Mastersthesis | LibreCat-ID: 210
Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.
LibreCat