Elliot Anshelevich

2.7k total citations
57 papers, 1.2k citations indexed

About

Elliot Anshelevich is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Elliot Anshelevich has authored 57 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Management Science and Operations Research, 35 papers in Economics and Econometrics and 15 papers in Computer Networks and Communications. Recurrent topics in Elliot Anshelevich's work include Game Theory and Applications (33 papers), Game Theory and Voting Systems (32 papers) and Auction Theory and Applications (24 papers). Elliot Anshelevich is often cited by papers focused on Game Theory and Applications (33 papers), Game Theory and Voting Systems (32 papers) and Auction Theory and Applications (24 papers). Elliot Anshelevich collaborates with scholars based in United States, United Kingdom and Canada. Elliot Anshelevich's co-authors include Tom Wexler, Éva Tardos, Anirban Dasgupta, Jon Kleinberg, Tim Roughgarden, Onkar Bhardwaj, Sanmay Das, Lydia E. Kavraki, Scott Owens and Florent Lamiraux and has published in prestigious journals such as Artificial Intelligence, IEEE/ACM Transactions on Networking and SIAM Journal on Computing.

In The Last Decade

Elliot Anshelevich

52 papers receiving 1.1k citations

Peers

Elliot Anshelevich
Tomasz Michalak Poland
Brendan Lucier United States
Evangelos Markakis Greece
Nisarg Shah United States
Herbert Hamers Netherlands
Jay Sethuraman United States
Ioannis Caragiannis Greece
Julio B. Clempner Mexico
Aranyak Mehta United States
Amir Ronen Israel
Tomasz Michalak Poland
Elliot Anshelevich
Citations per year, relative to Elliot Anshelevich Elliot Anshelevich (= 1×) peers Tomasz Michalak

Countries citing papers authored by Elliot Anshelevich

Since Specialization
Citations

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

Fields of papers citing papers by Elliot Anshelevich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Elliot Anshelevich

This figure shows the co-authorship network connecting the top 25 collaborators of Elliot Anshelevich. A scholar is included among the top collaborators of Elliot Anshelevich 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 Elliot Anshelevich. Elliot Anshelevich 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.
Anshelevich, Elliot, et al.. (2025). Improved metric distortion via threshold approvals. Artificial Intelligence. 341. 104295–104295. 1 indexed citations
2.
Anshelevich, Elliot, et al.. (2023). Pricing for Efficient Traffic Exchange at IXPs. IEEE/ACM Transactions on Networking. 32(3). 2053–2068. 3 indexed citations
3.
Anshelevich, Elliot, et al.. (2023). Optimizing Multiple Simultaneous Objectives for Voting and Facility Location. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5665–5672. 1 indexed citations
4.
Anshelevich, Elliot, et al.. (2021). Representative Proxy Voting. Proceedings of the AAAI Conference on Artificial Intelligence. 35(6). 5086–5093. 1 indexed citations
5.
Kar, Koushik, et al.. (2021). Balancing Traffic Flow Efficiency with IXP Revenue in Internet Peering. 2021 IEEE Global Communications Conference (GLOBECOM). 1–6.
6.
Anshelevich, Elliot, et al.. (2021). Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. 9(2). 1–24. 7 indexed citations
7.
Anshelevich, Elliot, et al.. (2018). Approximating optimal social choice under metric preferences. Artificial Intelligence. 264. 27–51. 46 indexed citations
8.
Anshelevich, Elliot, et al.. (2017). Balancing social utility with aggregator profit in electric vehicle charging. 25. 369–374. 3 indexed citations
9.
Anshelevich, Elliot, et al.. (2017). Envy-Free Pricing in Large Markets. 5(3). 1–42. 4 indexed citations
10.
Anshelevich, Elliot, Onkar Bhardwaj, & Martin Hoefer. (2016). Stable Matching with Network Externalities. Algorithmica. 78(3). 1067–1106. 2 indexed citations
11.
Anshelevich, Elliot, et al.. (2013). Capacity Allocation Games for Network-Coded Multicast Streaming. IEEE/ACM Transactions on Networking. 22(2). 595–607. 4 indexed citations
12.
Anshelevich, Elliot, et al.. (2012). On the social welfare of mechanisms for repeated batch matching. Adaptive Agents and Multi-Agents Systems. 1321–1322. 12 indexed citations
13.
Bhaskar, Umang, Lisa Fleischer, & Elliot Anshelevich. (2011). A Stackelberg strategy for routing flow over time. arXiv (Cornell University). 92. 192–201. 2 indexed citations
14.
Anshelevich, Elliot, et al.. (2011). Exact and approximate equilibria for optimal group network formation. Theoretical Computer Science. 412(39). 5298–5314. 7 indexed citations
15.
Anshelevich, Elliot, et al.. (2011). Price of Stability in Survivable Network Design. Theory of Computing Systems. 49(1). 98–138. 7 indexed citations
16.
Anshelevich, Elliot & Sanmay Das. (2010). Matching, cardinal utility, and social welfare. ACM SIGecom Exchanges. 9(1). 1–7. 10 indexed citations
17.
Anshelevich, Elliot, et al.. (2010). Partition equilibrium always exists in resource selection games. 42–53. 1 indexed citations
18.
Anshelevich, Elliot, Anirban Dasgupta, Éva Tardos, & Tom Wexler. (2008). . Theory of Computing. 4(1). 77–109. 63 indexed citations
19.
Anshelevich, Elliot, Anirban Dasgupta, Jon Kleinberg, et al.. (2004). The Price of Stability for Network Design with Fair Cost Allocation. 295–304. 247 indexed citations
20.
Anshelevich, Elliot, David Kempe, & Jon Kleinberg. (2002). Stability of load balancing algorithms in dynamic adversarial systems. 2 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

Breakdown of academic impact, for papers by Tomasz Michalak Breakdown of academic impact, for papers by Brendan Lucier Breakdown of academic impact, for papers by Evangelos Markakis Breakdown of academic impact, for papers by Nisarg Shah Breakdown of academic impact, for papers by Herbert Hamers Breakdown of academic impact, for papers by Jay Sethuraman Breakdown of academic impact, for papers by Ioannis Caragiannis Breakdown of academic impact, for papers by Julio B. Clempner Breakdown of academic impact, for papers by Aranyak Mehta Breakdown of academic impact, for papers by Amir Ronen
Rankless by CCL
2026