 |
Polyhedral Analysis of an Envy-Free Assignment Problem
1 : LIPN, Université Sorbonne Paris-Nord
Université Paris XIII - Paris Nord
2 : Orange Innovation
Orange Innovation
3 : LAMSADE
université Paris Dauphine, PSL Resarch University
4 : Orange Innovation
Université Paris XIII - Paris Nord
In this work we introduce inequalities to strengthen the formulation of an envy-free assignment problem. Envy-freeness is a fairness criterion originating in the field of computational social choice that ensures agents prefer their own bundle of resources over every other agent's bundle. We present this fair assignement problem and the polyhedral analysis we derive from it.
