Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Dehghani, Sina"'
Autor:
Boroujeni, Mahdi, Dehghani, Sina, Ehsani, Soheil, HajiAghayi, MohammadTaghi, Seddighin, Saeed
Despite persistent efforts, there is no known technique for obtaining unconditional super-linear lower bounds for the computational complexity of the problems in P. Vassilevska Williams and Williams introduce a fruitful approach to advance a better u
Externí odkaz:
http://arxiv.org/abs/1905.08127
In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are serving an online sequence of t requests in a metric. In the stochastic set
Externí odkaz:
http://arxiv.org/abs/1705.05755
Autor:
Dehghani, Sina, Ehsani, Soheil, Hajiaghayi, MohammadTaghi, Liaghat, Vahid, Racke, Harald, Seddighin, Saeed
Publikováno v:
Dehghani, Sina, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Racke, and Saeed Seddighin. "Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering." ICALP 2016
We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest(EW-DB-SF) problem and its generalized variant. We obtain our result by demonstrating a new generic approach for solving m
Externí odkaz:
http://arxiv.org/abs/1704.05811
Autor:
Behnezhad, Soheil, Dehghani, Sina, Derakhshan, Mahsa, HajiAghayi, MohammadTaghi, Seddighin, Saeed
In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The
Externí odkaz:
http://arxiv.org/abs/1612.04029
We study competition in a general framework introduced by Immorlica et al. and answer their main open question. Immorlica et al. considered classic optimization problems in terms of competition and introduced a general class of games called dueling g
Externí odkaz:
http://arxiv.org/abs/1605.04004
Autor:
Ahmadinejad, AmirMahdi, Dehghani, Sina, Hajiaghayi, MohammadTaghi, Lucier, Brendan, Mahini, Hamid, Seddighin, Saeed
We study the problem of computing Nash equilibria of zero-sum games. Many natural zero-sum games have exponentially many strategies, but highly structured payoffs. For example, in the well-studied Colonel Blotto game (introduced by Borel in 1921), pl
Externí odkaz:
http://arxiv.org/abs/1603.00119
We study the problem of selling $n$ items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally, the goal i
Externí odkaz:
http://arxiv.org/abs/1412.3187
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ahmadinejad, AmirMahdi1 (AUTHOR), Dehghani, Sina2 (AUTHOR), Hajiaghayi, MohammadTaghi2 (AUTHOR), Lucier, Brendan3 (AUTHOR), Mahini, Hamid4 (AUTHOR), Seddighin, Saeed2 (AUTHOR)
Publikováno v:
Mathematics of Operations Research. Nov2019, Vol. 44 Issue 4, p1304-1325. 22p.
