Polevoy, Gleb, and Marcin Dziubiski. “Fair, Individually Rational and Cheap Adjustment.”10.24963/ijcai.2022/64__Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.”10.1109/CSCloud/EdgeCom.2019.000-9__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–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

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

Lazos, Philip, et al. “Multi-Unit Bilateral Trade.”10.1609/aaai.v33i01.33011973__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, 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: /record/10281

Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”10.4230/LIPIcs.ICALP.2018.51__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: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.”10.1145/3230654.3230659__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: /record/2831
DOI: 10.1145/3230654.3230659

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

Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.
LibreCat: /record/17651

Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.”https://doi.org/10.1016/j.future.2018.08.011__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, Matthias, et al. “Congestion Games with Mixed Objectives.”10.1007/s10878-017-0189-y__Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.
LibreCat: /record/1188

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

Feldotto, Matthias, et al. “Congestion Games with Complementarities.”10.1007/978-3-319-57586-5_19__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: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.”10.1007/978-3-319-71924-5_14__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, Gleb, et al. “Filtering Undesirable Flows in Networks.”10.1007/978-3-319-71150-8_1__Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.
LibreCat: /record/17652
DOI: 10.1007/978-3-319-71150-8_1

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

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

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

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

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

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

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

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

Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.”10.1007/978-3-319-59144-5_32__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: /record/1094
DOI: 10.1007/978-3-319-59144-5_32

John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79.
LibreCat: /record/1095

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

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

Polevoy, Gleb, et al. “The Game of Reciprocation Habits.”10.3233/978-1-61499-672-9-417__Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.
LibreCat: /record/17655
DOI: 10.3233/978-1-61499-672-9-417

Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.
LibreCat: /record/17656

Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.”10.1007/978-3-319-48749-6_47__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 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, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.
LibreCat: /record/1082

Harks, Tobias, et al. “Routing Games With Progressive Filling.”10.1109/TNET.2015.2468571__IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

Drees, Maximilian, et al. “Strategic Online Facility Location.”10.1007/978-3-319-48749-6_43__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1002/cpe.3716__Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.
LibreCat: /record/145
DOI: 10.1002/cpe.3716

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

Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.”10.1145/2614687__Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.
LibreCat: /record/320
DOI: 10.1145/2614687

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

Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.”10.1007/978-3-662-48433-3_14__Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, 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, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015.
LibreCat: /record/277

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

Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.”http://dx.doi.org/10.1016/j.dam.2015.05.013__Discrete Applied Mathematics , vol. 194, Elsevier, 2015, pp. 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, Tobias, et al. “Routing Games with Progressive Filling.”10.1109/TNET.2015.2468571__Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
LibreCat: /record/370
DOI: 10.1109/TNET.2015.2468571

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

Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 861–68.
LibreCat: /record/17659

Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1741–42.
LibreCat: /record/17660

King, Thomas C., et al. “Request Driven Social Sensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1651–52.
LibreCat: /record/17661

Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.”10.1145/2560766__ACM Trans. Econ. Comput., vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:10.1145/2560766.
LibreCat: /record/17662
DOI: 10.1145/2560766