← Search

Masoud Seddighin

7 accepted papers

2026

Metric Distortion with Preference Intensities

AAAI 2026technical

In voting with ranked ballots each agent submits a strict ranking of the form a > b > c > d over the alternatives, and the voting rule decides on the winner based on these rankings. Although this ballot format has desirable characteristics, there is a question of whether it is expressive enough for

Cited by 0SourcePDFScholar
2025

Tight Bounds on the Distortion of Randomized and Deterministic Distributed Voting

NeurIPS 2025poster

We study metric distortion in distributed voting, where $n$ voters are partitioned into $k$ groups, each selecting a local representative, and a final winner is chosen from these representatives (or from the entire set of candidates). This setting models systems like U.S. presidential elections, whe…

Cited by 0SourceScholar
2023

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

IJCAI 2023poster

Recently, some studies on the fair allocation of indivisible goods notice a connection between a purely combinatorial problem called the Rainbow Cycle problem and a fairness notion known as EFX: assuming that the rainbow cycle number for parameter d (i.e. R(d)) is O(d^β .log(d)^γ), we can find a (1…

Cited by 14SourcePDFScholar
2023

Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations

NeurIPS 2023poster

We consider the problem of guaranteeing maximin-share ($\MMS$) when allocating a set of indivisible items to a set of agents with fractionally subadditive ($\XOS$) valuations. For $\XOS$ valuations, it has been previously shown that for some instances no allocation can guarantee a fraction better…

Cited by 14SourcePDFScholar
2022

Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem

AAAI 2022technical

In this work, we study the maximin share fairness notion for allocation of indivisible goods in the subadditive and fractionally subadditive settings. While previous work refutes the possibility of obtaining an allocation which is better than 1/2-MMS, the only positive result for the subadditive set…

Cited by 18SourcePDFScholar
2021

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

AAAI 2021technical

Envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contrast, it is unknown whether or not an EFX all…

Cited by 26SourcePDFScholar