Obserwuj
Alexander Skopalik
Alexander Skopalik
Zweryfikowany adres z utwente.nl
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1232008
Inapproximability of pure Nash equilibria
A Skopalik, B Vöcking
Proceedings of the fortieth annual ACM symposium on Theory of computing, 355-364, 2008
1232008
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
562011
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
452015
Altruism in atomic congestion games
M Hoefer, A Skopalik
European Symposium on Algorithms, 179-189, 2009
452009
Taxing subnetworks
M Hoefer, L Olbrich, A Skopalik
International workshop on internet and network economics, 286-294, 2008
322008
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
312011
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
312007
Computing pure nash and strong equilibria in bottleneck congestion games
T Harks, M Hoefer, M Klimm, A Skopalik
Mathematical Programming 141 (1), 193-215, 2013
282013
Computing pure Nash and strong equilibria in bottleneck congestion games
T Harks, M Hoefer, M Klimm, A Skopalik
European Symposium on Algorithms, 29-38, 2010
282010
Altruism in atomic congestion games
M Hoefer, A Skopalik
ACM Transactions on Economics and Computation (TEAC) 1 (4), 1-21, 2013
242013
Considerate equilibrium
M Hoefer, M Penn, M Polukarov, A Skopalik, B Vöcking
Proceedings of the Twenty-Second international joint conference on …, 2010
222010
Approximate pure Nash equilibria in weighted congestion games
C Hansknecht, M Klimm, A Skopalik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
212014
On the complexity of Pareto-optimal Nash and strong equilibria
M Hoefer, A Skopalik
International Symposium on Algorithmic Game Theory, 312-322, 2010
182010
Social context in potential games
M Hoefer, A Skopalik
International Workshop on Internet and Network Economics, 364-377, 2012
172012
Stability and convergence in selfish scheduling with altruistic agents
M Hoefer, A Skopalik
International Workshop on Internet and Network Economics, 616-622, 2009
162009
Complexity of pure Nash equilibria in player-specific network congestion games
H Ackermann, A Skopalik
Internet Mathematics 5 (4), 323-342, 2008
162008
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
152009
Computing approximate pure nash equilibria in shapley value weighted congestion games
M Feldotto, M Gairing, G Kotsialou, A Skopalik
International Conference on Web and Internet Economics, 191-204, 2017
122017
On the impact of fair best response dynamics
A Fanelli, L Moscardelli, A Skopalik
International Symposium on Mathematical Foundations of Computer Science, 360-371, 2012
102012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20