3 papers
cs.GT2024
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…
cs.GT2024
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,…
cs.DS2021
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…