Equilibrium strategies via GA to stackelberg games under multiple follower's best reply

In this paper, we study a two‐person game between one leader and one follower, called the Stackelberg game. The leader player enounces a decision before the others, and the follower takes into account this decision and solves an optimization problem that may have multiple solutions. Then, the leader optimizes his objective by assuming a given follower's reaction depending on his behavior. We consider in this paper a hierarchical equilibrium solution for a two‐level game, particularly the strong Stackelberg solutions that corresponds to an optimistic leader's point of view and we give a numerical procedure based on a genetic algorithm (GA) evolution process to compute them. The use of a multimodal genetic algorithm allows us to approach the possible multiple solutions to the lower level problem. The algorithm convergence is illustrated by means of some test cases. © 2011 Wiley Periodicals, Inc.

[1]  F. Ben Abdelaziz,et al.  R&D Equilibrium Strategies with Surfers , 2007 .

[2]  Sanjay Chawla,et al.  A Game Theoretical Model for Adversarial Learning , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[3]  Andrey Garnaev,et al.  Fish Wars: Cooperative and Non-Cooperative Approaches , 2008 .

[4]  Kim C. Border,et al.  Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .

[5]  Elia Daniele,et al.  A Hierarchical MultiModal Hybrid Stackelberg–Nash GA for a Leader with Multiple Followers Game , 2012 .

[6]  A. Haurie,et al.  Sequential Stackelberg equilibria in two-person games , 1985 .

[7]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[8]  Jacques Periaux,et al.  Combining game theory and genetic algorithms with application to DDM-nozzle optimization problems , 2001 .

[9]  Patrice Marcotte,et al.  A Stackelberg-Nash model for the design of deregulated transit system , 1991 .

[10]  Hanif D. Sherali,et al.  Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations , 1983, Oper. Res..

[11]  Panos M. Pardalos,et al.  Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms , 2009 .

[12]  T. Başar,et al.  Dynamic Noncooperative Game Theory, 2nd Edition , 1998 .

[13]  T. Başar,et al.  A Stackelberg Network Game with a Large Number of Followers , 2002 .

[14]  J. Periaux,et al.  Multi-point optimization using GAs and Nash/Stackelberg games for high lift multi-airfoil design in aerodynamics , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[15]  Tamer Basar,et al.  Off-Line Computation of Stackelberg Solutions with the Genetic Algorithm , 1998 .

[16]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[17]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[18]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[19]  G. Leitmann.  On generalized Stackelberg strategies , 1978 .