| Publication | Date of Publication | Type |
|---|
| Which is the worst-case Nash equilibrium? | 2024-06-08 | Paper |
| Computational complexity of decision problems about Nash equilibria in win-lose multi-player games | 2024-05-29 | Paper |
| The contest game for crowdsourcing reviews | 2024-05-29 | Paper |
| $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players | 2023-06-30 | Paper |
| Trade-off results for connection management | 2022-12-09 | Paper |
| (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions | 2022-10-04 | Paper |
| The price of defense | 2021-04-19 | Paper |
| The complexity of computational problems about Nash equilibria in symmetric win-lose games | 2021-03-26 | Paper |
| The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values | 2021-03-09 | Paper |
| Conditional value-at-risk: structure and complexity of equilibria | 2020-01-22 | Paper |
| Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games | 2018-04-19 | Paper |
| Conditional value-at-risk: structure and complexity of equilibria | 2018-02-13 | Paper |
| A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. | 2018-01-24 | Paper |
| Complexity of rational and irrational Nash equilibria | 2017-11-07 | Paper |
| A combinatorial treatment of balancing networks | 2017-09-29 | Paper |
| Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract) | 2017-09-29 | Paper |
| Impossibility results for weak threshold networks | 2016-05-26 | Paper |
| The complexity of equilibria for risk-modeling valuations | 2016-05-18 | Paper |
| Contention in balancing networks resolved (extended abstract) | 2016-03-02 | Paper |
| Weighted Boolean Formula Games | 2016-01-27 | Paper |
| Minimizing expectation plus variance | 2016-01-13 | Paper |
| The complexity of pure equilibria in mix-weighted congestion games on parallel links | 2015-09-15 | Paper |
| Sequentially consistent versus linearizable counting networks | 2015-09-11 | Paper |
| A distributed algorithm for gathering many fat mobile robots in the plane | 2015-03-02 | Paper |
| The price of selfish routing | 2015-02-27 | Paper |
| The impact of randomization in smoothing networks | 2014-12-12 | Paper |
| How many attackers can selfish defenders catch? | 2014-04-10 | Paper |
| Sequentially consistent versus linearizable counting networks | 2013-06-28 | Paper |
| The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games | 2013-03-13 | Paper |
| Minimizing Expectation Plus Variance | 2013-03-13 | Paper |
| Complexity of Rational and Irrational Nash Equilibria | 2011-10-28 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-10-06 | Paper |
| The impact of randomization in smoothing networks | 2010-09-09 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-08-15 | Paper |
| Facets of the fully mixed Nash equilibrium conjecture | 2010-08-13 | Paper |
| An efficient counting network | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568105 | 2010-06-17 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| A substitution theorem for graceful trees and its applications | 2009-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396550 | 2009-09-19 | Paper |
| The structure and complexity of Nash equilibria for a selfish routing game | 2009-08-21 | Paper |
| Computing on a partially eponymous ring | 2009-03-02 | Paper |
| Voronoi Games on Cycle Graphs | 2009-02-03 | Paper |
| Nash equilibria in discrete routing games with convex latency functions | 2008-11-19 | Paper |
| A new model for selfish routing | 2008-11-12 | Paper |
| Congestion Games with Player-Specific Constants | 2008-09-17 | Paper |
| Cost sharing mechanisms for fair pricing of resource usage | 2008-09-12 | Paper |
| Universal Bufferless Packet Switching | 2008-08-14 | Paper |
| A network game with attackers and a defender | 2008-07-01 | Paper |
| Facets of the Fully Mixed Nash Equilibrium Conjecture | 2008-05-02 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Efficient bufferless packet switching on trees and leveled networks | 2007-10-24 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| The Price of Defense | 2007-09-05 | Paper |
| The increase of the instability of networks due to quasi-static link capacities | 2007-09-03 | Paper |
| The price of selfish routing | 2007-07-19 | Paper |
| Direct routing: Algorithms and complexity | 2007-06-21 | Paper |
| Performance and stability bounds for dynamic networks | 2007-04-26 | Paper |
| The price of anarchy for polynomial social cost | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The impact of network structure on the stability of greedy protocols | 2006-02-08 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Structure and complexity of extreme Nash equilibria | 2005-10-26 | Paper |
| Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668734 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668739 | 2005-04-15 | Paper |
| The cost of concurrent, low-contention Read \& Modify \& Write | 2005-04-06 | Paper |
| Approximate equilibria and ball fusion | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813101 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737150 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437116 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437513 | 2003-12-02 | Paper |
| Trade-off results for connection management | 2003-01-21 | Paper |
| Threshold counters with increments and decrements | 2002-03-03 | Paper |
| Stability in routing: Networks and protocols | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503829 | 2001-09-04 | Paper |
| Distributed computing theory to date. I: Models and an example | 2001-07-18 | Paper |
| Supporting increment and decrement operations in balancing networks | 2001-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250787 | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934338 | 2000-04-26 | Paper |
| Linearizable read/write objects | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232887 | 1999-03-16 | Paper |
| A \(q\)-analog of approximation inclusion-exclusion | 1998-10-19 | Paper |
| A combinatorial treatment of balancing networks | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859226 | 1996-11-04 | Paper |
| Efficiency of semisynchronous versus asynchronous networks | 1994-10-30 | Paper |
| Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory | 1993-02-22 | Paper |
