Alexander Skopalik

788 total citations
26 papers, 227 citations indexed

About

Alexander Skopalik is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Alexander Skopalik has authored 26 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Management Science and Operations Research, 23 papers in Economics and Econometrics and 2 papers in Computer Networks and Communications. Recurrent topics in Alexander Skopalik's work include Game Theory and Applications (22 papers), Game Theory and Voting Systems (18 papers) and Economic theories and models (17 papers). Alexander Skopalik is often cited by papers focused on Game Theory and Applications (22 papers), Game Theory and Voting Systems (18 papers) and Economic theories and models (17 papers). Alexander Skopalik collaborates with scholars based in Germany, Netherlands and Singapore. Alexander Skopalik's co-authors include Berthold Vöcking, Vahab Mirrokni, Martin Hoefer, Baruch Awerbuch, Yossi Azar, Amir Epstein, Ioannis Caragiannis, Angelo Fanelli, Nick Gravin and Tobias Harks and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Mathematical Programming and Theory of Computing Systems.

In The Last Decade

Alexander Skopalik

24 papers receiving 221 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Alexander Skopalik Germany 9 199 145 37 23 15 26 227
Vittorio Bilò Italy 12 302 1.5× 270 1.9× 76 2.1× 17 0.7× 16 1.1× 57 378
Simina Brânzei United States 10 175 0.9× 161 1.1× 30 0.8× 32 1.4× 23 1.5× 31 257
Thomas Lücking Germany 7 129 0.6× 89 0.6× 58 1.6× 7 0.3× 22 1.5× 13 169
Gianpiero Monaco Italy 11 168 0.8× 154 1.1× 89 2.4× 15 0.7× 10 0.7× 35 300
John K. Lai United States 8 192 1.0× 162 1.1× 44 1.2× 37 1.6× 3 0.2× 11 259
Taiki Todo Japan 11 190 1.0× 157 1.1× 34 0.9× 35 1.5× 5 0.3× 31 250
Philip N. Brown United States 7 109 0.5× 47 0.3× 38 1.0× 19 0.8× 30 2.0× 50 198
Bart de Keijzer Netherlands 8 141 0.7× 105 0.7× 20 0.5× 21 0.9× 9 0.6× 28 179
Luca Moscardelli Italy 11 227 1.1× 190 1.3× 117 3.2× 16 0.7× 19 1.3× 48 392
Shao Chin Sung Japan 9 141 0.7× 162 1.1× 32 0.9× 34 1.5× 10 0.7× 21 240

Countries citing papers authored by Alexander Skopalik

Since Specialization
Citations

This map shows the geographic impact of Alexander Skopalik's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alexander Skopalik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Skopalik more than expected).

Fields of papers citing papers by Alexander Skopalik

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alexander Skopalik. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alexander Skopalik. The network helps show where Alexander Skopalik may publish in the future.

Co-authorship network of co-authors of Alexander Skopalik

This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Skopalik. A scholar is included among the top collaborators of Alexander Skopalik based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Alexander Skopalik. Alexander Skopalik is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Skopalik, Alexander, et al.. (2023). Strategic Resource Selection with Homophilic Agents. University of Twente Research Information. 2701–2709. 1 indexed citations
2.
Skopalik, Alexander, et al.. (2023). Strategic Facility Location with Clients That Minimize Total Waiting Time. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5714–5721. 2 indexed citations
3.
Skopalik, Alexander, et al.. (2019). Network Investment Games with Wardrop Followers. Research Publications (Maastricht University). 1 indexed citations
4.
Skopalik, Alexander, et al.. (2019). From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. arXiv (Cornell University). 1949–1951. 1 indexed citations
5.
Skopalik, Alexander, et al.. (2018). Analysis of Equilibria for Generalized Market Sharing Games. University of Twente Research Information. 1 indexed citations
6.
Skopalik, Alexander, et al.. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. 37(2). 620–638. 1 indexed citations
7.
Kling, Peter, et al.. (2017). Sharing is Caring. University of Twente Research Information. 123–132. 2 indexed citations
8.
Harks, Tobias, et al.. (2015). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 24(4). 2553–2562. 3 indexed citations
9.
Klimm, Max, et al.. (2014). Approximate Pure Nash Equilibria in Weighted Congestion Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 257. 3 indexed citations
10.
Hoefer, Martin & Alexander Skopalik. (2013). Altruism in Atomic Congestion Games. 1(4). 1–21. 11 indexed citations
11.
Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, & Alexander Skopalik. (2012). Approximate pure nash equilibria in weighted congestion games. DR-NTU (Nanyang Technological University). 284–301. 12 indexed citations
12.
Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, & Alexander Skopalik. (2012). Computing approximate pure Nash equilibria in congestion games. ACM SIGecom Exchanges. 11(1). 26–29. 5 indexed citations
13.
Harks, Tobias, Martin Hoefer, Max Klimm, & Alexander Skopalik. (2012). Computing pure Nash and strong equilibria in bottleneck congestion games. Mathematical Programming. 141(1-2). 193–215. 13 indexed citations
14.
Hoefer, Martin, Michal Penn, Maria Polukarov, Alexander Skopalik, & Berthold Vöcking. (2011). Considerate equilibrium. International Joint Conference on Artificial Intelligence. 234–239. 5 indexed citations
15.
Zick, Yair, Alexander Skopalik, & Edith Elkind. (2011). The Shapley value as a function of the quota in weighted voting games. International Joint Conference on Artificial Intelligence. 490–495. 12 indexed citations
16.
Hoefer, Martin & Alexander Skopalik. (2010). On the complexity of pareto-optimal nash and strong equilibria. 312–322. 10 indexed citations
17.
Mirrokni, Vahab & Alexander Skopalik. (2009). On the complexity of nash dynamics and sink equilibria. 1–10. 11 indexed citations
18.
Awerbuch, Baruch, Yossi Azar, Amir Epstein, Vahab Mirrokni, & Alexander Skopalik. (2008). Fast convergence to nearly optimal solutions in potential games. University of Twente Research Information. 264–273. 64 indexed citations
19.
Skopalik, Alexander, et al.. (2008). Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. Internet Mathematics. 5(4). 323–342. 2 indexed citations
20.
Skopalik, Alexander & Berthold Vöcking. (2008). Inapproximability of pure nash equilibria. 355–364. 48 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026