Hadi Yami
Hadi Yami
Applied Scientist, Microsoft, Bellevue
Verified email at microsoft.com - Homepage
Cited by
Cited by
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
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
Envy-free chore division for an arbitrary number of agents
S Dehghani, A Farhadi, MT HajiAghayi, H Yami
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Brief announcement: Graph matching in massive datasets
S Behnezhad, M Derakhshan, H Esfandiari, E Tan, H Yami
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
A Farhadi, MT Hajiaghayi, M Latifian, M Seddighin, H Yami
arXiv preprint arXiv:2007.07027, 2020
Market pricing for data streams
M Abolhassani, H Esfandiari, MT Hajiaghayi, B Lucier, H Yami
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
Fair Allocation of Indivisible Goods: Improvement
M Ghodsi, MT Hajiaghayi, M Seddighin, S Seddighin, H Yami
Mathematics of Operations Research, 2021
Fairness Guarantees in Allocation Problems
H Yami
On the Efficiency and Equilibria of Rich Ads.
MA Ghiasi, MT Hajiaghayi, S Lahaie, H Yami
IJCAI, 301-307, 2019
A New Upper Bound on Total Domination Number of Bipartite Graphs
S Akbari, P Ehsani, S Qajar, A Shameli, H Yami
arXiv preprint arXiv:1412.8203, 2014
Inferring Social Circles in Online Networks via a Hybrid Approach
SA Zadeh, Z Abbassi, P Ehsani, V Mirrokni, A Shameli, H Yami
The system can't perform the operation now. Try again later.
Articles 1–11