| Publication | Date of Publication | Type |
|---|
Computational complexity of decision problems about Nash equilibria in win-lose multi-player games
| 2024-05-29 | Paper |
The Big Match with a Clock and a Bit of Memory
Mathematics of Operations Research | 2024-02-23 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
scientific article; zbMATH DE number 7559416 (Why is no real title available?)
| 2022-07-18 | Paper |
On the computational complexity of decision problems about multi-player Nash equilibria
Theory of Computing Systems | 2022-06-21 | Paper |
Computational complexity of computing a quasi-proper equilibrium
| 2022-05-20 | Paper |
Computational complexity of multi-player evolutionarily stable strategies
| 2022-03-21 | Paper |
Weights of exact threshold functions
Izvestiya: Mathematics | 2022-02-24 | Paper |
scientific article; zbMATH DE number 7453078 (Why is no real title available?)
| 2022-01-06 | Paper |
Absorbing games with a clock and two bits of memory
Games and Economic Behavior | 2021-06-08 | Paper |
scientific article; zbMATH DE number 7204389 (Why is no real title available?)
| 2020-05-26 | Paper |
On the computational complexity of decision problems about multi-player Nash equilibria
Algorithmic Game Theory | 2020-02-04 | Paper |
The real computational complexity of minmax value and equilibrium refinements in multi-player games
Theory of Computing Systems | 2019-09-05 | Paper |
A Stay-in-a-Set Game without a Stationary Equilibrium
| 2019-03-28 | Paper |
The real computational complexity of minmax value and equilibrium refinements in multi-player games
Algorithmic Game Theory | 2018-02-13 | Paper |
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Web and Internet Economics | 2017-02-10 | Paper |
The Big Match in small space (extended abstract)
Algorithmic Game Theory | 2016-09-29 | Paper |
Computation of Stackelberg equilibria of finite sequential games
Web and Internet Economics | 2016-01-08 | Paper |
Learning read-constant polynomials of constant degree modulo composites
Theory of Computing Systems | 2015-02-05 | Paper |
The complexity of solving reachability games using value and strategy iteration
Theory of Computing Systems | 2015-02-05 | Paper |
Polynomial threshold functions and Boolean threshold circuits
Information and Computation | 2015-01-30 | Paper |
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
Algorithmic Game Theory | 2015-01-14 | Paper |
Circuit complexity of properties of graphs with constant planar cutwidth
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Exact algorithms for solving stochastic games
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Patience of matrix games
Discrete Applied Mathematics | 2014-04-10 | Paper |
Polynomial threshold functions and Boolean threshold circuits
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques
Algorithmic Game Theory | 2013-03-13 | Paper |
Deterministic graphical games revisited
Journal of Logic and Computation | 2012-05-07 | Paper |
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Computer Science – Theory and Applications | 2011-06-17 | Paper |
The complexity of solving reachability games using value and strategy iteration
Lecture Notes in Computer Science | 2011-06-17 | Paper |
A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\)
Computational Complexity | 2011-02-18 | Paper |
The computational complexity of trembling hand perfection and other equilibrium refinements
Algorithmic Game Theory | 2010-10-19 | Paper |
Weights of exact threshold functions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Circuits on cylinders.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Hilbert's thirteenth problem and circuit complexity
Algorithms and Computation | 2009-12-17 | Paper |
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Finding Equilibria in Games of No Chance
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Dynamic Matchings in Convex Bipartite Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Deterministic Graphical Games Revisited
Logic and Theory of Algorithms | 2008-06-19 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Constant width planar computation characterizes ACC\(^{0}\)
Theory of Computing Systems | 2006-10-25 | Paper |
Circuits on cylinders
Computational Complexity | 2006-09-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
