| Fast convergence to nearly optimal solutions in potential games B Awerbuch, Y Azar, A Epstein, VS Mirrokni, A Skopalik Proceedings of the 9th ACM conference on Electronic commerce, 264-273, 2008 | 144 | 2008 |
| Inapproximability of pure Nash equilibria A Skopalik, B Vöcking Proceedings of the fortieth annual ACM symposium on Theory of computing, 355-364, 2008 | 132 | 2008 |
| Altruism in atomic congestion games M Hoefer, A Skopalik ACM Transactions on Economics and Computation (TEAC) 1 (4), 1-21, 2013 | 73 | 2013 |
| Efficient computation of approximate pure Nash equilibria in congestion games I Caragiannis, A Fanelli, N Gravin, A Skopalik 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 532-541, 2011 | 70 | 2011 |
| Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure I Caragiannis, A Fanelli, N Gravin, A Skopalik ACM Transactions on Economics and Computation (TEAC) 3 (1), 1-32, 2015 | 55 | 2015 |
| Taxing subnetworks M Hoefer, L Olbrich, A Skopalik International workshop on internet and network economics, 286-294, 2008 | 42 | 2008 |
| The Shapley value as a function of the quota in weighted voting games Y Zick, A Skopalik, E Elkind 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 …, 2011 | 36 | 2011 |
| Computing pure nash and strong equilibria in bottleneck congestion games T Harks, M Hoefer, M Klimm, A Skopalik Mathematical Programming 141, 193-215, 2013 | 29 | 2013 |
| On the complexity of pure Nash equilibria in player-specific network congestion games H Ackermann, A Skopalik International Workshop on Web and Internet Economics, 419-430, 2007 | 29 | 2007 |
| Computing pure Nash and strong equilibria in bottleneck congestion games T Harks, M Hoefer, M Klimm, A Skopalik Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010 | 27 | 2010 |
| Considerate equilibrium M Hoefer, M Penn, M Polukarov, A Skopalik, B Vöcking Proceedings of the Twenty-Second international joint conference on …, 2010 | 26 | 2010 |
| Approximate pure Nash equilibria in weighted congestion games C Hansknecht, M Klimm, A Skopalik Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 25 | 2014 |
| On the complexity of Nash dynamics and sink equilibria VS Mirrokni, A Skopalik Proceedings of the 10th ACM conference on Electronic commerce, 1-10, 2009 | 21 | 2009 |
| On the complexity of Pareto-optimal Nash and strong equilibria M Hoefer, A Skopalik International Symposium on Algorithmic Game Theory, 312-322, 2010 | 19 | 2010 |
| Improving approximate pure nash equilibria in congestion games V Ravindran Vijayalakshmi, A Skopalik International Conference on Web and Internet Economics, 280-294, 2020 | 17* | 2020 |
| Social context in potential games M Hoefer, A Skopalik International Workshop on Internet and Network Economics, 364-377, 2012 | 17 | 2012 |
| Complexity of pure Nash equilibria in player-specific network congestion games H Ackermann, A Skopalik Internet Mathematics 5 (4), 323-342, 2008 | 17 | 2008 |
| Sharing is caring: Multiprocessor scheduling with a sharable resource P Kling, A Mäcker, S Riechers, A Skopalik Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017 | 16 | 2017 |
| Computing approximate pure nash equilibria in shapley value weighted congestion games M Feldotto, M Gairing, G Kotsialou, A Skopalik Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017 | 16 | 2017 |
| Stability and convergence in selfish scheduling with altruistic agents M Hoefer, A Skopalik International Workshop on Internet and Network Economics, 616-622, 2009 | 16 | 2009 |
Martin HoeferProfessor of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
