( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Zero-Sum Game Techniques for Approximate Nash Equilibria.

, , и . AAMAS, стр. 1514-1516. ACM, (2017)

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.

Gerald Jurdzinski

Marcin Wlodarski

Marcin Grzegorzek

Marcin Å0yszkiewicz

Marcin Siatkowski

 

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

Quantitative stochastic parity games., , и . SODA, стр. 121-130. SIAM, (2004)Zero-Sum Game Techniques for Approximate Nash Equilibria., , и . AAMAS, стр. 1514-1516. ACM, (2017)When are emptiness and containment decidable for probabilistic automata?, , , , , и . J. Comput. Syst. Sci., (2021)Alternating Automata on Data Trees and XPath Satisfiability, и . CoRR, (2008)Interface Compatibility Checking for Software Modules., , , , и . CAV, том 2404 из Lecture Notes in Computer Science, стр. 428-441. Springer, (2002)Model Checking Probabilistic Timed Automata with One or Two Clocks., , и . Logical Methods in Computer Science, (2008)Trading Probability for Fairness., , и . CSL, том 2471 из Lecture Notes in Computer Science, стр. 292-305. Springer, (2002)Algorithms for solving parity games.. Lectures in Game Theory for Computer Scientists, Cambridge University Press, (2011)A symmetric attractor-decomposition lifting algorithm for parity games., , , и . CoRR, (2020)Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , и . SODA, стр. 2333-2349. SIAM, (2019)