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. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Paderborn; 2019. doi: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. 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. International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.
LibreCat | Files available | Download (ext.)
 

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

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

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

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

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

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

2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf J. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn; 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2484
Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51
LibreCat | Files available | DOI | arXiv
 

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

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

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

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

2017 | Mastersthesis | LibreCat-ID: 1080
Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.
LibreCat
 

2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 113
Feldotto M, Gairing M, Kotsialou G, Skopalik A. 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. doi:10.1007/978-3-319-71924-5_14
LibreCat | Files available | DOI | arXiv
 

2017 | Mastersthesis | LibreCat-ID: 1081
Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.
LibreCat
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.
LibreCat
 

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

2017 | Conference Paper | LibreCat-ID: 1095
John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: Proceedings of the 25th European Conference on Information Systems (ECIS). ; 2017:2970-2979.
LibreCat | Files available | Download (ext.)
 

2016 | Conference Paper | LibreCat-ID: 149
Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43
LibreCat | Files available | DOI
 

2016 | Journal Article | LibreCat-ID: 145
Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience. 2016;28(5):1655-1677. doi:10.1002/cpe.3716
LibreCat | Files available | DOI
 

2016 | Mastersthesis | LibreCat-ID: 210
Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.
LibreCat
 

2016 | Bachelorsthesis | LibreCat-ID: 1082
Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016.
LibreCat
 

2016 | Conference Paper | LibreCat-ID: 209
Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47
LibreCat | Files available | DOI | arXiv
 

2016 | Journal Article | LibreCat-ID: 159
Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571
LibreCat | Files available | DOI
 

2016 | Dissertation | LibreCat-ID: 200
Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.
LibreCat | Files available
 

2015 | Mastersthesis | LibreCat-ID: 251
Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015.
LibreCat
 

2015 | Conference Paper | LibreCat-ID: 271
Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14
LibreCat | Files available | DOI | arXiv
 

2015 | Bachelorsthesis | LibreCat-ID: 316
Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015.
LibreCat
 

2015 | Bachelorsthesis | LibreCat-ID: 277
Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn; 2015.
LibreCat
 

2015 | Journal Article | LibreCat-ID: 320
Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 395
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 453
Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 412
Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300
LibreCat | Files available | DOI | arXiv
 

2014 | Bachelorsthesis | LibreCat-ID: 373
Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014.
LibreCat
 

2014 | Conference Paper | LibreCat-ID: 455
Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LIPIcs. ; 2014:242-257. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 462
Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014). ; 2014:625-630. doi:10.5220/0005110406250630
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 451
Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121. doi:10.1007/978-3-662-44803-8_10
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 456
Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:480-485. doi:10.1007/978-3-319-13129-0_43
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 370
Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 452
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.
LibreCat | Files available
 

Filters and Search Terms

department=541

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed