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.

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.

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.

Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.

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.

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.

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.

Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.

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.

Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.