Results 31 to 40 of about 757 (200)
CoRR, 2017 Although the definition of what empathetic preferences exactly are is still evolving, there is a general consensus in the psychology, science and engineering communities that the evolution toward players' behaviors in interactive decision-making problems will be accompanied by the exploitation of their empathy, sympathy, compassion, antipathy ...
Brian Powers +2 more
openaire +2 more sources
A notion of prominence for games with natural‐language labels
Quantitative Economics, Volume 12, Issue 1, Page 283-312, January 2021., 2021 We study games with natural‐language labels (i.e., strategic problems where options are denoted by words), for which we propose and test a measurable characterization of prominence. We assume that—ceteris paribus—players find particularly prominent those strategies that are denoted by words more frequently used in their everyday language.
Alessandro Sontuoso, Sudeep Bhatia
wiley +1 more source
Наукові вісті Національного технічного університету України "Київський політехнічний інститут", 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
Наукові вісті Національного технічного університету України "Київський політехнічний інститут", 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
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
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 +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
Learning Automata with Artificial Reflecting Barriers in Games with Limited Information
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2022 This paper deals with the problem of solving stochastic games (which have numerous business and economic applications), using the interesting tools of Learning Automata (LA), the precursors to Reinforcement Learning (RL).
Ismail Hassan +2 more
doaj +1 more source