Simulated annealing of game equilibria: A simple adaptive procedure leading to nash equilibrium. Unpublished manuscript
| Author(s) : | R. Pearson Mark La Mura, |
| Publisher : | N/A |
| Publication Date : | 2001 |
| ISSN : | N/A |
| Abstract : | Simulated Annealing is a powerful algorithm for global optimization. Applied to nite games, it yields a simple adaptive procedure leading to Nash equilibrium, whose execution can be fully decentralized. Furthermore, the procedure makes for an eective computational technique, which compares well with state-of-the-art methods. 1., |