The Inherit1.xlsx Model

Maximization of the minimum utility of a set of participants

View the model
Download the model

Given a number of participants(parties), each with their own objective or utility function, we want to find a solution to a sharing problem so that the smallest find a solution to a shared problem so that the smallest utility is maximized. utility is maximized, given that, the third etc...
The specific sharing problem is to allocate a number of discrete items from an inheritance to the heirs, with each heir having her own set of values for each of the items to be allocated;


Allocation | Fair Allocation | Minimax | Assignment Problem | Inheritance | Goal Programming | Preemptive Goal Programming | Multi-criteria |