Results 21 to 30 of about 2,154,790 (237)

Research on collision-preventing decisions of oncoming vehicles

open access: yesAdvances in Mechanical Engineering, 2016
An emergency collision-preventing model is proposed for two vehicles driving from opposite directions. To study the impact of drivers’ strategies on traffic safety in this model, the relevant knowledge of game theory has been introduced.
Hongfei Liu, Ligang Wang, Huan Liu
doaj   +1 more source

Pure Strategy Nash Equilibria Refinement in Bimatrix Games by Using Domination Efficiency along with Maximin and the Superoptimality Rule

open access: yesНаукові вісті Національного технічного університету України "Київський політехнічний інститут", 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

open access: yesAIP 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

Comparative Research on the Game Behavior of the Participants in the Traditional Supply Chain Finance and the Supply Chain Finance on the Blockchain

open access: yesDiscrete 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

Coordination Games on Directed Graphs [PDF]

open access: yesElectronic 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

Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types [PDF]

open access: yes, 2012
We extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-Nash equilibria in private-value games of incomplete information with finite actions and continuous types (G-FACTs). We prove that, if the frequency distribution of
Rabinovich, Zinovi   +9 more
core   +1 more source

Learning Automata with Artificial Reflecting Barriers in Games with Limited Information

open access: yesProceedings 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]

open access: yesLogical 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

Optimal strategy of the simultaneous dice game Pig for multiplayers: when reinforcement learning meets game theory

open access: yesScientific 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

A Distributed Algorithm for Optimising over Pure Strategy Nash Equilibria

open access: yes, 2010
We develop an efficient algorithm for computing pure strategy Nash equilibria that satisfy various criteria (such as the utilitarian or Nash--Bernoulli social welfare functions) in games with sparse interaction structure.
Jennings, Nicholas R.   +4 more
core   +2 more sources

Home - About - Disclaimer - Privacy