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

Abstract

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

    Similar works

    This paper was published in White Rose Research Online.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.