| The price of stability for network design with fair cost allocation E Anshelevich, A Dasgupta, J Kleinberg, E Tardos, T Wexler, ... SIAM Journal on Computing 38 (4), 1602-1623, 2008 | 979 | 2008 |
| Near-optimal network design with selfish agents E Anshelevich, A Dasgupta, E Tardos, T Wexler Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 280 | 2003 |
| Approximating optimal social choice under metric preferences E Anshelevich, O Bhardwaj, E Elkind, J Postl, P Skowron Artificial Intelligence 264, 27-51, 2018 | 84 | 2018 |
| Deformable volumes in path planning applications E Anshelevich, S Owens, F Lamiraux, LE Kavraki Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference …, 2000 | 82 | 2000 |
| Randomized social choice functions under metric preferences E Anshelevich, J Postl Journal of Artificial Intelligence Research 58, 797-827, 2017 | 72 | 2017 |
| Near-optimal network design with selfish agents E Anshelevich, A Dasgupta, É Tardos, T Wexler Theory of Computing 4 (1), 77-109, 2008 | 68 | 2008 |
| Stability of load balancing algorithms in dynamic adversarial systems E Anshelevich, D Kempe, J Kleinberg Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 58* | 2002 |
| Strategic network formation through peering and service agreements E Anshelevich, FB Shepherd, G Wilfong Games and Economic Behavior 73 (1), 17-38, 2011 | 55* | 2011 |
| Anarchy, stability, and utopia: creating better matchings E Anshelevich, S Das, Y Naamad Autonomous Agents and Multi-Agent Systems 26 (1), 120-140, 2013 | 49 | 2013 |
| Contribution Games in Networks E Anshelevich, M Hoefer Algorithmica, 1-40, 2011 | 45* | 2011 |
| Terminal backup, 3D matching, and covering cubic graphs E Anshelevich, A Karagiozova SIAM Journal on Computing 40 (3), 678-708, 2011 | 40* | 2011 |
| A Stackelberg strategy for routing flow over time U Bhaskar, L Fleischer, E Anshelevich Games and Economic Behavior 92, 232-247, 2015 | 39 | 2015 |
| Equilibria in dynamic selfish routing E Anshelevich, S Ukkusuri International Symposium on Algorithmic Game Theory, 171-182, 2009 | 38 | 2009 |
| Blind, greedy, and random: Algorithms for matching and clustering using only ordinal information E Anshelevich, S Sekar Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 36 | 2016 |
| Approximability of the firefighter problem E Anshelevich, D Chakrabarty, A Hate, C Swamy Algorithmica 62 (1-2), 520-536, 2012 | 36 | 2012 |
| Approximation algorithms for the firefighter problem: Cuts over time and submodularity E Anshelevich, D Chakrabarty, A Hate, C Swamy International Symposium on Algorithms and Computation, 974-983, 2009 | 35 | 2009 |
| Vote until two of you agree: Mechanisms with small distortion and sample complexity S Gross, E Anshelevich, L Xia Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 34 | 2017 |
| Friendship and stable matching E Anshelevich, O Bhardwaj, M Hoefer European symposium on algorithms, 49-60, 2013 | 31* | 2013 |
| Matching, cardinal utility, and social welfare E Anshelevich, S Das ACM SIGECom Exchanges 9 (1), 1-7, 2010 | 25 | 2010 |
| Anarchy, stability, and utopia: Creating better matchings E Anshelevich, S Das, Y Naamad International Symposium on Algorithmic Game Theory, 159-170, 2009 | 24 | 2009 |
