Follow
Sina Dehghani
Sina Dehghani
PhD student of computer science, University of Maryland
Verified email at umd.edu - Homepage
Title
Cited by
Cited by
Year
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
762019
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
562017
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
422018
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
352015
Stochastic k-server: How should Uber work?
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
arXiv preprint arXiv:1705.05755, 2017
342017
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
122018
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
112014
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
92016
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
82015
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
72017
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
62015
Fast and simple solutions of Blotto games
S Behnezhad, S Dehghani, M Derakhshan, M Hajiaghayi, S Seddighin
Operations Research 71 (2), 506-516, 2023
52023
Price of competition and dueling games
S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin
arXiv preprint arXiv:1605.04004, 2016
52016
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
32019
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
12021
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
The system can't perform the operation now. Try again later.
Articles 1–20