Results 211 to 220 of about 127,162 (255)

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 ...
Mor Armony, G. Roels, Hummy Song
semanticscholar   +1 more source

A Generalization of Weighted Congestion Game and its Nash Equilibrium Seeking

Cybersecurity and Cyberforensics Conference, 2018
In this paper, a variation of the congestion situation and the associated weighted congestion games are considered. By using semi-tensor product of matrices, the structure and algebraic representation of resulted game are investigated.
Shuting Le, Yuhu Wu, Ximing Sun
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   +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

Two-person simple bargaining games: the Nash solution

1977
Definitions and assumptions We will first consider only vocal cooperative games. We make the following assumptions. The two players can achieve any payoff vector u = ( u 1 , u 2 ) within the payoff space P of the game, if they can agree which particular payoff vector u to adopt, i.e., if they can agree how to divide the payoffs between
openaire   +2 more sources

Nash Equilibrium Solution for Communication in Strategic Competition Adopted by Zigbee Network for Micro Grid

International Conference on Information Science and Applications, 2018
Seung-Mo Je, Jun-Ho Huh
semanticscholar   +1 more source

On equilibrium situations in the sense of Nash

The paper presents a theorem on the existence of Nash equilibria for non- cooperative games, if the sets of possible strategies are convex compact and subspaces of Banach spaces, but the utility function is continuous and quasiconcave.
openaire   +1 more source

Home - About - Disclaimer - Privacy