Luca Moscardelli

1.2k total citations
48 papers, 392 citations indexed

About

Luca Moscardelli is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Luca Moscardelli has authored 48 papers receiving a total of 392 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Management Science and Operations Research, 25 papers in Economics and Econometrics and 18 papers in Computer Networks and Communications. Recurrent topics in Luca Moscardelli's work include Game Theory and Applications (29 papers), Game Theory and Voting Systems (21 papers) and Auction Theory and Applications (17 papers). Luca Moscardelli is often cited by papers focused on Game Theory and Applications (29 papers), Game Theory and Voting Systems (21 papers) and Auction Theory and Applications (17 papers). Luca Moscardelli collaborates with scholars based in Italy, Israel and France. Luca Moscardelli's co-authors include Michele Flammini, Gianpiero Monaco, Vittorio Bilò, Angelo Fanelli, Shmuel Zaks, Mordechai Shalom, Ioannis Caragiannis, Alberto Marchetti-Spaccamela, Christos Kaklamanis and Panagiotis Kanellopoulos and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Computer Networks and Theoretical Computer Science.

In The Last Decade

Luca Moscardelli

46 papers receiving 384 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Luca Moscardelli Italy 11 227 190 117 83 54 48 392
Gianpiero Monaco Italy 11 168 0.7× 154 0.8× 89 0.8× 67 0.8× 42 0.8× 35 300
Martin Gairing United Kingdom 15 315 1.4× 215 1.1× 149 1.3× 15 0.2× 47 0.9× 35 466
Nir Andelman Israel 6 127 0.6× 72 0.4× 135 1.2× 29 0.3× 16 0.3× 6 218
Vittorio Bilò Italy 12 302 1.3× 270 1.4× 76 0.6× 9 0.1× 26 0.5× 57 378
Spyros Kontogiannis Greece 8 176 0.8× 126 0.7× 54 0.5× 15 0.2× 11 0.2× 26 259
Neil Olver Netherlands 9 83 0.4× 38 0.2× 60 0.5× 33 0.4× 34 0.6× 24 195
Alex Kesselman Israel 12 64 0.3× 43 0.2× 416 3.6× 161 1.9× 16 0.3× 33 487
Mourad Baı̈ou France 8 80 0.4× 129 0.7× 47 0.4× 28 0.3× 53 1.0× 38 259
Thomas Keßelheim Germany 12 151 0.7× 40 0.2× 342 2.9× 169 2.0× 18 0.3× 42 444
Yogeshwer Sharma United States 7 194 0.9× 31 0.2× 91 0.8× 24 0.3× 6 0.1× 7 232

Countries citing papers authored by Luca Moscardelli

Since Specialization
Citations

This map shows the geographic impact of Luca Moscardelli'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 Luca Moscardelli with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luca Moscardelli more than expected).

Fields of papers citing papers by Luca Moscardelli

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luca Moscardelli. 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 Luca Moscardelli. The network helps show where Luca Moscardelli may publish in the future.

Co-authorship network of co-authors of Luca Moscardelli

This figure shows the co-authorship network connecting the top 25 collaborators of Luca Moscardelli. A scholar is included among the top collaborators of Luca Moscardelli 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 Luca Moscardelli. Luca Moscardelli 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.
Bilò, Vittorio, et al.. (2022). Nash Social Welfare in Selfish and Online Load Balancing. 10(2). 1–41. 2 indexed citations
2.
Bilò, Vittorio, Gianpiero Monaco, & Luca Moscardelli. (2022). Hedonic Games with Fixed-Size Coalitions. Proceedings of the AAAI Conference on Artificial Intelligence. 36(9). 9287–9295. 11 indexed citations
3.
Bilò, Vittorio, Michele Flammini, Gianpiero Monaco, & Luca Moscardelli. (2022). Pricing Problems with Buyer Preselection. Journal of Artificial Intelligence Research. 74. 1791–1822. 1 indexed citations
4.
Flammini, Michele, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, & Shmuel Zaks. (2021). On the Online Coalition Structure Generation Problem. Journal of Artificial Intelligence Research. 72. 1215–1250. 6 indexed citations
5.
Flammini, Michele, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, & Shmuel Zaks. (2021). The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms. 14(5). 151–151. 2 indexed citations
6.
Monaco, Gianpiero, et al.. (2019). Local Core Stability in Simple Symmetric Fractional Hedonic Games. Adaptive Agents and Multi-Agents Systems. 574–582. 10 indexed citations
7.
Flammini, Michele, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, & Shmuel Zaks. (2018). Online Coalition Structure Generation in Graph Games. Adaptive Agents and Multi-Agents Systems. 1353–1361. 9 indexed citations
8.
Bilò, Vittorio, Michele Flammini, Gianpiero Monaco, & Luca Moscardelli. (2018). On the Impact of Buyers Preselection in Pricing Problems. Adaptive Agents and Multi-Agents Systems. 1871–1873. 3 indexed citations
9.
Bilò, Vittorio, Angelo Fanelli, & Luca Moscardelli. (2018). Opinion formation games with dynamic social influences. Theoretical Computer Science. 746. 73–87. 3 indexed citations
10.
Monaco, Gianpiero, et al.. (2018). Hedonic games with social context. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 24–35. 5 indexed citations
11.
Bilò, Vittorio, et al.. (2018). Uniform Mixed Equilibria in Network Congestion Games with Link Failures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations
12.
Bilò, Vittorio, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, & Luca Moscardelli. (2015). On the Price of Stability of Fractional Hedonic Games. Adaptive Agents and Multi-Agents Systems. 1239–1247. 18 indexed citations
13.
Bilò, Vittorio, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, & Luca Moscardelli. (2015). The price of envy-freeness in machine scheduling. Theoretical Computer Science. 613. 65–78. 4 indexed citations
14.
Bilò, Vittorio, Angelo Fanelli, & Luca Moscardelli. (2015). On lookahead equilibria in congestion games. Mathematical Structures in Computer Science. 27(2). 197–214. 1 indexed citations
15.
Caragiannis, Ioannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, & Luca Moscardelli. (2010). Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica. 61(3). 606–637. 42 indexed citations
16.
Bilò, Vittorio, Angelo Fanelli, Michele Flammini, & Luca Moscardelli. (2010). Performance of One-Round Walks in Linear Congestion Games. Theory of Computing Systems. 49(1). 24–45. 12 indexed citations
17.
Bilò, Vittorio, Angelo Fanelli, Michele Flammini, & Luca Moscardelli. (2009). When ignorance helps: Graphical multicast cost sharing games. Theoretical Computer Science. 411(3). 660–671. 12 indexed citations
18.
Flammini, Michele, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, & Shmuel Zaks. (2008). Approximating the traffic grooming problem in tree and star networks. Journal of Parallel and Distributed Computing. 68(7). 939–948. 3 indexed citations
19.
Flammini, Michele, Luca Moscardelli, Mordechai Shalom, & Shmuel Zaks. (2007). Approximating the traffic grooming problem. Journal of Discrete Algorithms. 6(3). 472–479. 4 indexed citations
20.
Fanelli, Angelo, et al.. (2006). Game Theoretical Issues in Optical Networks. 1563. 243–247. 3 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