Pure Strategy Nash Equilibria Refinement in Bimatrix Games by Using Domination Efficiency along with Maximin and the Superoptimality Rule
نویسندگان
چکیده
منابع مشابه
On proper refinement of Nash equilibria for bimatrix games
In this paper, we introduce the notion of set of ε-proper equilibria for a bimatrix game. We define a 0–1 mixed quadratic program to generate a sequence of ε-proper Nash equilibria and show that the optimization results provide reliable indications on strategy profiles that could be used to generate proper equilibria analytically. This approach can be generalized in order to find at least one p...
متن کاملSemidefinite Programming and Nash Equilibria in Bimatrix Games
We explore the power of semidefinite programming (SDP) for finding additive -approximate Nash equilibria in bimatrix games. We introduce an SDP relaxation for a quadratic programming formulation of the Nash equilibrium (NE) problem and provide a number of valid inequalities to improve the quality of the relaxation. If a rank-1 solution to this SDP is found, then an exact NE can be recovered. We...
متن کاملNew Algorithms for Approximate Nash Equilibria in Bimatrix Games
We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achieves a 0.38197-approximation, which is exactly the same factor as the algorithm of Daskalakis, Mehta and Papadimitriou.This algorithm is then ...
متن کاملApproximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games
The ε-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than ε to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant ε currently known for which there is a polynomial-time algorithm that computes an ε-well-supported Nash equilibrium in bimatrix games is slightly belo...
متن کاملOn Pure Nash Equilibria in Stochastic Games
Ummels andWojtczak initiated the study of findingNash equilibria in simple stochastic multi-player games satisfying specific bounds. They showed that deciding the existence of pure-strategy Nash equilibria (pureNE)where a fixed player wins almost surely is undecidable for games with 9 players. They also showed that the problem remains undecidable for the finite-strategy Nash equilibrium (finNE)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Bulletin of the National Technical University of Ukraine "Kyiv Politechnic Institute"
سال: 2018
ISSN: 2519-8890,1810-0546
DOI: 10.20535/1810-0546.2018.3.123853