Network Games with and without Synchroneity

DOI10.1007/978-3-642-25280-8_9zbMath1349.91067OpenAlexW2156349933MaRDI QIDQ3098096

Kazuyuki Tanaka, Ahmad Termimi Ab Ghani

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

Nash equilibriumnetwork gameasynchronous game

Mathematics Subject Classification ID

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

Related Items (2)

The price of defense ⋮ How many attackers can selfish defenders catch?

Cites Work

• Unnamed Item
• Non-cooperative games
• The determinacy of Blackwell games
• On Representatives of Subsets
• The Price of Defense
• Equilibrium points in n -person games
• Algorithms and Computation

This page was built for publication: Network Games with and without Synchroneity