( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.

, , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 51-65. Springer, (2005)

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.

Burkhard Monien

Georg Monien

Patrick Monien

Katharina Monien

Johanna Monien

 

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

Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle.. Elektronische Informationsverarbeitung und Kybernetik, 10 (1): 37-51 (1974)The Complexity of Determining Paths of Length k.. WG, стр. 241-251. Universitätsverlag Rudolf Trauner, Linz, (1983)Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete., и . Parallel Process. Lett., (2012)Call for Papers Advances in Computer Chess 9 Conference., и . J. Int. Comput. Games Assoc., 21 (4): 271-272 (1998)(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations., , и . CoRR, (2020)The Complexity of Equilibria for Risk-Modeling Valuations., и . CoRR, (2015)Local Search: Simple, Successful, But Sometimes Sluggish., , и . ICALP (1), том 6198 из Lecture Notes in Computer Science, стр. 1-17. Springer, (2010)Broadcasting in Butterfly and DeBruijn Networks., , , и . STACS, том 577 из Lecture Notes in Computer Science, стр. 351-362. Springer, (1992)Note on Optimal Gossiping in Some Weak-Connected Graphs., , и . Theor. Comput. Sci., 127 (2): 395-402 (1994)The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values., , и . Theor. Comput. Sci., (2021)