Developments in Multi-Agent Fair Allocation

  title={Developments in Multi-Agent Fair Allocation},
  author={Haris Aziz},
  booktitle={AAAI Conference on Artificial Intelligence},
  • H. Aziz
  • Published in
    AAAI Conference on Artificial…
    22 November 2019
  • Economics
Fairness is becoming an increasingly important concern when designing markets, allocation procedures, and computer systems. I survey some recent developments in the field of multi-agent fair allocation. 

Algorithmic fair allocation of indivisible items

A comprehensive survey of recent progress through the prism of algorithms is presented, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.

Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions

A comprehensive survey of recent progressthrough the prism of algorithms is presented, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.

Fairness Concepts for Indivisible Items with Externalities

A new fair-freeness concept called general fair share (GFS) is proposed, which applies to a more general public decision making model and allows for scenarios in which agents benefit from or compete against one another.

A Framework for Fair Decision-making Over Time with Time-invariant Utilities

Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-making problem. This

Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores

We study the problem of fairly and efficiently allocating indivisible chores among agents with additive disutility functions. We consider the widely-used envy-based fairness properties of EF1 and EFX,

Fair Division with Money and Prices

We must divide a finite number of indivisible goods and cash transfers between agents with quasi-linear but otherwise arbitrary utilities over the subsets of goods. We compare two division rules with

Fair Division of Indivisible Goods: A Survey

Allocating resources to individuals in a fair manner has been a topic of interest since the ancient times, with most of the early rigorous mathematical work on the problem focusing on infinitely

Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations

It is proved that, under dichotomous valuations, there exists an allocation that achieves envy-freeness with a per-agent subsidy of either 0 or 1, and such an envy-free solution can be computed efficiently in the standard value-oracle model.

Tractable Fragments of the Maximum Nash Welfare Problem

A PTAS is designed for finding an MNW allocation for the case of asymmetric agents with identical, additive valuations, thus generalizing a similar result for symmetric agents and showing that for constantly many asymmetricagents with additive valuation, the MNW problem admits a fully polynomial-time approximation scheme (FPTAS).



Algorithmic Fairness

An overview of the main concepts of identifying, measuring and improving algorithmic fairness when using AI algorithms is presented and the most commonly used fairness-related datasets in this field are described.

Fair Division with Minimal Sharing

It is shown that, for a generic instance of the problem, a fair and Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed.

Fairness Towards Groups of Agents in the Allocation of Indivisible Items

It is proved that maximizing utilitarian social welfare under constraints of typewise envy-freeness up to one item (TEF1) is computationally intractable.

Portioning Using Ordinal Preferences: Fairness and Efficiency

This work introduces a family of rules for portioning, inspired by positional scoring rules, and focuses on fairness, and introduces the SD-core, a group fairness notion.

Fair allocation of indivisible goods and chores

This paper considers a more general scenario where an agent may have negative or positive utility for each item, e.g., fair task assignment, where agents can have both positive and negative utilities for each task.

Almost Group Envy-free Allocation of Indivisible Goods and Chores

This work takes the group envy-freeness concept that is well-established in the literature and presents stronger and relaxed versions that are especially suitable for the allocation of indivisible items, and presents a clear taxonomy of the fairness concepts.

An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

With this algorithm, the problem of fairly dividing m indivisible chores among n agents is considered and it is shown that there always exists a 4/3-approximation maximin share allocation for any instance.

Fair Division in the age of the internet

Fair Division, a key concern in the design of many social institutions, is for 70 years the subject of interdisciplinary research at the interface of mathematics, economics and game theory. Motivated

From Matching with Diversity Constraints to Matching with Regional Quotas

One key conclusion of the results is that further developments on axiomatic and algorithmic aspects of hospital-doctor matching with regional quotas will result in corresponding results for school choice with diversity constraints.