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.

N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015.

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.

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.

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.

D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.

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.

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.

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.

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.

M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.

S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.

M. Feldotto, M. Gairing, and A. Skopalik, “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), 2014, pp. 30–43.

C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.

M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.

M. Feldotto and A. Skopalik, “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, pp. 625–630.

S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.

M. Feldotto, C. Scheideler, and K. Graffi, “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, pp. 1–10.

R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol. 21, no. 5, pp. 1461–1471, 2013.

R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” in Infocom’2012, Orlando, Florida, 2012.

R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42.