مقالات بحثية تمّ التفويض بإتاحتها للجميع - Sina Dehghaniمزيد من المعلومات
عدد المقالات البحثية غير المتاحة للجميع في أي موقع: 1
Fast and simple solutions of Blotto games
S Behnezhad, S Dehghani, M Derakhshan, M Hajiaghayi, S Seddighin
Operations Research 71 (2), 506-516, 2023
التفويضات: US National Science Foundation, US Department of Defense
عدد المقالات البحثية المتاحة للجميع في موقع ما: 6
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
التفويضات: US National Science Foundation, US Department of Defense
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
التفويضات: US National Science Foundation, US Department of Defense
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
التفويضات: US National Science Foundation, US Department of Defense
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
التفويضات: US National Science Foundation, US Department of Defense
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
التفويضات: US National Science Foundation
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
التفويضات: US National Science Foundation
يتم تحديد معلومات التمويل والنشر من خلال برنامج كمبيوتر تلقائيًا.