• Recherche,

Maximin Envy-Free Division of Indivisible Items, Marc Kilgour, Colloques de l'IRIT

le 10 mai 2016

Manufacture des Tabacs

Marc Kilgour, professeur à Wilfrid Laurier University et professeur invité au Labex CIMI pour le mois de mai, nous parlera de "Maximin Envy-Free Division of Indivisible Items". Il tiendra la conférence entierement en anglais.

Abstract: Assume that two players have strict rankings over an even number of indivisible items. We propose algorithms to find allocations of these items that are maximin—maximize the minimum rank of the items that the players receive—and are envy-free and Pareto-optimal if such allocations exist. We show that neither maximin nor envy-free allocations may satisfy other criteria of fairness, such as Borda maximinality. We assess the applicability of the algorithms to real-world problems, such as allocating marital property in a divorce or assigning people to committees or projects. Joint work with: Steven Brams and Christian Klamler.
Mis à jour le 5 février 2016