8 citations · 9 across the 6 of their papers we have counts for
6 papers
Maximin Shares in Hereditary Set Systems
Halvard Hummel
We consider the problem of fairly allocating a set of indivisible items under the criteria of the maximin share guarantee. Specifically, we study approximation of maximin share all…
Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
Halvard Hummel, Ayumi Igarashi
We study the problem of allocating indivisible resources under the connectivity constraints of a graph . This model, initially introduced by Bouveret et al. (published in IJCAI,…
On Lower Bounds for Maximin Share Guarantees
Halvard Hummel
We study the problem of fairly allocating a set of indivisible items to a set of agents with additive valuations. Recently, Feige et al. (WINE'21) proved that a maximin share (MMS)…
Fairest Neighbors: Tradeoffs Between Metric Queries
Magnus Lie Hetland, Halvard Hummel
Metric search commonly involves finding objects similar to a given sample object. We explore a generalization, where the desired result is a fair tradeoff between multiple query ob…
Maximin Shares Under Cardinality Constraints
Halvard Hummel, Magnus Lie Hetland
We study the problem of fair allocation of a set of indivisible items among agents with additive valuations, under cardinality constraints. In this setting, the items are partition…
Fair Allocation of Conflicting Items
Halvard Hummel, Magnus Lie Hetland
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts, and agents are not permitted to receive conflicting items. This kind of constr…