8 citations · 19 across the 19 of their papers we have counts for
21 papers
Polynomial Algorithms for Simultaneous Share-Based and Envy-Based Guarantees
Hannaneh Akrami, Arash Ashuri, Kurt Mehlhorn
We study the simultaneous achievement of share-based and envy-based fairness in the allocation of indivisible goods with nonnegative additive valuations. The AnyPrice share (APS) i…
A Simple Polynomial-Time EFX Repair for Cancelable Valuations
Hannaneh Akrami, Arash Ashuri, Bhaskar Ray Chaudhury +2
The leximin++ proof of Plaut and Roughgarden for agents with identical monotone valuations gives a natural EFX-repair procedure: starting from an arbitrary partition, repeatedly tr…
A Counterexample to EFX Agents, Items, Submodular Valuations via SAT-Solving
Hannaneh Akrami, Alexander Mayorov, Kurt Mehlhorn +2
The existence of EFX allocations is a central open problem in discrete fair division. An allocation is EFX (envy-free up to any good) if no agent envies another agent after the rem…
Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
Hannaneh Akrami, Timo Reichert
We study the fair allocation of indivisible goods among agents with additive valuations. The fair division literature has traditionally focused on two broad classes of fairness not…
The Power of Share-Based Notions in Proving Envy-Based Fairness Guarantees
Hannaneh Akrami, Uriel Feige, Ryoga Mahara +2
We study the problem of fairly allocating indivisible goods among agents with monotone valuations. We introduce a new share-based fairness notion, the residual maximin share (RMMS)…
Matroids are Equitable
Hannaneh Akrami, Siyue Liu, Roshan Raj +1
We show that if the ground set of a matroid can be partitioned into bases, then for any given subset of the ground set, there is a partition into bases such that t…
Fair Division via Resource Augmentation
Hannaneh Akrami, Siddharth Barman, Alon Eden +5
We introduce and formalize the notion of resource augmentation for maximin share (MMS) fairness for the allocation of indivisible goods. Given an instance with agents and g…
On the Theoretical Foundations of Data Exchange Economies
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg +1
The immense success of ML systems relies heavily on large-scale, high-quality data. The high demand for data has led to many paradigms that involve selling, exchanging, and sharing…
Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously
Hannaneh Akrami, Nidhi Rathi
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 ex…
Epistemic EFX Allocations Exist for Monotone Valuations
Hannaneh Akrami, Nidhi Rathi
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…
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin +1
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 va…
Breaking the Barrier for Approximate Maximin Share
Hannaneh Akrami, Jugal Garg
We study the fundamental problem of fairly allocating a set of indivisible goods among agents with additive valuations using the desirable fairness notion of maximin share (MMS…
Improving Approximation Guarantees for Maximin Share
Hannaneh Akrami, Jugal Garg, Eklavya Sharma +1
We consider fair division of a set of indivisible goods among agents with additive valuations using the fairness notion of maximin share (MMS). MMS is the most popular share-ba…
Fair and Efficient Allocation of Indivisible Chores with Surplus
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg +2
We study fair division of indivisible chores among agents with additive disutility functions. Two well-studied fairness notions for indivisible items are envy-freeness up to on…
Simplification and Improvement of MMS Approximation
Hannaneh Akrami, Jugal Garg, Eklavya Sharma +1
We consider the problem of fairly allocating a set of indivisible goods among agents with additive valuations, using the popular fairness notion of maximin share (MMS). Since M…
Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
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 or $p/q…
EFX Allocations: Simplifications and Improvements
Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury +3
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…
An EF2X Allocation Protocol for Restricted Additive Valuations
Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin
We study the problem of fairly allocating a set of indivisible goods to a set of agents. Envy-freeness up to any good (EFX) criteria -- which requires that no agent prefers…
Maximizing Nash Social Welfare in 2-Value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
We consider the problem of maximizing the Nash social welfare when allocating a set of indivisible goods to a set of agents. We study instances, in whic…
Nash Social Welfare for 2-value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn +2
This paper is merged with arXiv:2107.08965v2. We refer the reader to the full and updated version. We study the problem of allocating a set of indivisible goods among agents with 2…
Ratio-Balanced Maximum Flows
Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland
When a loan is approved for a person or company, the bank is subject to \emph{credit risk}; the risk that the lender defaults. To mitigate this risk, a bank will require some form…