Dr. Ameya Hate
Title
Cited by
Cited by
Year
Approximability of the firefighter problem
E Anshelevich, D Chakrabarty, A Hate, C Swamy
Algorithmica 62 (1), 520-536, 2012
372012
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
342009
Seeding influential nodes in non-submodular models of information diffusion
E Anshelevich, A Hate, M Magdon-Ismail
Autonomous Agents and Multi-Agent Systems 29 (1), 131-159, 2015
132015
Partition equilibrium always exists in resource selection games
E Anshelevich, B Caskurlu, A Hate
Theory of Computing Systems 53 (1), 73-85, 2013
62013
Strategic pricing in next-hop routing with elastic demands
E Anshelevich, A Hate, K Kar
Theory of Computing Systems 54 (3), 407-430, 2014
52014
Strategic multiway cut and multicut games
E Anshelevich, B Caskurlu, A Hate
Theory of Computing Systems 52 (2), 200-220, 2013
42013
Partition equilibrium always exists in resource selection games
E Anshelevich, B Caskurlu, A Hate
International Symposium on Algorithmic Game Theory, 42-53, 2010
42010
Approximability of the firefighter problem: Computing cuts over time
E Anshelevich, D Chakrabarty, A Hate, C Swamy
Proceedings of the 20th International Symposium on Algorithms and …, 2009
42009
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
32012
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
The system can't perform the operation now. Try again later.
Articles 1–11