Seuraa
Sadra Yazdanbod
Sadra Yazdanbod
Vahvistettu sähköpostiosoite verkkotunnuksessa google.com - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Convex program duality, Fisher markets, and Nash social welfare
R Cole, N Devanur, V Gkatzelis, K Jain, T Mai, VV Vazirani, S Yazdanbod
Proceedings of the 2017 ACM Conference on Economics and Computation, 459-460, 2017
1402017
∃ r-completeness for decision versions of multi-player (symmetric) nash equilibria
J Garg, R Mehta, VV Vazirani, S Yazdanbod
ACM Transactions on Economics and Computation (TEAC) 6 (1), 1-23, 2018
472018
Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
J Garg, R Mehta, VV Vazirani, S Yazdanbod
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
302017
The minimum vulnerability problem
S Assadi, E Emamjomeh-Zadeh, A Norouzi-Fard, S Yazdanbod, ...
Algorithmica 70 (4), 718-731, 2014
262014
Pricing a low-regret seller
H Heidari, M Mahdian, U Syed, S Vassilvitskii, S Yazdanbod
International Conference on Machine Learning, 2559-2567, 2016
132016
The computational complexity of genetic diversity
R Mehta, I Panageas, G Piliouras, S Yazdanbod
24th Annual European Symposium on Algorithms (ESA 2016), 2016
112016
New convex programs for Fisher's market model and its generalizations
NR Devanur, K Jain, T Mai, VV Vazirani, S Yazdanbod
arXiv preprint arXiv:1603.01257, 2016
102016
How effectively can we form opinions?
AM Ahmadinejad, S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin, ...
Proceedings of the 23rd International Conference on World Wide Web, 213-214, 2014
92014
Settling some open problems on 2-player symmetric Nash equilibria
R Mehta, VV Vazirani, S Yazdanbod
International Symposium on Algorithmic Game Theory, 272-284, 2015
72015
A new class of combinatorial markets with covering constraints: Algorithms and applications
NR Devanur, J Garg, R Mehta, VV Vaziranb, S Yazdanbod
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
62018
Using shortcut edges to maximize the number of triangles in graphs
S Dehghani, MA Fazli, J Habibi, S Yazdanbod
Operations Research Letters 43 (6), 586-591, 2015
62015
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
62015
Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness
J Garg, R Mehta, VV Vazirani, S Yazdanbod
arXiv preprint arXiv:1411.5060, 2014
52014
On the Rectangle Escape Problem.
S Assadi, E Emamjomeh-Zadeh, S Yazdanbod, H Zarrabi-Zadeh
CCCG, 2013
52013
A market for scheduling, with applications to cloud computing
N Devanur, J Garg, R Mehta, VV Vazirani, S Yazdanbod
arXiv preprint arXiv:1511.08748 2, 2015
42015
The complexity of genetic diversity: Sex with two chromosomes is advantageous but unpredictable
R Mehta, I Panageas, G Piliouras, S Yazdanbod
ArXiv e-prints, 2014
32014
Response prediction for low-regret agents
S Alaei, A Badanidiyuru, M Mahdian, S Yazdanbod
International Conference on Web and Internet Economics, 31-44, 2019
22019
A black-box reduction in mechanism design with private cost of capital
S Balseiro, N Golrezaei, V Mirrokni, S Yazdanbod
Available at SSRN 3341782, 2019
12019
On the rectangle escape problem
AM Ahmadinejad, S Assadi, E Emamjomeh-Zadeh, S Yazdanbod, ...
Theoretical computer science 689, 126-136, 2017
12017
The Complexity of Genetic Diversity
R Mehta, I Panageas, G Piliouras, S Yazdanbod
arXiv preprint arXiv:1411.6322, 2014
12014
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20