Theo dõi
Masoud Seddighin
Masoud Seddighin
Tehran Institute for Advanced Studies
Email được xác minh tại ce.sharif.edu - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
1842018
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
1042019
Fair allocation of indivisible goods: Improvement
M Ghodsi, MT Hajiaghayi, M Seddighin, S Seddighin, H Yami
Mathematics of Operations Research 46 (3), 1038-1053, 2021
432021
Envy-free Mechanisms with Minimum Number of Cuts
R Alijani, M Farhadi, M Ghodsi, M Seddighin, AS Tajik
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
362017
Approximating lcs in linear time: Beating the barrier
MT Hajiaghayi, M Seddighin, S Seddighin, X Sun
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
352019
Almost envy-freeness, envy-rank, and nash social welfare matchings
A Farhadi, MT Hajiaghayi, M Latifian, M Seddighin, H Yami
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5355-5362, 2021
242021
Fair allocation of indivisible goods: Beyond additive valuations
M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami
Artificial Intelligence 303, 103633, 2022
222022
An EF2X allocation protocol for restricted additive valuations
H Akrami, R Rezvan, M Seddighin
Proceedings of the Thirty-First International Joint Conference on Artificial …, 2022
182022
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
M Seddighin, S Seddighin
Artificial Intelligence 327, 104049, 2024
172024
Improved algorithms for edit distance and LCS: beyond worst case
M Boroujeni, M Seddighin, S Seddighin
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
172020
On the distortion value of the elections with abstention
M Ghodsi, M Latifian, M Seddighin
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1981-1988, 2019
162019
Externalities and fairness
M Seddighin, H Saleh, M Ghodsi
The World Wide Web Conference, 538-548, 2019
16*2019
Randomized and deterministic maximin-share approximations for fractionally subadditive valuations
H Akrami, K Mehlhorn, M Seddighin, G Shahkarami
Advances in Neural Information Processing Systems 36, 58821-58832, 2023
132023
Rainbow Cycle Number and EFX Allocations:(Almost) Closing the Gap
SC Jahan, M Seddighin, SM Seyed-Javadi, M Sharifi
Proceedings of the Thirty-Second International Joint Conference on …, 2023
132023
Expand the shares together: envy-free mechanisms with a small number of cuts
M Seddighin, M Farhadi, M Ghodsi, R Alijani, AS Tajik
Algorithmica 81, 1728-1755, 2019
102019
Rent division among groups
M Ghodsi, M Latifian, A Mohammadi, S Moradian, M Seddighin
Combinatorial Optimization and Applications: 12th International Conference …, 2018
102018
On the distortion value of elections with abstention
M Seddighin, M Latifian, M Ghodsi
Journal of Artificial Intelligence Research 70, 567-595, 2021
82021
Maximin share guarantee for goods with positive externalities
M Seddighin, H Saleh, M Ghodsi
Social Choice and Welfare 56 (2), 291-324, 2021
62021
3+ ε approximation of tree edit distance in truly subquadratic time
M Seddighin, S Seddighin
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 115 …, 2022
52022
Approximate minimum diameter
M Ghodsi, H Homapour, M Seddighin
International Computing and Combinatorics Conference, 237-249, 2017
52017
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20