Saeed Seddighin
Saeed Seddighin
Email verificata su cs.umd.edu - Home page
TitoloCitata daAnno
Fair allocation of indivisible goods: Improvements and generalizations
M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami
Proceedings of the 2018 ACM Conference on Economics and Computation, 539-556, 2018
402018
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
AM Ahmadinejad, S Dehghani, MT Hajiaghay, B Lucier, H Mahini, ...
Thirtieth AAAI Conference on Artificial Intelligence, 2016
322016
Approximating edit distance in truly subquadratic time: Quantum and MapReduce
M Boroujeni, S Ehsani, M Ghodsi, MT HajiAghayi, S Seddighin
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
212018
Revenue Maximization for Selling Multiple Correlated Items. arxiv report, 2015
M Bateni, S Dehghani, M Hajiaghayi, S Seddighin
21*
Faster and simpler algorithm for optimal strategies of Blotto game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
Thirty-First AAAI Conference on Artificial Intelligence, 2017
202017
Fair allocation of indivisible goods to asymmetric agents
A Farhadi, M Ghodsi, MT Hajiaghayi, S Lahaie, D Pennock, M Seddighin, ...
Journal of Artificial Intelligence Research 64, 1-20, 2019
182019
Stochastic k-Server: How Should Uber Work?
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
arXiv preprint arXiv:1705.05755, 2017
14*2017
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
8*2015
Covering Orthogonal Polygons with Sliding k-Transmitters.
SS Mahdavi, S Seddighin, M Ghodsi
CCCG, 2014
8*2014
From battlefields to elections: Winning strategies of blotto and auditing games
S Behnezhad, A Blum, M Derakhshan, MT HajiAghayi, M Mahdian, ...
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
72018
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
RH Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
International Symposium on Parameterized and Exact Computation, 159-171, 2014
72014
Massively parallel approximation algorithms for edit distance and longest common subsequence
MT Hajiaghayi, S Seddighin, X Sun
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
62019
Spatio-Temporal Games Beyond One Dimension
S Behnezhad, M Derakhshan, M Hajiaghayi, S Seddighin
Proceedings of the 2018 ACM Conference on Economics and Computation, 411-428, 2018
52018
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
52017
Fast algorithms for knapsack via convolution and prediction
MH Bateni, MT Hajiaghayi, S Seddighin, C Stein
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
42018
Optimal Strategies of Blotto Games: Beyond Convexity
S Behnezhad, A Blum, M Derakhshan, MT Hajiaghayi, CH Papadimitriou, ...
arXiv preprint arXiv:1901.04153, 2019
32019
Approximating LCS in linear time: beating the [MATH HERE] barrier
MT Hajiaghayi, M Seddighin, S Seddighin, X Sun
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
32019
Price of Competition and Dueling Games
S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin
arXiv preprint arXiv:1605.04004, 2016
32016
A study of compact reserve pricing languages
MH Bateni, H Esfandiary, V Mirrokni, S Seddighin
Thirty-First AAAI Conference on Artificial Intelligence, 2017
22017
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond
MT Hajiaghayi, S Lattanzi, S Seddighin, C Stein
arXiv preprint arXiv:1905.01748, 2019
12019
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20