Results 21 to 30 of about 2,111 (192)
Наукові вісті Національного технічного університету України "Київський політехнічний інститут", 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
Geometrical regret matching: A new dynamics to Nash equilibrium
AIP Advances, 2020 We argue that the existing regret matchings for Nash equilibrium approximation conduct “jumpy” strategy updating when the probabilities of future plays are set to be proportional to positive regret measures.
Sizhong Lan
doaj +1 more source
Discrete Dynamics in Nature and Society, 2022 The authors took the financing warehouse in supply chain finance as an example, used the game between capital providers (banks and their entrusted logistics supervision enterprises) and capital demanders (core enterprises of supply chain, upstream ...
Yong Luo, Yanhong Tang
doaj +1 more source
Corrigendum to “On the Existence of Pure and Mixed Strategy Nash Equilibrium in Discontinuous Games”
Econometrica, 2022 No ...
Ewerhart, Christian, Reny, Philip J
openaire +2 more sources
Coordination Games on Directed Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their ...
Krzysztof R. Apt +2 more
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
The Complexity of Nash Equilibria in Stochastic Multiplayer Games [PDF]
Logical Methods in Computer Science, 2011 We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to ...
Michael Ummels, Dominik Wojtczak
doaj +1 more source
Scientific Reports, 2023 In this work, we focus on using reinforcement learning and game theory to solve for the optimal strategies for the dice game Pig, in a novel simultaneous playing setting.
Tian Zhu, Merry Ma, Lu Chen, Zhenhua Liu
doaj +1 more source
Pure Nash Equilibrium in a Capacitated Selfish Resource Allocation Game
IEEE Transactions on Control of Network Systems, 2018 A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize his or her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when ...
Seyed Rasoul Etesami, Tamer Basar
openaire +1 more source
MathematicsThe Nash equilibrium is a central concept in game theory, widely used across economics, social sciences, computer science, and artificial intelligence. However, computing Nash equilibria, especially in multi-player games, is a complex and computationally
Jiajia Yang +3 more
doaj +1 more source