MENU
Skip menu
Welcome to my website!
About me
My name is Sina Dehghani. I am a PhD student of Computer Science Deptment at the University of Maryland at College Park under the supervision of Prof. MohammadTaghi Hajiaghayi. I finished my undergraduate studies at Sharif University of Technology.
My research interests include:
- Algorithmic Game Theory
- Online Algorithms and Approximation Algorithms
- Algorithmic Graph Theory and Social Networks
You can find my resume here.
Publications
“Stochastic k-Server Problem”, ICALP 2017.
Joint work with S. Ehsani, M. Hajiaghayi, V. Liaghat, S. Seddighin.
“Faster and Simpler Algorithm for Optimal Strategies of Blotto Games”, AAAI 2017.
Joint work with S. Behnezhad, M. Derakhshan,
M. Hajiaghayi, S. Seddighin.
“Online degree bounded Steiner Network Design”, SODA 2016.
Joint work with S. Ehsani, M.
Hajiaghayi, V. Liaghat.
“From Duels to Battlefields: Computing Equilibria of Blotto and Other Games” AAAI 2016.
Joint work with A. Ahmadi, M. Hajiaghayi, B. Lucier, H. Mahini, S. Seddighin.
“Online Weighted Degree-Bounded Steiner Networks via Novel Mixed Packing/Covering”, ICALP 2016.
Joint work with S. Ehsani, M. Hajiaghayi, V. Liaghat, H. Raecke.
“Price of Competition and Dueling Games”, ICALP 2016.
Joint work with M. Hajiaghayi, H. Mahini, S. Seddighin.
“Revenue Maximization for Selling Multiple Correlated Items”, ESA 2015.
Joint work with
M. Bateni, M. Hajiaghayi, S. Seddighin.
“Forming External Behaviors by Leveraging Internal Opinions”, INFOCOM 2015.
Joint work with
A. Ahmadi, M. Hajiaghayi, H. Mahini, S.Seddighin, S. Yazdanbod.
“How Effectively Can we Form Opinions?”, WWW (Companion Volume) 2014.
Joint work with A. Ahmadi, M.Hajiaghayi, H. Mahini, S. Seddighin, S. Yazdanbod.
“Using Shortcut Edges to Maximize the Number of Triangles in Graphs”,
Operations Research Letters 2015.
Joint work with M. Fazli, J. Habibi, S. Yazdanbod.
Working papers
“Bounded and Envy-Free Chore-Division”.
Joint work with A. Farhadi, M. Hajiaghayi, H. Yami.
“Pricing the Cloud”.
Joint work with I. Kash, P. Key.
“Subcubic Equivalences Between APSP, Co-Diameter, and Other
Complementary Problems”.
Joint work with S. Ehsani, M. Hajiaghayi, S. Seddighin.
Research experiences
Summer Internship 2016,
Google, NYC.
Hosted by Xiaowei Zhang, Varun Sharma, and Hossein Bateni.
Summer Internship 2015,
Microsoft Research Ltd, Cambridge, UK.
Hosted by Ian Kash and Peter Key.
Contact
Email:
Sina.Dehghani[at]gmail.com
Address:
Dept. of Computer Science, Univ of Maryland
A.V. Williams Building, College Park, MD 20742.