Deterministic graphical games

DOI10.1016/0022-247X(90)90267-JMaRDI QIDQ2277168zbMATH OpenFDO

Authors Alan Washburn

Publication date 1990

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(90)90267-J

zbMATH Keywords

calculation of equilibriafinite directed graphsperfect information

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) 2-person games (91A05) Games involving graphs (91A43)

Review text

The author studies antagonistic games of perfect information played on finite directed graphs. The possibility of infinite play is not excluded. An efficient algorithm for calculating an equilibrium point of the game is presented and analyzed. Similar games, even on not necessarily finite graphs, have been studied in detail, but not from the computational point of view, by \textit{B. Kummer} [``Spiele auf Graphen (1980; Zbl 0486.90086)].

Recommendations

• Infinite Deterministic Graphical Games
• Deterministic Graphical Games Revisited
• Deterministic graphical games revisited
• Equilibria in nonantagonistic positional games on graphs and searching for them
• scientific article; zbMATH DE number 440583

Cites work

• Graphs and composite games
• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 3128732 (Why is no real title available?)
• scientific article; zbMATH DE number 3128734 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3302001 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Prohibiting repetitions makes playing games substantially harder
• Stochastic Games

Cited in

(21)

• Cycles in extensive form perfect information games
• Games, kernels, and antitone operations
• An average polynomial algorithm for solving antagonistic games on graphs
• A three-person deterministic graphical game without Nash equilibria
• Monotone bargaining is Nash-solvable
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• The Complexity of Nash Equilibria in Limit-Average Games
• scientific article; zbMATH DE number 440583 (Why is no real title available?)
• Nonmonotone game labellings
• A Retrograde Approximation Algorithm for Multi-player Can’t Stop
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
• Infinite Deterministic Graphical Games
• scientific article; zbMATH DE number 1047712 (Why is no real title available?)
• Strategic games on digraphs
• Selfish cops and passive robber: qualitative games
• A Retrograde Approximation Algorithm for One-Player Can’t Stop
• Deterministic graphical games revisited
• Deterministic Graphical Games Revisited
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
• On Nash-solvability of n-person graphical games under Markov and a-priori realizations
• Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

This page was built for publication: Deterministic graphical games

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