A Section Theorem in Topological Ordered Spaces and its Applications to the Existence of Pareto Equilibria for Multi-objective Games.
Haishu LuPublished in: JCAI (2009)
Keyphrases
- multi objective
- nash equilibria
- congestion games
- fixed point theorem
- fixed point
- pure nash equilibria
- topological spaces
- game theoretic
- nash equilibrium
- game theory
- multi objective optimization
- evolutionary algorithm
- optimization algorithm
- incomplete information
- multiobjective optimization
- pure strategy
- digital topology
- pure nash equilibrium
- extensive form games
- repeated games
- particle swarm optimization
- objective function
- solution concepts
- genetic algorithm
- conflicting objectives
- stochastic games
- fictitious play
- topological properties
- nsga ii
- pareto optimal
- bi objective
- multi objective evolutionary algorithms
- computer games
- multiple objectives
- differential evolution
- boundary value problem
- cooperative
- multi agent
- von neumann
- multi agent systems
- multi objective evolutionary
- mixed strategy
- worst case
- long run
- decision problems
- multi objective optimization problems
- multiagent learning
- game design
- boundary conditions
- online game
- imperfect information