Results 31 to 40 of about 1,721 (242)

Pedestrian motion modelled by Fokker–Planck Nash games [PDF]

Royal Society Open Science, 2017
A new approach to modelling pedestrians' avoidance dynamics based on a Fokker–Planck (FP) Nash game framework is presented. In this framework, two interacting pedestrians are considered, whose motion variability is modelled through the corresponding ...
S. Roy, A. Borzì, A. Habbal
doaj   +1 more source

Inefficiency of Nash Equilibria [PDF]

Mathematics of Operations Research, 1986
It is shown that Nash Equilibria of smooth games generally tend to be inefficient in the Pareto sense.
openaire   +2 more sources

A Branch-and-Bound Algorithm for Polymatrix Games ϵ-Proper Nash Equilibria Computation

Algorithms, 2021
When several Nash equilibria exist in the game, decision-makers need to refine their choices based on some refinement concepts. To this aim, the notion of a ϵ-proper equilibria set for polymatrix games is used to develop 0–1 mixed linear programs and ...
Slim Belhaiza
doaj   +1 more source

Credibilistic Loss Aversion Nash Equilibrium for Bimatrix Games with Triangular Fuzzy Payoffs

Complexity, 2018
Inspired by Shalev’s model of loss aversion, we investigate the effect of loss aversion on a bimatrix game where the payoffs in the bimatrix game are characterized by triangular fuzzy variables.
Chunsheng Cui, Zhongwei Feng, Chunqiao Tan   +2 more
doaj   +1 more source

Fixed points as Nash equilibria

Fixed Point Theory and Applications, 2006
The existence of fixed points for single or multivalued mappings is obtained as a corollary of Nash equilibrium existence in finitely many players games.
Juan Pablo Torres-Martínez
doaj   +2 more sources

On a Fixed Point Theorem for General Multivalued Mappings on Finite Sets with Applications in Game Theory

Journal of Mathematics, 2022
We propose a new fixed point theorem that completely characterizes the existence of fixed points for multivalued maps on finite sets. Our result can be seen as a generalization of Abian’s fixed point theorem.
Shravan Luckraz
doaj   +1 more source

Learning Nash Equilibria [PDF]

SSRN Electronic Journal, 2012
In the paper, we re-investigate the long run behavior of an adaptive learning process driven by the stochastic replicator dynamics developed by Fudenberg and Harris (1992). It is demonstrated that the Nash equilibrium will be the robust limit of the adaptive learning process as long as it is reachable for the learning dynamics in almost surely finite ...
openaire   +1 more source

Nash equilibria sets in mixed extended 2x3 games [PDF]

Computer Science Journal of Moldova, 2005
We describe the Nash equilibria set as an intersection of best response graphs. The problem of Nash equilibria set construction for \hbox{two-person} mixed extended 2x3 games is studied.
Valeriu Ungureanu, Ana Botnari
doaj  

Acyclic-and-Asymmetric Payoff Triplet Refinement of Pure Strategy Efficient Nash Equilibria in Trimatrix Games by Maximinimin and Superoptimality

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

Nash equilibria sets in mixed extension of 2x2x2 games [PDF]

Computer Science Journal of Moldova, 2005
We describe the Nash equilibria set as an intersection of graphs of players' best responses. The problem of Nash equilibria set construction for three-person extended 2 2 2 games is studied.
Valeriu Ungureanu, Ana Botnari
doaj