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.

43 Publications


2019 | Dissertation | LibreCat-ID: 8080
Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Paderborn. https://doi.org/10.17619/UNIPB/1-588
LibreCat | Files available | DOI | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 5471
Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (n.d.). Multi-unit Bilateral Trade. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Honolulu, Hawaii, USA.
LibreCat | Files available
 

2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA. https://doi.org/10.1145/3230654.3230659
LibreCat | Files available | DOI
 

2018 | Mastersthesis | LibreCat-ID: 1186
Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 1369
Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0269-7
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 669
Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51
LibreCat | Files available | DOI | arXiv
 

2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.
LibreCat
 

2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 112
Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19
LibreCat | Files available | DOI | arXiv
 

2017 | Conference Paper | LibreCat-ID: 66
Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15
LibreCat | Files available | DOI
 

2017 | Conference Paper | LibreCat-ID: 59
Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132). https://doi.org/10.1145/3087556.3087578
LibreCat | Files available | DOI
 

2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall, S. (2017). Sortieren dynamischer Daten. 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 | Conference Paper | LibreCat-ID: 113
Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE). https://doi.org/10.1007/978-3-319-71924-5_14
LibreCat | Files available | DOI | arXiv
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop, S. (2017). Robuste Optimierung in Congestion Games. 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
 

2017 | Conference Paper | LibreCat-ID: 1094
Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik, A. (2017). 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) (pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32
LibreCat | Files available | DOI
 

Filters and Search Terms

department=541

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed