Sina Dehghani

Orcid: 0000-0002-4625-3199

According to our database1, Sina Dehghani authored at least 18 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast and Simple Solutions of Blotto Games.
Oper. Res., March, 2023

2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.
Math. Oper. Res., 2019

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems.
CoRR, 2019

2018
Envy-free Chore Division for An Arbitrary Number of Agents.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Greedy Algorithms for Online Survivable Network Design.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Online Network Design under Uncertainty.
PhD thesis, 2017

Online Degree-Bounded Steiner Network Design.
CoRR, 2017

Stochastic k-Server: How Should Uber Work?.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
From Duels to Battefields: Computing Equilibria of Blotto and Other Games.
CoRR, 2016

Online Degree-Bounded Steiner Network Design.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Price of Competition and Dueling Games.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Using shortcut edges to maximize the number of triangles in graphs.
Oper. Res. Lett., 2015

Forming external behaviors by leveraging internal opinions.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Revenue Maximization for Selling Multiple Correlated Items.
Proceedings of the Algorithms - ESA 2015, 2015

2014
How effectively can we form opinions?
Proceedings of the 23rd International World Wide Web Conference, 2014


  Loading...