On the complexity of Pareto-optimal and envy-free lotteries.
Ioannis CaragiannisKristoffer Arnsfelt HansenNidhi RathiPublished in: CoRR (2023)
Keyphrases
- pareto optimal
- envy free
- multi objective
- multi objective optimization
- multiple objectives
- multi issue negotiation
- pareto optimality
- nash equilibrium
- pareto optimal set
- expected utility
- nsga ii
- evolutionary algorithm
- optimal solution
- social welfare
- worst case
- additively separable
- knapsack problem
- decision problems
- optimization algorithm
- particle swarm optimization
- probability distribution
- computational complexity