Polevoy, G., &; Dziubiski, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization.https://doi.org/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. (2019). 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) (pp. 113–123).https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9 
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn.https://doi.org/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. (2019).https://doi.org/10.1609/aaai.v33i01.33011973__Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA.https://doi.org/10.1609/aaai.v33i01.33011973 
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

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

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

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

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

Polevoy, G., Trajanovski, S., Grosso, P., &; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &; A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing.
LibreCat: /record/17651

Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems.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. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167.https://doi.org/10.1007/s10878-017-0189-y 
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Polevoy, G., de Weerdt, M. M., &; Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425).https://doi.org/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. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat: /record/17656

Feldotto, M., Leder, L., &; Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669).https://doi.org/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. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.
LibreCat: /record/1082

Harks, T., Höfer, M., Schewior, K., &; Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562.https://doi.org/10.1109/TNET.2015.2468571 
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

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

Feldotto, M., &; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677.https://doi.org/10.1002/cpe.3716 
LibreCat: /record/145
DOI: 10.1002/cpe.3716

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

Caragiannis, I., Fanelli, A., Gravin, N., &; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation, 3(1).https://doi.org/10.1145/2614687 
LibreCat: /record/320
DOI: 10.1145/2614687

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

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2015). 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) (pp. 178–189).https://doi.org/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. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn.
LibreCat: /record/277

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

Bar-Yehuda, R., Polevoy, G., &; Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics , 194, 23–36.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. (2014). Routing Games with Progressive Filling. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14) (pp. 352–360).https://doi.org/10.1109/TNET.2015.2468571 
LibreCat: /record/370
DOI: 10.1109/TNET.2015.2468571

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

Polevoy, G., Trajanovski, S., &; de Weerdt, M. M. (2014). Nash Equilibria in Shared Effort Games. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 861–868). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat: /record/17659

Polevoy, G., &; de Weerdt, M. M. (2014). Improving Human Interaction in Crowdsensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1741–1742). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat: /record/17660

King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk, M. B., &; Warnier, M. (2014). Request Driven Social Sensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat: /record/17661

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

Drees, M., Riechers, S., &; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).https://doi.org/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. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).
LibreCat: /record/452

Feldotto, M., Gairing, M., &; Skopalik, A. (2014). 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) (pp. 30–43).https://doi.org/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. (2014). Approximate pure Nash equilibria in weighted congestion games. In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (pp. 242–257).https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242 
LibreCat: /record/455
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.242

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

Feldotto, M., &; Skopalik, A. (2014). 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) (pp. 625–630).https://doi.org/10.5220/0005110406250630 
LibreCat: /record/462
DOI: 10.5220/0005110406250630

Abshoff, S., Cord-Landwehr, A., Jung, D., &; Skopalik, A. (2014). Multilevel Network Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 435–440).https://doi.org/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. (2014). 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) (pp. 1–10).https://doi.org/10.1109/P2P.2014.6934300 
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

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

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

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