Network games with and without synchroneity

DOI10.1007/978-3-642-25280-8_9MaRDI QIDQ3098096zbMATH OpenOpenAlexFDO

Authors Ahmad Termimi Ab Ghani, Kazuyuki Tanaka

Publication date 11 November 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25280-8_9

zbMATH Keywords

asynchronous gameNash equilibriumnetwork game

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Noncooperative games (91A10) Other game-theoretic models (91A40) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• A network game with attackers and a defender
• Algorithms and Computation
• A game on a distributed network.
• Impact of asynchrony on the behavior of rational selfish agents
• Connected subgraph defense games

Cites work

• Algorithms and Computation
• Equilibrium points in n -person games
• scientific article; zbMATH DE number 3368497 (Why is no real title available?)
• Non-cooperative games
• On Representatives of Subsets
• The determinacy of Blackwell games
• The Price of Defense

Cited in

(7)

• Timed network games
• How many attackers can selfish defenders catch?
• The price of defense
• Network Games with Atomic Players
• Potential game approach to virus attacks in network with general topology
• Impact of asynchrony on the behavior of rational selfish agents
• Synchronization in security games

This page was built for publication: Network games with and without synchroneity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098096)