| Walrasian Pricing in Multi-Unit Auctions. | 1 | 0.36 | 2017 |
| Envy-Free Pricing in Multi-unit Markets. | 2 | 0.40 | 2016 |
| Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). | 0 | 0.34 | 2016 |
| A dictatorship theorem for cake cutting | 11 | 0.64 | 2015 |
| Computation of Stackelberg Equilibria of Finite Sequential Games | 1 | 0.38 | 2015 |
| The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. | 1 | 0.36 | 2014 |
| Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). | 0 | 0.34 | 2014 |
| Truthful Approximations To Range Voting | 2 | 0.43 | 2013 |
| A faster algorithm for solving one-clock priced timed games | 6 | 0.49 | 2013 |
| Equilibrium analysis in cake cutting | 3 | 0.43 | 2013 |
| Efficient Multiparty Protocols via Log-Depth Threshold Formulae. | 4 | 0.39 | 2013 |
| Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. | 2 | 0.38 | 2013 |
| Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). | 5 | 0.43 | 2013 |
| Solving simple stochastic games with few coin toss positions | 5 | 0.57 | 2012 |
| Equilibria of Chinese Auctions | 0 | 0.34 | 2012 |
| Exact Algorithms for Solving Stochastic Games | 7 | 0.64 | 2012 |
| Deterministic Graphical Games Revisited | 5 | 0.63 | 2012 |
| Secret Sharing and Secure Computing from Monotone Formulae. | 1 | 0.36 | 2012 |
| Recent Results on Howard's Algorithm. | 0 | 0.34 | 2012 |
| Send mixed signals: earn more, work less | 33 | 2.03 | 2012 |
| Exact algorithms for solving stochastic games: extended abstract | 12 | 0.68 | 2011 |
| The Complexity of Solving Reachability Games Using Value and Strategy Iteration | 16 | 0.89 | 2010 |
| 10171 Abstracts Collection - Equilibrium Computation. | 0 | 0.34 | 2010 |
| The computational complexity of trembling hand perfection and other equilibrium refinements | 8 | 0.79 | 2010 |
| Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor | 31 | 1.44 | 2010 |
| On the Complexity of Numerical Analysis | 89 | 3.41 | 2009 |
| Winning Concurrent Reachability Games Requires Doubly-Exponential Patience | 16 | 1.14 | 2009 |
| The Complexity of Solving Stochastic Games on Graphs | 35 | 1.52 | 2009 |
| Existence and computation of equilibria of first-price auctions with integral valuations and bids | 2 | 0.48 | 2009 |
| SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings | 51 | 2.74 | 2009 |
| Privacy-Enhancing Auctions Using Rational Cryptography | 7 | 0.59 | 2009 |
| Hilbert's Thirteenth Problem and Circuit Complexity | 3 | 0.54 | 2009 |
| Approximability and Parameterized Complexity of Minmax Values | 10 | 0.77 | 2008 |
| Equilibrium Computation, 18.11. - 23.11.2007 | 4 | 0.84 | 2008 |
| On Range of Skill | 2 | 0.36 | 2008 |
| Privacy-Enhancing First-Price Auctions Using Rational Cryptography. | 0 | 0.34 | 2008 |
| 08381 Abstracts Collection - Computational Complexity of Discrete Problems. | 0 | 0.34 | 2008 |
| Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword | 0 | 0.34 | 2008 |
| On the computational complexity of solving stochastic mean-payoff games | 3 | 0.52 | 2008 |
| Trembling hand perfection is NP-hard | 0 | 0.34 | 2008 |
| 08381 Executive Summary - Computational Complexity of Discrete Problems. | 0 | 0.34 | 2008 |
| Fast algorithms for finding proper strategies in game trees | 9 | 0.66 | 2008 |
| The Computational Complexity of One-Dimensional Sandpiles | 9 | 0.89 | 2007 |
| 07471 Abstracts Collection - Equilibrium Computation | 0 | 0.34 | 2007 |
| Simple Recursive Games | 1 | 0.37 | 2007 |
| Finding equilibria in games of no chance | 3 | 0.48 | 2007 |
| A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament | 13 | 1.39 | 2007 |
| Circuits on cylinders | 3 | 0.40 | 2006 |
| Computing sequential equilibria for two-player games | 23 | 2.24 | 2006 |
| Computing proper equilibria of zero-sum games | 7 | 0.63 | 2006 |
