Alexander Skopalik

Citado por

	Total	Desde 2019
Citas	935	342
Índice h	17	11
Índice i10	23	12

2008200920102011201220132014201520162017201820192020202120222023202411 36 32 38 49 63 71 89 57 76 57 73 40 52 62 80 35

Acceso público

Ver todo

23 artículos

2 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Martin HoeferProfessor of Computer Science, Goethe University Frankfurt/MainDirección de correo verificada de em.uni-frankfurt.de
Dr. Matthias FeldottoPaderborn UniversityDirección de correo verificada de uni-paderborn.de
Angelo FanelliCNRSDirección de correo verificada de unicaen.fr
Ioannis CaragiannisProfessor of Computer Science, Aarhus UniversityDirección de correo verificada de cs.au.dk
Nick GravinITCS, Shanghai University of Finance and EconomicsDirección de correo verificada de microsoft.com
Max KlimmTU BerlinDirección de correo verificada de tu-berlin.de
Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityDirección de correo verificada de cs.rwth-aachen.de
Vahab MirrokniGoogle Fellow, VP, Google ResearchDirección de correo verificada de google.com
Sören RiechersHeinz-Nixdorf-Institute, University of PaderbornDirección de correo verificada de uni-paderborn.de
Pascal LenznerResearcher, HPI PotsdamDirección de correo verificada de hpi.de
Tobias HarksProfessor of Mathematical Optimization, University of PassauDirección de correo verificada de uni-passau.de
Martin GairingDepartment of Computer Science, University of LiverpoolDirección de correo verificada de liverpool.ac.uk
Amir EpsteinIBM Research - HaifaDirección de correo verificada de il.ibm.com
Heiner AckermannFraunhofer ITWMDirección de correo verificada de itwm.fraunhofer.de
Grammateia KotsialouLondon School of Economics and Political ScienceDirección de correo verificada de lse.ac.uk
Peter KlingUniversity of HamburgDirección de correo verificada de uni-hamburg.de
Alexander MäckerPaderborn UniversityDirección de correo verificada de mail.upb.de
Yair ZickUniversity of Massachusetts, AmherstDirección de correo verificada de umass.edu
Edith ElkindUniversity of OxfordDirección de correo verificada de cs.ox.ac.uk
Maria PolukarovDepartment of Informatics, King's College LondonDirección de correo verificada de kcl.ac.uk

Seguir

Alexander Skopalik

University of Twente

Dirección de correo verificada de utwente.nl


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	135	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	130	2008
Altruism in atomic congestion games M Hoefer, A Skopalik ACM Transactions on Economics and Computation (TEAC) 1 (4), 1-21, 2013	71	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	56	2015
Taxing subnetworks M Hoefer, L Olbrich, A Skopalik International workshop on internet and network economics, 286-294, 2008	37	2008
The Shapley value as a function of the quota in weighted voting games Y Zick, A Skopalik, E Elkind IJCAI 11, 490-495, 2011	33	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	20	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
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	17	2017
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
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
Improving approximate pure nash equilibria in congestion games V Ravindran Vijayalakshmi, A Skopalik International Conference on Web and Internet Economics, 280-294, 2020	15*	2020
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	15	2017

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores