| Approximability of the firefighter problem: Computing cuts over time E Anshelevich, D Chakrabarty, A Hate, C Swamy Algorithmica 62 (1), 520-536, 2012 | 45 | 2012 |
| 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 | 45 | 2009 |
| Seeding influential nodes in non-submodular models of information diffusion E Anshelevich, A Hate, M Magdon-Ismail Autonomous Agents and Multi-Agent Systems 29, 131-159, 2015 | 16 | 2015 |
| Partition equilibrium always exists in resource selection games E Anshelevich, B Caskurlu, A Hate Theory of Computing Systems 53, 73-85, 2013 | 9 | 2013 |
| Strategic pricing in next-hop routing with elastic demands E Anshelevich, A Hate, K Kar Theory of Computing Systems 54 (3), 407-430, 2014 | 5 | 2014 |
| Strategic multiway cut and multicut games E Anshelevich, B Caskurlu, A Hate Theory of Computing Systems 52 (2), 200-220, 2013 | 4 | 2013 |
| Partition equilibrium always exists in resource selection games E Anshelevich, B Caskurlu, A Hate Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens …, 2010 | 4 | 2010 |
| Stable and efficient pricing for inter-domain traffic forwarding E Anshelevich, A Hate, K Kar, M Usher Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international …, 2012 | 3 | 2012 |
| Optimizing diffusion and pricing in networks of independent agents A Hate Rensselaer Polytechnic Institute, 2012 | | 2012 |
| Pricing and Forwarding Games for Inter-domain Routing A Hate, E Anshelevich, K Kar, M Usher | | |
Elliot AnshelevichProfessor of Computer Science, Rensselaer Polytechnic InstituteVerified email at cs.rpi.edu
