| From duels to battlefields: Computing equilibria of Blotto and other games AM Ahmadinejad, S Dehghani, MT Hajiaghayi, B Lucier, H Mahini, ... Mathematics of Operations Research 44 (4), 1304-1325, 2019 | 85 | 2019 |
| Faster and simpler algorithm for optimal strategies of Blotto game S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 63 | 2017 |
| Envy-free chore division for an arbitrary number of agents S Dehghani, A Farhadi, MT HajiAghayi, H Yami Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 49 | 2018 |
| Stochastic k-server: How should Uber work? S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin arXiv preprint arXiv:1705.05755, 2017 | 40 | 2017 |
| Revenue maximization for selling multiple correlated items MH Bateni, S Dehghani, MT Hajiaghayi, S Seddighin Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 40 | 2015 |
| Greedy algorithms for online survivable network design S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 14 | 2018 |
| How effectively can we form opinions? AM Ahmadinejad, S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin, ... Proceedings of the 23rd International Conference on World Wide Web, 213-214, 2014 | 12 | 2014 |
| Online degree-bounded steiner network design S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 11 | 2016 |
| Forming external behaviors by leveraging internal opinions AM Ahmadinejad, S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin, ... 2015 IEEE Conference on Computer Communications (INFOCOM), 1849-1857, 2015 | 10 | 2015 |
| Fast and simple solutions of Blotto games S Behnezhad, S Dehghani, M Derakhshan, M Hajiaghayi, S Seddighin Operations Research 71 (2), 506-516, 2023 | 8 | 2023 |
| Online weighted degree-bounded steiner networks via novel online mixed packing/covering S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, H Racke, S Seddighin arXiv preprint arXiv:1704.05811, 2017 | 7 | 2017 |
| Using shortcut edges to maximize the number of triangles in graphs S Dehghani, MA Fazli, J Habibi, S Yazdanbod Operations Research Letters 43 (6), 586-591, 2015 | 6 | 2015 |
| Price of competition and dueling games S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin arXiv preprint arXiv:1605.04004, 2016 | 5 | 2016 |
| Subcubic equivalences between graph centrality measures and complementary problems M Boroujeni, S Dehghani, S Ehsani, MT HajiAghayi, S Seddighin arXiv preprint arXiv:1905.08127, 2019 | 3 | 2019 |
| Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable S Dehghani, H Saleh, S Seddighin, SH Teng Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5294-5302, 2021 | 2 | 2021 |
| Online Network Design under Uncertainty S Dehghani | | 2017 |
| Online Stochastic Scheduling and Pricing the Clouds S Dehghani, IA Kash, P Key | | 2017 |
| Stochastic k-Server Problem S Dehghani, S Ehsani, MT Hajiaghayi, S Seddighin | | 2016 |
| Online Survivable Network Design and Prophets S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin | | 2015 |
| Subcubic Equivalences Between APSP, Co-Diameter, and Other Complementary Problems S Dehghani, S Ehsani, MT Hajiaghayi, S Seddighin | | |
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park在 cs.umd.edu 的电子邮件经过验证
