Results 31 to 40 of about 1,067,568 (299)
Nash equilibrium seeking over directed graphs
In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a proportional ...
Yutao Tang +3 more
doaj +1 more source
A hierarchical model of a vector Nash equilibrium search under uncertainty is developed. The sufficient conditions for a vector Nash equilibrium of a noncooperative game under uncertainty are formulated, which can be used as a criterion to achieve the ...
Vladimir A. Serov, Evgeny M. Voronov
doaj +1 more source
Deterministic calibration and Nash equilibrium
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kakade, Sham M, Foster, Dean P
openaire +4 more sources
Auctioning the Right to Play Ultimatum Games and the Impact on Equilibrium Selection
We auction scarce rights to play the Proposer and Responder positions in ultimatum games. As a control treatment, we randomly allocate these rights and charge exogenous participation fees.
Jason Shachat, J. Todd Swarthout
doaj +1 more source
Research on collision-preventing decisions of oncoming vehicles
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
Characterization of Nash Equilibrium Strategy for Heptagonal Fuzzy Games
In this paper, the Nash equilibrium strategy of two-person zero-sum games with heptagonal fuzzy payoffs is considered and the existence of Nash equilibrium strategy is studied.
F. Madandar +2 more
doaj +2 more sources
Methods for Solving Generalized Nash Equilibrium
The generalized Nash equilibrium problem (GNEP) is an extension of the standard Nash equilibrium problem (NEP), in which each player's strategy set may depend on the rival player's strategies. In this paper, we present two descent type methods.
Biao Qu, Jing Zhao
doaj +1 more source
This dataset includes 204,350,000 games in normal form played by two agents that have the choice between three strategies each, as well as 100,000 games in normal form played by four agents that have the choice between three strategies each.
Ghislain Fourny, Felipe Sulser
doaj +1 more source
Computing Good Nash Equilibria in Graphical Games [PDF]
This paper addresses the problem of fair equilibrium selection in graphical games. Our approach is based on the data structure called the {\em best response policy}, which was proposed by Kearns et al.~\cite{kls} as a way to represent all Nash equilibria
Elkind, Edith +2 more
core +2 more sources
In this paper, we examine a sampled-data Nash equilibrium strategy for a stochastic linear quadratic (LQ) differential game, in which admissible strategies are assumed to be constant on the interval between consecutive measurements.
Vasile Drăgan +3 more
doaj +1 more source

