On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles

E. Boros, V. Gurvich

Research output: Contribution to journalArticle

10 Scopus citations

Fingerprint Dive into the research topics of 'On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles'. Together they form a unique fingerprint.

Mathematics

Business & Economics

Social Sciences

Medicine & Life Sciences