Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ameya Hate
@article{DBLP:journals/aamas/AnshelevichHM15,
author = {Elliot Anshelevich and
Ameya Hate and
Malik Magdon{-}Ismail},
title = {Seeding influential nodes in non-submodular models of information
diffusion},
journal = {Auton. Agents Multi Agent Syst.},
volume = {29},
number = {1},
pages = {131--159},
year = {2015},
url = {https://doi.org/10.1007/s10458-014-9254-4},
doi = {10.1007/S10458-014-9254-4},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/AnshelevichHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AnshelevichHK14,
author = {Elliot Anshelevich and
Ameya Hate and
Koushik Kar},
title = {Strategic Pricing in Next-Hop Routing with Elastic Demands},
journal = {Theory Comput. Syst.},
volume = {54},
number = {3},
pages = {407--430},
year = {2014},
url = {https://doi.org/10.1007/s00224-012-9435-y},
doi = {10.1007/S00224-012-9435-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AnshelevichCH13,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu and
Ameya Hate},
title = {Strategic Multiway Cut and Multicut Games},
journal = {Theory Comput. Syst.},
volume = {52},
number = {2},
pages = {200--220},
year = {2013},
url = {https://doi.org/10.1007/s00224-011-9380-1},
doi = {10.1007/S00224-011-9380-1},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichCH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AnshelevichCH13a,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu and
Ameya Hate},
title = {Partition Equilibrium Always Exists in Resource Selection Games},
journal = {Theory Comput. Syst.},
volume = {53},
number = {1},
pages = {73--85},
year = {2013},
url = {https://doi.org/10.1007/s00224-013-9463-2},
doi = {10.1007/S00224-013-9463-2},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichCH13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/AnshelevichHM13,
author = {Elliot Anshelevich and
Ameya Hate and
Malik Magdon{-}Ismail},
editor = {Maria L. Gini and
Onn Shehory and
Takayuki Ito and
Catholijn M. Jonker},
title = {Seeding influential nodes in non-submodular models of information
diffusion},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '13, Saint Paul, MN, USA, May 6-10, 2013},
pages = {1305--1306},
publisher = {{IFAAMAS}},
year = {2013},
url = {http://dl.acm.org/citation.cfm?id=2485196},
timestamp = {Thu, 09 Sep 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/atal/AnshelevichHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-5455,
author = {Elliot Anshelevich and
Ameya Hate and
Malik Magdon{-}Ismail},
title = {Seeding Influential Nodes in Non-Submodular Models of Information
Diffusion},
journal = {CoRR},
volume = {abs/1302.5455},
year = {2013},
url = {http://arxiv.org/abs/1302.5455},
eprinttype = {arXiv},
eprint = {1302.5455},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-5455.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Hate12,
author = {Ameya Hate},
title = {Optimizing diffusion and pricing in networks of independent agents},
school = {Rensselaer Polytechnic Institute, {USA}},
year = {2012},
url = {https://hdl.handle.net/20.500.13015/3565},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Hate12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnshelevichCHS12,
author = {Elliot Anshelevich and
Deeparnab Chakrabarty and
Ameya Hate and
Chaitanya Swamy},
title = {Approximability of the Firefighter Problem - Computing Cuts over Time},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {520--536},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9469-y},
doi = {10.1007/S00453-010-9469-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnshelevichCHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/AnshelevichHKU12,
author = {Elliot Anshelevich and
Ameya Hate and
Koushik Kar and
Michael Usher},
editor = {Peter G. Harrison and
Martin F. Arlitt and
Giuliano Casale},
title = {Stable and efficient pricing for inter-domain traffic forwarding},
booktitle = {{ACM} {SIGMETRICS/PERFORMANCE} Joint International Conference on Measurement
and Modeling of Computer Systems, {SIGMETRICS} '12, London, United
Kingdom, June 11-15, 2012},
pages = {381--382},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2254756.2254803},
doi = {10.1145/2254756.2254803},
timestamp = {Fri, 30 Jul 2021 16:13:32 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/AnshelevichHKU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AnshelevichHK11,
author = {Elliot Anshelevich and
Ameya Hate and
Koushik Kar},
editor = {Giuseppe Persiano},
title = {Strategic Pricing in Next-Hop Routing with Elastic Demands},
booktitle = {Algorithmic Game Theory, 4th International Symposium, {SAGT} 2011,
Amalfi, Italy, October 17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6982},
pages = {278--289},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24829-0\_25},
doi = {10.1007/978-3-642-24829-0\_25},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/AnshelevichHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AnshelevichCH10,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu and
Ameya Hate},
editor = {Spyros C. Kontogiannis and
Elias Koutsoupias and
Paul G. Spirakis},
title = {Partition Equilibrium Always Exists in Resource Selection Games},
booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
Athens, Greece, October 18-20, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6386},
pages = {42--53},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16170-4\_5},
doi = {10.1007/978-3-642-16170-4\_5},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sagt/AnshelevichCH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AnshelevichCH10,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu and
Ameya Hate},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Strategic Multiway Cut and Multicut Games},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {1--12},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_1},
doi = {10.1007/978-3-642-18318-8\_1},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/AnshelevichCH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AnshelevichCHS09,
author = {Elliot Anshelevich and
Deeparnab Chakrabarty and
Ameya Hate and
Chaitanya Swamy},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Approximation Algorithms for the Firefighter Problem: Cuts over Time
and Submodularity},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {974--983},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_98},
doi = {10.1007/978-3-642-10631-6\_98},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AnshelevichCHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-27 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
