Masoud Seddighin

Orcid: 0000-0003-1089-5779

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.
Artif. Intell., February, 2024

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

Metric Distortion Under Public-Spirited Voting.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations.
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.
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.
SIAM J. Comput., August, 2022

Fair allocation of indivisible goods: Beyond additive valuations.
Artif. Intell., 2022

3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

An EF2X Allocation Protocol for Restricted Additive Valuations.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Maximin share guarantee for goods with positive externalities.
Soc. Choice Welf., 2021

Fair Allocation of Indivisible Goods: Improvement.
Math. Oper. Res., 2021

On the Distortion Value of Elections with Abstention.
J. Artif. Intell. Res., 2021

Approximate Competitive Equilibrium with Generic Budget.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Fair Allocation of Indivisible Goods to Asymmetric Agents.
J. Artif. Intell. Res., 2019

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

Externalities and Fairness.
Proceedings of the World Wide Web Conference, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Fair Allocation of Indivisible Items With Externalities.
CoRR, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Rent Division Among Groups.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Fair Allocation of Indivisible Goods: Improvement and Generalization.
CoRR, 2017

Approximate Minimum Diameter.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Envy-Free Mechanisms with Minimum Number of Cuts.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015
Unit Covering in Color-Spanning Set Model.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015


  Loading...