Follow
Elliot Anshelevich
Elliot Anshelevich
Professor of Computer Science, Rensselaer Polytechnic Institute
Verified email at cs.rpi.edu - Homepage
Title
Cited by
Cited by
Year
The price of stability for network design with fair cost allocation
E Anshelevich, A Dasgupta, J Kleinberg, … Tardos, T Wexler, ...
SIAM Journal on Computing 38 (4), 1602-1623, 2008
11122008
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
2852003
Approximating optimal social choice under metric preferences
E Anshelevich, O Bhardwaj, E Elkind, J Postl, P Skowron
Artificial Intelligence 264, 27-51, 2018
1462018
Randomized social choice functions under metric preferences
E Anshelevich, J Postl
Journal of Artificial Intelligence Research 58, 797-827, 2017
1202017
Deformable volumes in path planning applications
E Anshelevich, S Owens, F Lamiraux, LE Kavraki
Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference†…, 2000
922000
Near-optimal network design with selfish agents
E Anshelevich, A Dasgupta, … Tardos, T Wexler
Theory of Computing 4 (1), 77-109, 2008
802008
Distortion in social choice problems: The first 15 years and beyond
E Anshelevich, A Filos-Ratsikas, N Shah, AA Voudouris
arXiv preprint arXiv:2103.00911, 2021
662021
A Stackelberg strategy for routing flow over time
U Bhaskar, L Fleischer, E Anshelevich
Games and Economic Behavior 92, 232-247, 2015
622015
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
62*2002
Anarchy, stability, and utopia: creating better matchings
E Anshelevich, S Das, Y Naamad
Autonomous Agents and Multi-Agent Systems 26 (1), 120-140, 2013
602013
Strategic network formation through peering and service agreements
E Anshelevich, FB Shepherd, G Wilfong
Games and Economic Behavior 73 (1), 17-38, 2011
58*2011
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
542017
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
492016
Contribution Games in Networks
E Anshelevich, M Hoefer
Algorithmica, 1-40, 2011
47*2011
Equilibria in dynamic selfish routing
E Anshelevich, S Ukkusuri
International Symposium on Algorithmic Game Theory, 171-182, 2009
462009
Approximability of the firefighter problem: Computing cuts over time
E Anshelevich, D Chakrabarty, A Hate, C Swamy
Algorithmica 62 (1-2), 520-536, 2012
452012
Approximation algorithms for the firefighter problem: Cuts over time and submodularity
E Anshelevich, D Chakrabarty, A Hate, C Swamy
Algorithms and Computation: 20th International Symposium, ISAAC 2009†…, 2009
452009
Terminal backup, 3D matching, and covering cubic graphs
E Anshelevich, A Karagiozova
SIAM Journal on Computing 40 (3), 678-708, 2011
42*2011
Friendship and stable matching
E Anshelevich, O Bhardwaj, M Hoefer
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis†…, 2013
31*2013
Ordinal approximation for social choice, matching, and facility location problems given candidate positions
E Anshelevich, W Zhu
ACM Transactions on Economics and Computation (TEAC) 9 (2), 1-24, 2021
302021
The system can't perform the operation now. Try again later.
Articles 1–20