Results 151 to 160 of about 135,998 (196)

The problem of the nash equilibrium situation in a positional n-person game with a memory

Journal of Applied Mathematics and Mechanics, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu.E. Chistyakov
openaire   +3 more sources

A case where a paradox like Braess's occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium - a situation of load balancing in distributed computer systems

Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), 2003
The Braess paradox which was originally identified and observed in road traffic context, shows that it may happen that by adding capacity to the network, the performance of all users degrades. This paradox has long been known in a framework called the Wardrop equilibrium, in which there are infinitely many individuals and in which the decision of one ...
H. Kameda, E. Altman, T. Kozawa
openaire   +2 more sources

Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric

Discrete Mathematics and Applications, 2009
Summary: We consider a finite cooperative game of several players with parametric principle of optimality such that the relations between players in a coalition are based on the Pareto maximum. The introduction of this principle allows us to find a link between such classical concepts as the Pareto optimality and the Nash equilibrium.
Emelichev, V. A., Karelkina, O. V.
openaire   +3 more sources

An equilibrium in group decision and its association with the Nash equilibrium in game theory

Computers & industrial engineering, 2020
An equilibrium for group decision is introduced, and its association with the Nash equilibrium in game theory is examined. The experts’ preferences in the group decision situation are assumed to be ties-permitted ordinal rankings and represented by ...
Fujun Hou, Yubing Zhai, Xinli You
semanticscholar   +1 more source

Distributed Nash Equilibrium Computation for Mixed-order Multi-player Games

2020 IEEE 16th International Conference on Control & Automation (ICCA), 2020
Noticing that agents with different dynamics may work together, this paper considers Nash equilibrium computation for a class of games in which first-order integrator-type players and second-order integrator-type players interact in a distributed network.
Jizhao Yin, Maojiao Ye
semanticscholar   +1 more source

Capacity choice game in a multiserver queue: Existence of a Nash equilibrium

Naval Research Logistics, 2019
In many congestion‐prone services, front‐line employees have discretion over the rate at which they serve customers. To evaluate the impact of queue pooling on their decisions, we model the situation as a two‐server, single‐queue symmetric capacity ...
M. Armony, G. Roels, Hummy Song
semanticscholar   +1 more source

Generalized Nash Equilibrium Model of the Service Provisioning Problem in Multi-Cloud Competitions

2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), 2018
With the development of cloud computing, heterogeneous service providers can publish services in the cloud market under the multi-cloud environment. As the cloud market expands, the relationship between service providers and users is changing.
Peini Liu, Xinjun Mao, Fu Hou, Shuai Zhang   +3 more
semanticscholar   +1 more source

Multiplayer Pursuit-Evasion Games With Distributed Nash Equilibrium Solution

IEEE Transactions on Network Science and Engineering
This paper concentrates on solving the multiplayer pursuit-evasion (MPE) game issue. In the existing MPE game framework, the fact that the Nash equilibrium and distribution are two contradicting properties which can not be achieved simultaneously.
Wenqi Xu, Tong Wang, Jianbin Qiu, Xiaoping Liu   +3 more
semanticscholar   +1 more source

Synchronization in Learning in Periodic Zero-Sum Games Triggers Divergence from Nash Equilibrium

AAAI Conference on Artificial Intelligence
Learning in zero-sum games studies a situation where multiple agents competitively learn their strategy. In such multi-agent learning, we often see that the strategies cycle around their optimum, i.e., Nash equilibrium.
Yuma Fujimoto, Kaito Ariu, Kenshi Abe
semanticscholar   +1 more source

Computing Nash Equilibrium in Interdependent Defense Games

AAAI Conference on Artificial Intelligence, 2015
Roughly speaking, Interdependent Defense (IDD) games, previously proposed, model the situation where an attacker wants to cause as much damage as possible to a network by attacking one of the sites in the network.
Hau Chan, Luis E. Ortiz
semanticscholar   +1 more source