## Combinatorial fairness property in division of goods

Given n agents, and m items where vi(g)≥0 is the value of item g for agent i, does there always exist a partition A1,…,An of the m items into n sets s.t. for all i,j∈{1,…,n}: ∑g∈Aivi(g)≥(∑g∈Ajvi(g))−(min Where if A_j is empty, the min is taken as 0. In essence this is a fairness property where … Read more