Acyclic-and-Asymmetric Payoff Triplet Refinement of Pure Strategy Efficient Nash Equilibria in Trimatrix Games by Maximinimin and Superoptimality

Background. A problem of selecting amongst efficient Nash equilibria is solved by refining them. The existing approaches to refining do not guarantee that the refined efficient Nash equilibrium will be single. Nevertheless, a novel approach to refining pure strategy efficient Nash equilibria in bima...

Full description

Bibliographic Details
Main Author: Vadim V. Romanuke
Format: Article
Language:English
Published: Igor Sikorsky Kyiv Polytechnic Institute 2018-09-01
Series:Наукові вісті Національного технічного університету України "Київський політехнічний інститут"
Subjects:
Online Access:http://bulletin.kpi.ua/article/view/131696