How effectively can we form opinions? - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Hamid Mahini; Saeed Seddighin; Sadra Yazdanbod (WWW (Companion Volume), 2014)

Revenue Maximization for Selling Multiple Correlated Items. - MohammadHossein Bateni; Sina Dehghani; MohammadTaghi Hajiaghayi; Saeed Seddighin (ESA, 2015)

Forming external behaviors by leveraging internal opinions. - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Hamid Mahini; Saeed Seddighin; Sadra Yazdanbod (INFOCOM, 2015)

Using shortcut edges to maximize the number of triangles in graphs. - Sina Dehghani; MohammadAmin Fazli; Jafar Habibi; Sadra Yazdanbod (Oper. Res. Lett., 2015)

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. - Sina Dehghani; Soheil Ehsani; Mohammad Taghi Hajiaghayi; Vahid Liaghat; Harald Räcke; Saeed Seddighin (ICALP, 2016)

Price of Competition and Dueling Games. - Sina Dehghani; Mohammad Taghi Hajiaghayi; Hamid Mahini; Saeed Seddighin (ICALP, 2016)

Online Degree-Bounded Steiner Network Design. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat (SODA, 2016)

From Duels to Battefields: Computing Equilibria of Blotto and Other Games. - Mahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Brendan Lucier; Hamid Mahini; Saeed Seddighin (CoRR, 2016)

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (AAAI, 2017)

Stochastic k-Server: How Should Uber Work?. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Saeed Seddighin (ICALP, 2017)

Online Degree-Bounded Steiner Network Design. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Harald Räcke (CoRR, 2017)

Online Network Design under Uncertainty. - Sina Dehghani (2017)

Greedy Algorithms for Online Survivable Network Design. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Saeed Seddighin (ICALP, 2018)

Envy-free Chore Division for An Arbitrary Number of Agents. - Sina Dehghani; Alireza Farhadi 001; Mohammad Taghi Hajiaghayi; Hadi Yami (SODA, 2018)

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems. - Mahdi Boroujeni; Sina Dehghani; Soheil Ehsani; Mohammad Taghi Hajiaghayi; Saeed Seddighin (CoRR, 2019)

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Brendan Lucier; Hamid Mahini; Saeed Seddighin (Math. Oper. Res., 2019)

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. - Sina Dehghani; Hamed Saleh; Saeed Seddighin; Shang-Hua Teng (AAAI, 2021)

Fast and Simple Solutions of Blotto Games. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (Oper. Res., 2023)