( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games.

, , , , и . AAMAS, стр. 335-342. IFAAMAS, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Günther Jirikowski

Gustav Jirikowski

Marion Cermak

Josef Cermak

Rainer Cermak

 

Другие публикации лиц с тем же именем

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)., , и . IJCAI, стр. 5030-5034. ijcai.org, (2020)Journal track.Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games., , и . AAMAS, стр. 902-910. ACM, (2017)Algorithms for computing strategies in two-player simultaneous move games., , , , и . Artif. Intell., (2016)Towards Solving Imperfect Recall Games., и . AAAI Workshops, том WS-17 из AAAI Technical Report, AAAI Press, (2017)Solving Imperfect Recall Games.. AAMAS, стр. 1820-1821. ACM, (2017)An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games., , и . IJCAI, стр. 936-942. ijcai.org, (2017)Learning with proxy supervision for end-to-end visual learning., и . Intelligent Vehicles Symposium, стр. 1-6. IEEE, (2017)Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall., , , и . ICAART (2), стр. 63-74. SciTePress, (2017)Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games., , , , и . AAMAS, стр. 335-342. IFAAMAS, (2013)Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games., , и . CoRR, (2018)