Ameya Hate

According to our database, Ameya Hate authored at least 8 papers between 2009 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2013

Seeding influential nodes in non-submodular models of information diffusion.

Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Optimizing diffusion and pricing in networks of independent agents.

Ameya Hate

PhD thesis, 2012

Approximability of the Firefighter Problem - Computing Cuts over Time.

Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy

Algorithmica, 2012

Stable and efficient pricing for inter-domain traffic forwarding.

Elliot Anshelevich, Ameya Hate, Koushik Kar, Michael Usher

Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012

2011

Strategic Pricing in Next-Hop Routing with Elastic Demands.

Elliot Anshelevich, Ameya Hate, Koushik Kar

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Strategic Multiway Cut and Multicut Games.

Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Partition Equilibrium Always Exists in Resource Selection Games.

Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.

Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009