Author of the publication

A Stay-in-a-Set Game without a Stationary Equilibrium

, and . Electronic Proceedings in Theoretical Computer Science, (September 2019)#conference.
DOI: 10.4204/eptcs.305.6

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.. CCC, page 92-99. IEEE Computer Society, (2008)Polynomial Threshold Functions and Boolean Threshold Circuits., and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 516-527. Springer, (2013)Computational Complexity of Proper Equilibrium., and . EC, page 113-130. ACM, (2018)The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form., , , and . SAGT, volume 8768 of Lecture Notes in Computer Science, page 231-243. Springer, (2014)The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games.. Theory Comput. Syst., 63 (7): 1554-1571 (2019)Hilbert's Thirteenth Problem and Circuit Complexity., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 153-162. Springer, (2009)Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth., , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 336-347. Springer, (2014)Circuits on Cylinders., , and . FCT, volume 2751 of Lecture Notes in Computer Science, page 171-182. Springer, (2003)Constant Width Planar Computation Characterizes ACC0.. Theory Comput. Syst., 39 (1): 79-92 (2006)Patience of Matrix Games, , , and . CoRR, (2012)