Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Deterministic Graphical Games Revisited

From MaRDI portal
Publication:5891525
Jump to:navigation, search

DOI10.1093/logcom/exq001zbMath1236.91039OpenAlexW2004533707MaRDI QIDQ5891525

Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

Publication date: 7 May 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq001


zbMATH Keywords

infinite gamesretrograde analysiscomparison complexity


Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)


Related Items (3)

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ A three-person deterministic graphical game without Nash equilibria




This page was built for publication: Deterministic Graphical Games Revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5891525&oldid=15831235"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki