Por favor, use este identificador para citar o enlazar este ítem:
http://repositoriodigital.ipn.mx/handle/123456789/23414
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Clempner Kerik, Julio Bernardo | - |
dc.contributor.author | Trejo, Kristal | - |
dc.contributor.author | Poznyak, Alexander | - |
dc.date.accessioned | 2017-10-03T17:42:56Z | - |
dc.date.available | 2017-10-03T17:42:56Z | - |
dc.date.issued | 2017-07-14 | - |
dc.identifier.uri | http://repositoriodigital.ipn.mx/handle/123456789/23414 | - |
dc.description.abstract | A classical bargaining situation involves two individuals who have the opportunity to collaborate for mutual bene t. In this paper we present a novel approach for computing the Nash bargaining equilibrium for controllable Markov chains games. We follow the solution introduced by Nash considering the disagreement point as the Nash equilibrium of the problem. For solving the bargaining process we consider the game formulation in terms of nonlinear programming equations implementing the regularized Lagrange method. For computing the equilibrium point we employ the extraproximal optimization approach. We present the convergence and rate of convergence of the method. Finally a numerical example for a two-person bargaining situation illustrates the efectiveness of the method. | es |
dc.language.iso | en | es |
dc.publisher | The International Federation of Automatic Control | es |
dc.subject | Controlled Markov chains | es |
dc.subject | bargaining | es |
dc.subject | optimization | es |
dc.subject | Nash | es |
dc.subject | game theory | es |
dc.title | Nash Bargaining Equilibria for Controllable Markov Chains Games | es |
dc.type | Preprint | es |
Aparece en las colecciones: | Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2036.pdf | Nash Bargaining Equilibria for Controllable Markov Chains Games | 389.5 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.