Loading…
Nash equilibria detection for multi-player games
One of the main issues in computational game theory is equilibria detection in multi player games. This problem is approached using a generative relation for strategy profiles and two different search operators: crowding based differential evolution and a simple stepping stone reinforcing search alg...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | One of the main issues in computational game theory is equilibria detection in multi player games. This problem is approached using a generative relation for strategy profiles and two different search operators: crowding based differential evolution and a simple stepping stone reinforcing search algorithm. A probabilistic generative relation is also derived in order to tackle a higher number of players. Each approach has advantages and disadvantages, illustrated by numerical experiments for games involving from two to a hundred players. |
---|---|
ISSN: | 1089-778X 1941-0026 |
DOI: | 10.1109/CEC.2010.5586174 |