scientific article; zbMATH DE number 3968395

MaRDI QIDQ3735534zbMATH OpenFDO

Authors E. N. Kulikova, V. N. Lagunov, V. M. Tsiruleva

Publication date 1984

zbMATH Keywords

computer solutionamount of memory and time requiredcalculating a priori estimatesmultistage positional n-person game

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Computing equilibria in two-player timed games via turn-based finite games
• Exact algorithms for solving stochastic games
• A characterization of von Neumann games in terms of memory
• scientific article; zbMATH DE number 4213770
• Timeability of extensive-form games
• A computational method for solving \(n\)-person game
• Games where you can play optimally with arena-independent finite memory
• scientific article; zbMATH DE number 7559480
• scientific article; zbMATH DE number 3956860

Cited in

(3)

• scientific article; zbMATH DE number 4170695 (Why is no real title available?)
• A priori estimation of problem solution time of FORTRAN programs
• scientific article; zbMATH DE number 3956860 (Why is no real title available?)

This page was built for publication:

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