Computing the Bargaining Approach for Equalizing the Ratios of Maximal Gains in Continuous-Time Markov Chains Games

This paper presents a novel approach for computing the Kalai–Smorodinsky bargaining equilibrium for continuous time and discrete states Markov chains games. To solve the bargaining situation we set the disagreement point as the Nash equilibrium of the problem, then to find the new agreement point we follow the bargaining model presented by Kalai–Smorodinsky employing the utopia point concept. We exemplify the game formulation in terms of nonlinear programming equations implementing the Lagrange principle. The Tikhonov’s regularization method is applied to ensure the convergence of the cost-functions to an equilibrium point. For solving the problem we use a programming method implemented by the extraproximal optimization approach. The proposed method is validated by a numerical example related to the labor market problem for a three-person bargaining problem.