Results 31 to 40 of about 234,236 (303)
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [PDF]
Recent developments in domains such as non-local games, quantum interactive proofs, and quantum generative adversarial networks have renewed interest in quantum game theory and, specifically, quantum zero-sum games.
Francisca Vasconcelos +4 more
doaj +1 more source
Market Trading Model of Urban Energy Internet Based on Tripartite Game Theory
As an important driving force to promote the energy revolution, the emergence of the energy internet has provided new ideas for the marketization and flexibility of multi-energy transactions.
Jun Liu +4 more
doaj +1 more source
Dynamics to equilibrium in network games: individual behavior and global response. [PDF]
Various social contexts can be depicted as games of strategic interactions on networks, where an individual's welfare depends on both her and her partners' actions.
Giulio Cimini +2 more
doaj +1 more source
We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a certain objective function, in the context of a selfish routing game. Specifically, we assume a collection of nusers, each employing a mixed strategy, which is a probability distribution over m parallel links, to control the ...
Martin Gairing +4 more
openaire +2 more sources
Computing Cournot-Nash Equilibria [PDF]
This paper examines convergence criteria of an algorithm for the computation of Cournot-Nash economic equilibria. The method is based on formulating the equilibrium problem as that of finding a solution to a nonlinear complementarity problem, solved by sequential linearization and Lemke's algorithm.
Charles D. Kolstad, Lars Mathiesen
openaire +2 more sources
Pedestrian motion modelled by Fokker–Planck Nash games [PDF]
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
A Distributed Algorithm for Optimising over Pure Strategy Nash Equilibria
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
A Branch-and-Bound Algorithm for Polymatrix Games ϵ-Proper Nash Equilibria Computation
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
A Note on Approximate Nash Equilibria
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constantinos Daskalakis +2 more
openaire +2 more sources
Credibilistic Loss Aversion Nash Equilibrium for Bimatrix Games with Triangular Fuzzy Payoffs
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 +2 more
doaj +1 more source

