Follow
Alexander Skopalik
Alexander Skopalik
Verified email at utwente.nl
Title
Cited by
Cited by
Year
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
1252008
Inapproximability of pure Nash equilibria
A Skopalik, B Vöcking
Proceedings of the fortieth annual ACM symposium on Theory of computing, 355-364, 2008
1222008
Altruism in atomic congestion games
M Hoefer, A Skopalik
ACM Transactions on Economics and Computation (TEAC) 1 (4), 1-21, 2013
702013
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
592011
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
462015
The Shapley value as a function of the quota in weighted voting games
Y Zick, A Skopalik, E Elkind
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
322011
Taxing subnetworks
M Hoefer, L Olbrich, A Skopalik
Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008
322008
On the complexity of pure Nash equilibria in player-specific network congestion games
H Ackermann, A Skopalik
Internet and Network Economics: Third International Workshop, WINE 2007, San …, 2007
302007
Computing pure nash and strong equilibria in bottleneck congestion games
T Harks, M Hoefer, M Klimm, A Skopalik
Mathematical Programming 141, 193-215, 2013
282013
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
272010
Considerate equilibrium
M Hoefer, M Penn, M Polukarov, A Skopalik, B Vöcking
Proceedings of the Twenty-Second international joint conference on …, 2010
242010
Approximate pure Nash equilibria in weighted congestion games
C Hansknecht, M Klimm, A Skopalik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
222014
On the complexity of Pareto-optimal Nash and strong equilibria
M Hoefer, A Skopalik
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens …, 2010
182010
Social context in potential games
M Hoefer, A Skopalik
Internet and Network Economics: 8th International Workshop, WINE 2012 …, 2012
172012
Stability and Convergence in Selfish Scheduling with Altruistic Agents.
M Hoefer, A Skopalik
WINE 9, 616-622, 2009
162009
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
162009
Complexity of pure Nash equilibria in player-specific network congestion games
H Ackermann, A Skopalik
Internet Mathematics 5 (4), 323-342, 2008
152008
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
142017
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
102017
On the impact of fair best response dynamics
A Fanelli, L Moscardelli, A Skopalik
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
102012
The system can't perform the operation now. Try again later.
Articles 1–20