We consider general multi-agent allocation problems.
We formalize a number of properties on the Price of Fairness without any special assumptions on the agent utilities.
We introduce a new allocation problem called the Fair Subset Sum Problem (FSSP).
We provide upper and lower bounds on the Price of Fairness under different definitions of fairness.