Advertisement

A Method for Solving Some Class of Multilevel Multi-leader Multi-follower Programming Problems

  • Addis Belete Zewde
  • Semu Mitiku KassaEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

Multiple leaders with multiple followers games serve as an important model in game theory with many applications in economics, engineering, operations research and other fields. In this paper, we have reformulated a multilevel multi-leader multiple follower (MLMLMF) programming problem into an equivalent multilevel single-leader multiple follower (MLSLMF) programming problem by introducing a suppositional (or dummy) leader. If the resulting MLSLMF programming problem consist of separable terms and parameterized common terms across all the followers, then the problem is transformed into an equivalent multilevel programs having a single leader and single follower at each level of the hierarchy. The proposed solution approach can solve multilevel multi-leader multi-follower problems whose objective values in both levels have common, but having different positive weights of, nonseparable terms.

Keywords

Multilevel multi-leader multi-follower programming Multilevel programming Multi-parametric programming Branch-and-bound 

References

  1. 1.
    Başar, T., Olsder, G.: Dynamic Noncooperative Game Theory. Classics in Applied Mathematics. SIAM, Philadelphia (1999)zbMATHGoogle Scholar
  2. 2.
    Ehrenmann, A.: Equilibrium problems with equilibrium constraints and their applications in electricity markets. Dissertation, Judge Institute of Management, Cambridge University, Cambridge, UK (2004)Google Scholar
  3. 3.
    Ehrenmann, A.: Manifolds of multi-leader Cournot equilibria. Oper. Res. Lett. 32, 121–125 (2004)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I, 1st edn. Springer, New York (2003)zbMATHGoogle Scholar
  5. 5.
    Faísca, N.P., Saraiva, M.P., Rustem, B., Pistikopoulos, N.E.: A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems. Comput. Manag. Sci. 6, 377–397 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Kassa, A.M., Kassa, S.M.: A branch-and-bound multi-parametric programming approach for general non-convex multilevel optimization with polyhedral constraints. J. Glob. Optim. 64(4), 745–764 (2016)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Kassa, A.M., Kassa, S.M.: Deterministic solution approach for some classes of nonlinear multilevel programs with multiple follower. J. Glob. Optim. 68(4), 729–747 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Kulkarni, A.A.: Generalized Nash games with shared constraints: existence, efficiency, refinement and equilibrium constraints. Ph.d. Dissertation, Graduate College of the University of Illinois, Urbana, Illinois (2010)Google Scholar
  9. 9.
    Kulkarni, A.A., Shanbhag, U.V.: An existence result for hierarchical stackelberg v/s stackelberg games. IEEE Trans. Autom. Control 60(12), 3379–3384 (2015)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Leyffer, S., Munson, T.: Solving multi-leader-common-follower games. Optim. Methods Softw. 25(4), 601–623 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Okuguchi, K.: Expectations and stability in oligopoly models. In: Lecture Notes in Economics and Mathematical Systems, vol. 138. Springer, Berlin (1976)Google Scholar
  12. 12.
    Pang, J.S., Fukushima, M.: Quasi-variational inequalities, generalized nash equilibria, and multi-leader-follower games. Comput. Manag. Sci. 2(1), 21–56 (2005)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Pang, J.S., Fukushima, M.: Quasi-variational inequalities, generalized nash equilibria, and multi-leader-follower games. Comput. Manag. Sci. 6, 373–375 (2009)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Sherali, H.D.: A multiple leader stackelberg model and analysis. Oper. Res. 32(2), 390–404 (1984)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Su, C.L.: A sequential ncp algorithm for solving equlibrium problems with equilibrium constraints. Technical report, Department of Management Science and Engineering, Stanford University (2004)Google Scholar
  16. 16.
    Su, C.L.: Analysis on the forward market equilibrium model. Oper. Res. Lett. 35(1), 74–82 (2007)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Sun, L.: Equivalent bilevel programming form for the generalized nash equilibrium problem. J. Math. Res. 2(1), 8–13 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of MathematicsAddis Ababa UniversityAddis AbabaEthiopia
  2. 2.Department of Mathematics and Statistical SciencesBotswana International University of Science and TechnologyPalapyeBotswana

Personalised recommendations