Masoud Seddighin

According to our database, Masoud Seddighin authored at least 26 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.

Masoud Seddighin, Saeed Seddighin

Artif. Intell., February, 2024

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations.

Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei

CoRR, 2024

Metric Distortion Under Public-Spirited Voting.

Amirreza Bagheridelouee, Marzie Nilipour, Masoud Seddighin, Maziar Shamsipour

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations.

Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap.

Shayan Chashm Jahan, Masoud Seddighin, Seyed Mohammad Seyed Javadi, Mohammad Sharifi

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier.

MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun

SIAM J. Comput., August, 2022

Fair allocation of indivisible goods: Beyond additive valuations.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Artif. Intell., 2022

3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time.

Masoud Seddighin, Saeed Seddighin

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

An EF2X Allocation Protocol for Restricted Additive Valuations.

Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Maximin share guarantee for goods with positive externalities.

Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi

Soc. Choice Welf., 2021

Fair Allocation of Indivisible Goods: Improvement.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Math. Oper. Res., 2021

On the Distortion Value of Elections with Abstention.

Masoud Seddighin, Mohamad Latifian, Mohammad Ghodsi

J. Artif. Intell. Res., 2021

Approximate Competitive Equilibrium with Generic Budget.

Amin Ghiasi, Masoud Seddighin

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings.

Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case.

Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.

Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami

J. Artif. Intell. Res., 2019

Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts.

Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik

Algorithmica, 2019

Externalities and Fairness.

Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi

Proceedings of the World Wide Web Conference, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.

MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Fair Allocation of Indivisible Items With Externalities.

Mohammad Ghodsi, Hamed Saleh, Masoud Seddighin

CoRR, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Rent Division Among Groups.

Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Fair Allocation of Indivisible Goods: Improvement and Generalization.

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami

CoRR, 2017

Approximate Minimum Diameter.

Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Envy-Free Mechanisms with Minimum Number of Cuts.

Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad S. Tajik

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015

Unit Covering in Color-Spanning Set Model.

Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015