G. Polevoy and M. Dziubiski, “Fair, Individually Rational and Cheap Adjustment,”10.24963/ijcai.2022/64__in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, Vienna, 2022, doi:10.24963/ijcai.2022/64 .
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “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, pp. 113–123.
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

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

P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “Multi-unit Bilateral Trade,”10.1609/aaai.v33i01.33011973__presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi:10.1609/aaai.v33i01.33011973 .
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “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, Montreal QC, Canada, 2019, pp. 1949--1951.
LibreCat: /record/10281

B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6.
LibreCat: /record/2831
DOI: 10.1145/3230654.3230659

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

G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232.
LibreCat: /record/17651

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

M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018.
LibreCat: /record/1187

J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.
LibreCat: /record/1188

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018.
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

M. Feldotto, M. Gairing, G. Kotsialou, and A. 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.
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

G. Polevoy, S. Trajanovski, P. Grosso, and C. 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, 2017, pp. 3–17.
LibreCat: /record/17652
DOI: 10.1007/978-3-319-71150-8_1

G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.
LibreCat: /record/17653

G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.
LibreCat: /record/17654

P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.
LibreCat: /record/59
DOI: 10.1145/3087556.3087578

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.
LibreCat: /record/66
DOI: 10.1007/978-3-319-62389-4_15

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

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

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

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

M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. 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), 2017, pp. 462–467.
LibreCat: /record/1094
DOI: 10.1007/978-3-319-59144-5_32

T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.
LibreCat: /record/1095

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

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

G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.
LibreCat: /record/17655
DOI: 10.3233/978-1-61499-672-9-417

G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432.
LibreCat: /record/17656

M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.
LibreCat: /record/209
DOI: 10.1007/978-3-319-48749-6_47
arXiv: 1607.05143

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

T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.
LibreCat: /record/145
DOI: 10.1002/cpe.3716

K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.
LibreCat: /record/251

I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.
LibreCat: /record/320
DOI: 10.1145/2614687

J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015.
LibreCat: /record/316

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “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), 2015, pp. 178–189.
LibreCat: /record/271
DOI: 10.1007/978-3-662-48433-3_14
arXiv: 1507.02908

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

R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
LibreCat: /record/17657
DOI: 10.1109/TCC.2015.2487964

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

T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.
LibreCat: /record/370
DOI: 10.1109/TNET.2015.2468571

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

G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared Effort Games,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 861–868.
LibreCat: /record/17659

G. Polevoy and M. M. de Weerdt, “Improving Human Interaction in Crowdsensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1741–1742.
LibreCat: /record/17660

T. C. King et al., “Request Driven Social Sensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1651–1652.
LibreCat: /record/17661

G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and Social Welfare,” ACM Trans. Econ. Comput., vol. 2, no. 1, pp. 1:1-1:16, 2014.
LibreCat: /record/17662
DOI: 10.1145/2560766