Implement the code and test for compromise-dominance relation, it uses three metrics:
1. Pareto dominance (for superiority)
2. Nash dominance (for fairness)
3. Similarity (for similarity-to-ideal)

It try to ensure a prateo-optimal, nash-equilibra and the most similar to ideal point.
Even such solution does not exist, it can still find out the cloest one.