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, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588.
LibreCat | Files available | DOI | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.
LibreCat | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 5471
Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI).
LibreCat | Files available
 

2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
LibreCat | Files available | DOI
 

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

2018 | Journal Article | LibreCat-ID: 1369
Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 669
Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
LibreCat | Files available | DOI | arXiv
 

2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.
LibreCat
 

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

2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
LibreCat | Files available | DOI | arXiv
 

2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
LibreCat | Files available | DOI
 

2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.
LibreCat | Files available | DOI
 

2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall, Simon. Sortieren dynamischer Daten. 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 | Conference Paper | LibreCat-ID: 113
Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
LibreCat | Files available | DOI | arXiv
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop, Simon. Robuste Optimierung in Congestion Games. 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, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi: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: MLA

Export / Embed