Masoud Seddighin

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 37

Top Topics

Additively Separable

Top Venues

J. Artif. Intell. Res.

Publications

Masoud Seddighin, Saeed Seddighin
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem. Artif. Intell. 327 (2024)
Amirreza Bagheridelouee, Marzie Nilipour, Masoud Seddighin, Maziar Shamsipour
Metric Distortion Under Public-Spirited Voting. AAMAS (2024)
Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei
Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations. CoRR (2024)
Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR (2023)
Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS (2023)
Shayan Chashm Jahan, Masoud Seddighin, Seyed Mohammad Seyed Javadi, Mohammad Sharifi
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap. IJCAI (2023)
Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin
An EF2X Allocation Protocol for Restricted Additive Valuations. IJCAI (2022)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51 (4) (2022)
Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin
An EF2X Allocation Protocol for Restricted Additive Valuations. CoRR (2022)
Masoud Seddighin, Saeed Seddighin
3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. ITCS (2022)
Masoud Seddighin, Saeed Seddighin
Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem. AAAI (2022)
Shayan Chashm Jahan, Masoud Seddighin, Seyed Mohammad Seyed Javadi, Mohammad Sharifi
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap. CoRR (2022)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303 (2022)
Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi
Maximin share guarantee for goods with positive externalities. Soc. Choice Welf. 56 (2) (2021)
Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI (2021)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46 (3) (2021)
Masoud Seddighin, Mohamad Latifian, Mohammad Ghodsi
On the Distortion Value of Elections with Abstention. J. Artif. Intell. Res. 70 (2021)
Amin Ghiasi, Masoud Seddighin
Approximate Competitive Equilibrium with Generic Budget. SAGT (2021)
Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. SODA (2020)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR (2020)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR (2020)
Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. Algorithmica 81 (4) (2019)
Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64 (2019)
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
Approximating LCS in Linear Time: Beating the √n Barrier. SODA (2019)
Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi
Externalities and Fairness. WWW (2019)
Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin
On the Distortion Value of the Elections with Abstention. AAAI (2019)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC (2018)
Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin
On the Distortion Value of the Elections with Abstention. CoRR (2018)
Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin
Rent Division Among Groups. COCOA (2018)
Mohammad Ghodsi, Hamed Saleh, Masoud Seddighin
Fair Allocation of Indivisible Items With Externalities. CoRR (2018)
Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad S. Tajik
Envy-Free Mechanisms with Minimum Number of Cuts. AAAI (2017)
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR (2017)
Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
Approximate Minimum Diameter. COCOON (2017)
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS (2017)
Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
Approximate Minimum Diameter. CoRR (2017)
Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR (2017)
Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
Unit Covering in Color-Spanning Set Model. WALCOM (2015)