Results 41 to 50 of about 561,032 (197)
Наукові вісті Національного технічного університету України "Київський політехнічний інститут", 2018 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.
Vadim V. Romanuke
doaj +1 more source
One class of Nash equilibria in bimatrix games
Lietuvos Matematikos Rinkinys, 2002 Active Nash equilibria existence in bimatrix game problem is reduced to the problem of nonexistence of special solutions of the systems (11) and (12).
Aneta Gracjana Blaževič +1 more
doaj +3 more sources
Characterization of the Equilibrium Strategy of Fuzzy Bimatrix Games Based on L-R Fuzzy Variables
Journal of Applied Mathematics, 2012 This paper deals with bimatrix games in uncertainty environment based on several types of ordering, which Maeda proposed. But Maeda’s models was just made based on symmetrical triangle fuzzy variable.
Cun-lin Li
doaj +1 more source
Наукові вісті Національного технічного університету України "Київський політехнічний інститут", 2018 Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem is solved by refining the equilibria. However, none of the existing refinements can guarantee a single refined Nash equilibrium.
Vadim V. Romanuke
doaj +1 more source
Journal of Applied Mathematics, 2013 The aim of this paper is to develop a bilinear programming method for solving bimatrix games in which the payoffs are expressed with trapezoidal intuitionistic fuzzy numbers (TrIFNs), which are called TrIFN bimatrix games for short.
Deng-Feng Li, Jie Yang
doaj +1 more source
Games of fixed rank: a hierarchy of bimatrix games [PDF]
Economic Theory, 2009 We propose a new hierarchical approach to understand the complexity of the open problem of computing a Nash equilibrium in a bimatrix game. Specifically, we investigate a hierarchy of bimatrix games $(A,B)$ which results from restricting the rank of the matrix $A+B$ to be of fixed rank at most $k$.
Ravi Kannan, Thorsten Theobald
openaire +5 more sources
On ‘Informationally Robust Equilibria’ for Bimatrix Games [PDF]
Economic Theory, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reijnierse, J.H. +2 more
openaire +6 more sources
Research of the problem of fair distribution of fishing quotas by the methods of game theory
Современная математика: Фундаментальные направления, 2023 Game theory emerged as a science in the second half of the 20th century. It managed to prove itself well in the analysis of economic situations involving several subjects of economic activity (players), whose interests are completely or partially ...
E. M. Bogatov, N. E. Bogatova
doaj +1 more source
The empirical implications of rank in Bimatrix games [PDF]
Proceedings of the fourteenth ACM conference on Electronic commerce, 2013 We study the structural complexity of bimatrix games, formalized via rank, from an empirical perspective. We consider a setting where we have data on player behavior in diverse strategic situations, but where we do not observe the relevant payoff functions.
Siddharth Barman +3 more
openaire +4 more sources
The method of feasible directions in problems nonlinear programming for bimatrix games [PDF]
Компьютерные исследования и моделирование, 2012 The problem of the Nash equilibrium in bimatrix game is considered. The search for a solution is associated with a problem of nonlinear programming. Application of the method of feasible directions for the solution of such a problem is investigated.
Dariya Sergeevna Nabatova
doaj +1 more source