Polevoy G, Dziubiski M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative Security Defences in Multi Network Environments. In: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:10.1109/CSCloud/EdgeCom.2019.000-9
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

Feldotto M. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-588
LibreCat: /record/8080
DOI: 10.17619/UNIPB/1-588

Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B.10.1609/aaai.v33i01.33011973__Multi-unit Bilateral Trade. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). ; 2019. doi:10.1609/aaai.v33i01.33011973
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

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: /record/10281

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: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

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: /record/2831
DOI: 10.1145/3230654.3230659

Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn; 2018.
LibreCat: /record/3851

Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.
LibreCat: /record/17651

Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011
LibreCat: /record/17666
DOI: https://doi.org/10.1016/j.future.2018.08.011

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: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn; 2018.
LibreCat: /record/1186

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

Kempf J. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn; 2018.
LibreCat: /record/1188

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: /record/1369
DOI: 10.1007/s10878-018-0269-7

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: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

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: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-71150-8_1
LibreCat: /record/17652
DOI: 10.1007/978-3-319-71150-8_1

Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.
LibreCat: /record/17653

Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.
LibreCat: /record/17654

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: /record/59
DOI: 10.1145/3087556.3087578

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: /record/66
DOI: 10.1007/978-3-319-62389-4_15

Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.
LibreCat: /record/1073

Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.
LibreCat: /record/1074

Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.
LibreCat: /record/1080

Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.
LibreCat: /record/1081

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: /record/1094
DOI: 10.1007/978-3-319-59144-5_32

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: /record/1095

Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.
LibreCat: /record/200

Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.
LibreCat: /record/210

Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: Proceedings of the 2016 European Conference on Artificial Intelligence. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:10.3233/978-1-61499-672-9-417
LibreCat: /record/17655
DOI: 10.3233/978-1-61499-672-9-417

Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.
LibreCat: /record/17656

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: /record/209
DOI: 10.1007/978-3-319-48749-6_47
arXiv: 1607.05143

Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016.
LibreCat: /record/1082

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: /record/159
DOI: 10.1109/TNET.2015.2468571

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: /record/149
DOI: 10.1007/978-3-319-48749-6_43

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: /record/145
DOI: 10.1002/cpe.3716

Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015.
LibreCat: /record/251

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: /record/320
DOI: 10.1145/2614687

Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015.
LibreCat: /record/316

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: /record/271
DOI: 10.1007/978-3-662-48433-3_14
arXiv: 1507.02908

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

Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
LibreCat: /record/17657
DOI: 10.1109/TCC.2015.2487964

Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36. doi:http://dx.doi.org/10.1016/j.dam.2015.05.013
LibreCat: /record/17658
DOI: http://dx.doi.org/10.1016/j.dam.2015.05.013

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: /record/370
DOI: 10.1109/TNET.2015.2468571

Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014.
LibreCat: /record/373

Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:861-868.
LibreCat: /record/17659

Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1741-1742.
LibreCat: /record/17660

King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1651-1652.
LibreCat: /record/17661

Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare. ACM Trans Econ Comput. 2014;2(1):1:1-1:16. doi:10.1145/2560766
LibreCat: /record/17662
DOI: 10.1145/2560766

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: /record/451
DOI: 10.1007/978-3-662-44803-8_10

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: /record/452

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: /record/453
DOI: 10.1007/978-3-319-13129-0_3

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: /record/455
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.242

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: /record/456
DOI: 10.1007/978-3-319-13129-0_43

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: /record/462
DOI: 10.5220/0005110406250630

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: /record/395
DOI: 10.1007/978-3-319-13129-0_36

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 (P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471. doi:10.1109/TNET.2012.2227792
LibreCat: /record/17663
DOI: 10.1109/TNET.2012.2227792

Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. In: Infocom’2012, Orlando, Florida. ; 2012.
LibreCat: /record/17664

Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. In: DIALM-PODC. ; 2010:33-42.
LibreCat: /record/17665