Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Akrami, Hannaneh"'
Autor:
Akrami, Hannaneh, Rathi, Nidhi
We study the problem of computing \emph{fair} divisions of a set of indivisible goods among agents with \emph{additive} valuations. For the past many decades, the literature has explored various notions of fairness, that can be primarily seen as eith
Externí odkaz:
http://arxiv.org/abs/2409.01963
Autor:
Akrami, Hannaneh, Rathi, Nidhi
We study the fundamental problem of fairly dividing a set of indivisible items among agents with (general) monotone valuations. The notion of envy-freeness up to any item (EFX) is considered to be one of the most fascinating fairness concepts in this
Externí odkaz:
http://arxiv.org/abs/2405.14463
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
We consider fair division of a set of indivisible goods among $n$ agents with additive valuations using the fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to her if she r
Externí odkaz:
http://arxiv.org/abs/2307.12916
Autor:
Akrami, Hannaneh, Garg, Jugal
We study the fundamental problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations using the desirable fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds
Externí odkaz:
http://arxiv.org/abs/2307.07304
We study fair division of indivisible chores among $n$ agents with additive disutility functions. Two well-studied fairness notions for indivisible items are envy-freeness up to one/any item (EF1/EFX) and the standard notion of economic efficiency is
Externí odkaz:
http://arxiv.org/abs/2305.04788
We consider the problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations, using the popular fairness notion of maximin share (MMS). Since MMS allocations do not always exist, a series of works provided existen
Externí odkaz:
http://arxiv.org/abs/2303.16788
Autor:
Akrami, Hannaneh, Chaudhury, Bhaskar Ray, Hoefer, Martin, Mehlhorn, Kurt, Schmalhofer, Marco, Shahkarami, Golnoosh, Varricchio, Giovanna, Vermande, Quentin, van Wijland, Ernest
We study the problem of allocating a set of indivisible goods among a set of agents with \emph{2-value additive valuations}. In this setting, each good is valued either $1$ or $\sfrac{p}{q}$, for some fixed co-prime numbers $p,q\in \NN$ such that $1\
Externí odkaz:
http://arxiv.org/abs/2207.10949
Autor:
Akrami, Hannaneh, Alon, Noga, Chaudhury, Bhaskar Ray, Garg, Jugal, Mehlhorn, Kurt, Mehta, Ruta
The existence of EFX allocations is a fundamental open problem in discrete fair division. Given a set of agents and indivisible goods, the goal is to determine the existence of an allocation where no agent envies another following the removal of any
Externí odkaz:
http://arxiv.org/abs/2205.07638
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