66 citations · 79 across the 10 of their papers we have counts for
14 papers
Two Algorithms for Additive and Fair Division of Mixed Manna
Martin Aleksandrov, Toby Walsh
We consider a fair division model in which agents have positive, zero and negative utilities for items. For this model, we analyse one existing fairness property - EFX - and three…
Most Competitive Mechanisms in Online Fair Division
Martin Aleksandrov, Toby Walsh
This paper combines two key ingredients for online algorithms - competitive analysis (e.g. the competitive ratio) and advice complexity (e.g. the number of advice bits needed to im…
Expected Outcomes and Manipulations in Online Fair Division
Martin Aleksandrov, Toby Walsh
Two simple and attractive mechanisms for the fair division of indivisible goods in an online setting are LIKE and BALANCED LIKE. We study some fundamental computational problems co…
Strategy-proofness, Envy-freeness and Pareto efficiency in Online Fair Division with Additive Utilities
Martin Aleksandrov, Toby Walsh
We consider fair division problems where indivisible items arrive one-by-one in an online fashion and are allocated immediately to agents who have additive utilities over these ite…
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items
Martin Aleksandrov, Toby Walsh
We study the fair division of items to agents supposing that agents can form groups. We thus give natural generalizations of popular concepts such as envy-freeness and Pareto effic…
Monotone and Online Fair Division
Martin Aleksandrov, Toby Walsh
We study a new but simple model for online fair division in which indivisible items arrive one-by-one and agents have monotone utilities over bundles of the items. We consider axio…