Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Seddighin, Masoud"'
The existence of $\textsf{EFX}$ allocations stands as one of the main challenges in discrete fair division. In this paper, we present a collection of symmetrical results on the existence of $\textsf{EFX}$ notion and its approximate variations. These
Externí odkaz:
http://arxiv.org/abs/2407.05139
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 allo
Externí odkaz:
http://arxiv.org/abs/2308.14545
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
Externí odkaz:
http://arxiv.org/abs/2212.09482
We study the problem of fairly allocating a set of $m$ indivisible goods to a set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which requires that no agent prefers the bundle of another agent after removal of any single good -- is kn
Externí odkaz:
http://arxiv.org/abs/2202.13676
Autor:
Seddighin, Masoud, Seddighin, Saeed
Publikováno v:
In Artificial Intelligence February 2024 327
Autor:
Farhadi, Alireza, Hajiaghayi, MohammadTaghi, Latifian, Mohamad, Seddighin, Masoud, Yami, Hadi
Envy-free up to one good (EF1) and envy-free 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 contras
Externí odkaz:
http://arxiv.org/abs/2007.07027
Longest common subsequence (LCS) is one of the most fundamental problems in combinatorial optimization. Apart from theoretical importance, LCS has enormous applications in bioinformatics, revision control systems, and data comparison programs. Althou
Externí odkaz:
http://arxiv.org/abs/2003.07285
In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than $3$, even for simple metrics such as a line. In this study, we wish to answer the
Externí odkaz:
http://arxiv.org/abs/1812.09851
One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that a bundle allocated to an agent may affect the utilities of other agents. I
Externí odkaz:
http://arxiv.org/abs/1805.06191
Publikováno v:
In Artificial Intelligence February 2022 303