Skip to main content
Article thumbnail
Location of Repository

Nash Equilibria, collusion in games and the coevolutionary particle swarm algorithm

By Andrew Koh


In recent work, we presented a deterministic algorithm to investigate collusion between players in a game where the players’ payoff functions are subject to a variational inequality describing the equilibrium of a transportation system. In investigating the potential for collusion between players, the diagonalization algorithm returned a local optimum. In this paper, we apply a coevolutionary particle swarm optimization (PSO) algorithm developed in earlier research in an attempt to return the global maximum. A numerical experiment is used to verify the performance of the algorithm in overcoming local optimum

Publisher: Jozef Stefan Institute
Year: 2008
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.