Article ID: | iaor20114089 |
Volume: | 19 |
Issue: | 2 |
Start Page Number: | 201 |
End Page Number: | 213 |
Publication Date: | Jun 2011 |
Journal: | Central European Journal of Operations Research |
Authors: | Forg Ferenc |
Keywords: | pareto-optimality, Nash equilibrium, correlation |
A correlation scheme (leading to a special equilibrium called ‘soft’ correlated equilibrium) is applied for two‐person finite games in extensive form with perfect information. Randomization by an umpire takes place over the leaves of the game tree. At every decision point players have the choice either to follow the recommendation of the umpire blindly or freely choose any other action except the one suggested. This scheme can lead to Pareto‐improved outcomes of other correlated equilibria. Computational issues of maximizing a linear function over the set of soft correlated equilibria are considered and a linear‐time algorithm in terms of the number of edges in the game tree is given for a special procedure called ‘subgame perfect optimization’.