Oligopolistic Banking Sector of Mongolia and Polymatrix Games of Three Players
A problem of competition between the three largest banks of the Mongolia major crediting sector is investigated. Modeling of the conflict is carried out using the apparatus of three person polymatrix games (hexamatrix games). To find a Nash equilibrium in the constructed game we use an approach based on its reduction to a nonconvex optimization problem with bilinear structure in the objective function. To solve the latter problem we apply Global Search Theory due to A. S. Strekalovsky. According to the theory, local and global search algorithms for formulated game are developed. Local search method is based on the idea of sequential solving of auxiliary linear programming problems followed from the formulation of the problem. Global search based on a specific Global Search Strategy in the d.c. maximization problems as the objective function of the reduced optimization problem can be represented as a difference of two convex functions. The results of a computational simulation is presented and analized.
1. Bazaraa M.S., Shetty C.M. Nonlinear Programming: Theory and Algorithms. NewYork, John Wiley & Sons,;1979.
2. Vasilyev F.P. Optimization Methods (in Russian). Moscow, Factorial Press, 2002.
3. Vasin А.А., Morozov V.V. Game theory and models of mathematical economics(in Russian). Moscow, MAKS Press, 2005, 272 p.
4. Mazalov V. Mathematical Game Theory and Applications. New York, John Wiley& Sons,;2014, 432 p.
5. Von Neumann J., Morgenstern O. Theory of Games and Economic Behavior.Princeton, NJ, Princeton University Press, 1944.
6. Orlov A.V., Strekalovsky A.S. Numerical search for equilibria in bimatrix games.Computational Mathematics and Mathematical Physics, 2005, vol. 45, no 6,pp. 947–960.
7. Orlov A.V. Numerical solution of bilinear programming problems. ComputationalMathematics and Mathematical Physics, 2008, vol. 48, no 2, pp. 225-241.
8. Strekalovsky A.S., Orlov A.V. Bimatrix games and bilevel programming (inRussian). Moscow, Fizmatlit, 2007. 224 p.
9. Strekalovsky A.S., Orlov A.V., Malyshev A.V. A local search for the quadraticlinearbilevel programming problem. Numerical Analysis and Applications, 2010,vol. 3, no 1, pp. 59–70.
10. Strekalovsky A.S., Orlov A.V. A new approach to nonconvex optimization.Numerical Methods and Programming, 2007, vol. 8, no 2, pp. 11–27.
11. Strekalovsky A.S., Enkhbat R. Polymatrix games and optimization problems.Automation and Remote Control, 2014, vol. 75, no 4, pp. 632–645.
12. Strekalovsky A.S., Orlov A.V., Malyshev A.V. Numerical solution of a class ofbilevel programming problems . Numerical Analysis and Applications, 2010, vol. 3,no 2, pp. 165–173.
13. Strekalovsky A.S. Elements of nonconvex optimization (in Russian). Novosibirsk,Nauka, 2003. 356 p.
14. Yanovskaya E.B. Equilibrium points in polymatrix games (in Russian). Latv. Math.Collect., 1968, no 8, pp. 381–384.
15. Horst R., Tuy H. Global Optimization. Deterministic Approaches. Berlin, Springer-Verlag, 1993.
16. MATLAB — The Language of Technical Computing. Natick, MA, The MathWorks,Inc. URL: http://www.mathworks.com/products/matlab/. Accessed 27 November2014.
17. Mongol Bank. Poll conducted among bank lenders and research, 2013.
18. Orlov A.V., Strekalovsky A.S., Batbileg S. On computational search forNash equilibrium in hexamatrix games. Optimization Letters, 2014, DOI:10.1007/s11590-014-0833-8 (published online).
19. Strekalovsky A.S., Orlov A.V., Malyshev A.V. On computational search foroptimistic solutions in bilevel problems. J. Glob. Optim, 2010, vol. 48, no 1,pp. 159–172.
20. Strekalovsky A. S. On solving optimization problems with hidden nonconvexstructures. In: Rassias, T.M., Floudas, C.A., Butenko, S. (eds.) Optimization inScience and Engineering, New York, Springer, 2014, pp. 465–502.