Get started
Author

Masoud Seddighin

Observed name: Seddighin, Masoud
Institution: Khatam University
ORCID: 0000-0003-1089-5779
Observed ORCID: 0000-0003-1089-5779
OpenAlex ID: A5000823457
Fair Allocation of Indivisible Goods: Improvements and Generalizations
2018 · Mohammad Ghodsi, Mohammadtaghi Hajiaghayi, et al. · ACM Conference on Economics and Computation (EC) · 124
PDF
Fair Allocation of Indivisible Goods to Asymmetric Agents
2019 · Alireza Farhadi, Mohammad Ghodsi, et al. · Journal of Artificial Intelligence Research · 76
PDF
Fair Allocation of Indivisible Goods: Improvement
2021 · Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, et al. · Mathematics of Operations Research · 48
PDF
Envy-Free Mechanisms with Minimum Number of Cuts
2017 · Reza Alijani, Majid Farhadi, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 25
Fair allocation of indivisible goods: Beyond additive valuations
2021 · Mohammad Ghodsi, MohammadTaghi HajiAghayi, et al. · Artificial Intelligence · 23
PDF
Approximating LCS in Linear Time: Beating the √ n Barrier
2019 · MohammadTaghi Hajiaghayi, Masoud Seddighin, et al. · Society for Industrial and Applied Mathematics eBooks · 22
An EF2X Allocation Protocol for Restricted Additive Valuations
2022 · Hannaneh Akrami, Rojin Rezvan, et al. · International Joint Conference on Artificial Intelligence · 16
PDF
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
2021 · Farhadi, Alireza, Hajiaghayi, MohammadTaghi, et al. · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · 16
PDF
Rent Division Among Groups
2018 · Mohammad Ghodsi, Mohamad Latifian, et al. · Lecture notes in computer science · 14
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap
2023 · Shayan Chashm Jahan, Masoud Seddighin, et al. · International Joint Conference on Artificial Intelligence · 12
PDF
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case
2019 · Mahdi Boroujeni, Masoud Seddighin, et al. · Society for Industrial and Applied Mathematics eBooks · 12
Improved Maximin Share Guarantee for Additive Valuations
2026 · Ehsan Heidari, Alireza Kaviani, et al. · Society for Industrial and Applied Mathematics eBooks · 11
PDF
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
2023 · Hannaneh Akrami, Kurt Mehlhorn, et al. · neural information processing systems · 11
PDF
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
2023 · Masoud Seddighin, Saeed Seddighin · Artificial Intelligence · 9
On the Distortion Value of the Elections with Abstention
2019 · Ghodsi, Mohammad, Latifian, Mohamad, et al. · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · 9
PDF
Maximin share guarantee for goods with positive externalities
2020 · Masoud Seddighin, Hamed Saleh, et al. · Social Choice and Welfare · 8
PDF
Externalities and Fairness
2019 · Masoud Seddighin, Hamed Saleh, et al. · International World Wide Web Conference (WWW) · 8
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
2021 · Alireza Farhadi, MohammadTaghi Hajiaghayi, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 7
Almost Envy-Free Allocation of Indivisible Goods: A Tale of Two Valuations
2026 · Alireza Kaviani, Masoud Seddighin, et al. · Lecture notes in computer science · 6
PDF
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts
2018 · Masoud Seddighin, Majid Farhadi, et al. · Algorithmica · 6
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier
2022 · MohammadTaghi HajiAghayi, Masoud Seddighin, et al. · SIAM Journal on Computing · 5
PDF
On the Distortion Value of Elections with Abstention
2021 · Masoud Seddighin, Mohammad Latifian, et al. · Journal of Artificial Intelligence Research · 5
PDF
Approximate Minimum Diameter
2017 · Mohammad Ghodsi, Hamid Homapour, et al. · Lecture notes in computer science · 5
Improved Approximate EFX Guarantees for Multigraphs
2026 · Alireza Kaviani, Alireza Keshavarz, et al. · Lecture notes in computer science · 4
PDF
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
2025 · Masoud Seddighin, Saeed Seddighin · ACM Conference on Economics and Computation (EC) · 4
PDF
Works count: 49
Citation count: 506
H-index: 11
I10-index: 13
Year
Topic
Type