Abstract
We consider a finite game of several players in a normal form with perturbed linear payoffs where perturbations formed by a set of additive matrices, with two arbitrary Hölder norms specified independently in the outcome and criterion spaces. The concept of equilibrium is generalized using the coalitional profile, i.e. by partitioning the players of the game into coalitions. In this situation, two extreme cases of this partitioning correspond to the Pareto optimal outcome and the Nash equilibrium outcome, respectively. We analyze such type of stability, called strong stability, that is under any small admissible perturbations the efficiency of at least one optimal outcome of the game is preserved. The attainable upper and lower bounds of such perturbations are specified. The obtained result generalizes some previously known facts and sheds more light on the combinatorial specific of the problem considered. Some numerical examples illustrating the main result are specified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aubin, J.-P., Frankowska, H.: Set-Valued Analysis. Birkhäuser, Basel (1990)
Emelichev, V., Girlich, E., Nikulin, Yu., Podkopaev, D.: Stability and regularization of vector problem of integer linear programming. J. Optim. 51, 645–676 (2002). https://doi.org/10.1080/0233193021000030760
Emelichev, V., Kotov, V., Kuzmin, K., Lebedeva, N., Semenova, N.: Stability and effective algorithms for solving multiobjective discrete optimization problems with incomplete information. J. Autom. Inf. Sci. 46, 27–41 (2014). https://doi.org/10.1615/JAutomatInfScien.v46.i2.30
Emelichev, V., Nikulin Y.: Finite Games with Perturbed Payoffs. In: Olenev N., Evtushenko Y., Khachay M., Malkova V. (eds): Advances in Optimization and Applications, 11th International Conference, OPTIMA 2020, Moscow, Russia, 28 September–2 October 2020, Revised Selected Papers. CCIS, vol. 1340, pp. 158–169. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-65739-0
Emelichev, V., Nikulin, Y.: Strong stability measures for multicriteria quadratic integer programming problem of finding extremum solutions. Comput. Sci. J. Moldova 26, 115–125 (2018)
Nash, J.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. U.S.A. 36, 48–49 (1950)
Nash, J.: Non-cooperative games. Ann. Math. 54, 286–295 (1951)
Noghin, V.: Reduction of the Pareto Set: An Axiomatic Approach. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-67873-3
Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)
Sergienko, I., Shilo, V.: Discrete Optimization Problems. Research. Naukova dumka, Kiev, Problems, Methods (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Nikulin, Y., Emelichev, V. (2021). Strong Stability in Finite Games with Perturbed Payoffs. In: Strekalovsky, A., Kochetov, Y., Gruzdeva, T., Orlov, A. (eds) Mathematical Optimization Theory and Operations Research: Recent Trends. MOTOR 2021. Communications in Computer and Information Science, vol 1476. Springer, Cham. https://doi.org/10.1007/978-3-030-86433-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-86433-0_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86432-3
Online ISBN: 978-3-030-86433-0
eBook Packages: Computer ScienceComputer Science (R0)