New algorithm for checking Pareto optimality in bimatrix games.

Richárd Kicsiny Zoltán Varga

Published in: Ann. Oper. Res. (2023)

Keyphrases

computational complexity
learning algorithm
objective function
optimal solution
lower bound
cost function
np hard
dynamic programming
worst case
probabilistic model
pareto optimality
upper bound
particle swarm optimization
dynamic environments
optimization algorithm
decision problems