On the Complexity of Pareto-Optimal Nash and Strong Equilibria.
Martin HoeferAlexander SkopalikPublished in: Theory Comput. Syst. (2013)
Keyphrases
- pareto optimal
- nash equilibrium
- social welfare
- worst case
- game theory
- nash equilibria
- game theoretic
- multi issue negotiation
- multi objective
- pareto optimality
- pareto optimal set
- bargaining solution
- multiple objectives
- computational complexity
- multi objective optimization
- solution concepts
- nsga ii
- neural network
- scheduling problem
- optimal solution
- stochastic games
- np complete
- upper bound
- multi agent