| Publication | Date of Publication | Type |
|---|
Which is the worst-case Nash equilibrium?
SIAM Journal on Discrete Mathematics | 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
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Trade-off results for connection management
Fundamentals of Computation Theory | 2022-12-09 | Paper |
(In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions
Theory of Computing Systems | 2022-10-04 | Paper |
The price of defense
Algorithmica | 2021-04-19 | Paper |
The complexity of computational problems about Nash equilibria in symmetric win-lose games
Algorithmica | 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
Theoretical Computer Science | 2021-03-09 | Paper |
Conditional value-at-risk: structure and complexity of equilibria
Theoretical Computer Science | 2020-01-22 | Paper |
\(\exists\mathbb{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
Algorithmic Game Theory | 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
Theory of Computing Systems | 2017-11-07 | Paper |
A combinatorial treatment of balancing networks
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Impossibility results for weak threshold networks
Information Processing Letters | 2016-05-26 | Paper |
The complexity of equilibria for risk-modeling valuations
Theoretical Computer Science | 2016-05-18 | Paper |
Contention in balancing networks resolved (extended abstract)
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Weighted Boolean formula games
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Minimizing expectation plus variance
Theory of Computing Systems | 2016-01-13 | Paper |
The complexity of pure equilibria in mix-weighted congestion games on parallel links
Information Processing Letters | 2015-09-15 | Paper |
Sequentially consistent versus linearizable counting networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
A distributed algorithm for gathering many fat mobile robots in the plane
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
The price of selfish routing
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
The impact of randomization in smoothing networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
How many attackers can selfish defenders catch?
Discrete Applied Mathematics | 2014-04-10 | Paper |
Sequentially consistent versus linearizable counting networks
Distributed Computing | 2013-06-28 | Paper |
The complexity of decision problems about Nash equilibria in win-lose games
Algorithmic Game Theory | 2013-03-13 | Paper |
Minimizing expectation plus variance
Algorithmic Game Theory | 2013-03-13 | Paper |
Complexity of rational and irrational Nash equilibria
Algorithmic Game Theory | 2011-10-28 | Paper |
Computing Nash equilibria for scheduling on restricted parallel links
Theory of Computing Systems | 2010-10-06 | Paper |
The impact of randomization in smoothing networks
Distributed Computing | 2010-09-09 | Paper |
Computing Nash equilibria for scheduling on restricted parallel links
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Facets of the fully mixed Nash equilibrium conjecture
Theory of Computing Systems | 2010-08-13 | Paper |
An efficient counting network
Theoretical Computer Science | 2010-08-11 | Paper |
scientific article; zbMATH DE number 5722763 (Why is no real title available?)
| 2010-06-17 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2010-02-23 | Paper |
A substitution theorem for graceful trees and its applications
Discrete Mathematics | 2009-12-09 | Paper |
scientific article; zbMATH DE number 5605056 (Why is no real title available?)
| 2009-09-19 | Paper |
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science | 2009-08-21 | Paper |
Computing on a partially eponymous ring
Theoretical Computer Science | 2009-03-02 | Paper |
Voronoi Games on Cycle Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences | 2008-11-19 | Paper |
A new model for selfish routing
Theoretical Computer Science | 2008-11-12 | Paper |
Congestion Games with Player-Specific Constants
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Cost sharing mechanisms for fair pricing of resource usage
Algorithmica | 2008-09-12 | Paper |
Universal Bufferless Packet Switching
SIAM Journal on Computing | 2008-08-14 | Paper |
A network game with attackers and a defender
Algorithmica | 2008-07-01 | Paper |
Facets of the Fully Mixed Nash Equilibrium Conjecture
Algorithmic Game Theory | 2008-05-02 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing | 2007-10-24 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
The Price of Defense
Lecture Notes in Computer Science | 2007-09-05 | Paper |
The increase of the instability of networks due to quasi-static link capacities
Theoretical Computer Science | 2007-09-03 | Paper |
The price of selfish routing
Algorithmica | 2007-07-19 | Paper |
Direct routing: Algorithms and complexity
Algorithmica | 2007-06-21 | Paper |
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
The price of anarchy for polynomial social cost
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
The impact of network structure on the stability of greedy protocols
Theory of Computing Systems | 2006-02-08 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science | 2005-10-26 | Paper |
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
SIAM Journal on Computing | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Euro-Par 2004 Parallel Processing
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2156276 (Why is no real title available?)
| 2005-04-15 | Paper |
scientific article; zbMATH DE number 2156281 (Why is no real title available?)
| 2005-04-15 | Paper |
The cost of concurrent, low-contention Read \& Modify \& Write
Theoretical Computer Science | 2005-04-06 | Paper |
Approximate equilibria and ball fusion
Theory of Computing Systems | 2005-02-11 | Paper |
scientific article; zbMATH DE number 2090633 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086616 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2013824 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2011861 (Why is no real title available?)
| 2003-12-02 | Paper |
Trade-off results for connection management
Theoretical Computer Science | 2003-01-21 | Paper |
Threshold counters with increments and decrements
Theoretical Computer Science | 2002-03-03 | Paper |
Stability in routing: Networks and protocols
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-09-27 | Paper |
scientific article; zbMATH DE number 1507041 (Why is no real title available?)
| 2001-09-04 | Paper |
Distributed computing theory to date. I: Models and an example
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
Supporting increment and decrement operations in balancing networks
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
scientific article; zbMATH DE number 1304095 (Why is no real title available?)
| 2000-11-22 | Paper |
scientific article; zbMATH DE number 1390072 (Why is no real title available?)
| 2000-04-26 | Paper |
Linearizable read/write objects
Theoretical Computer Science | 1999-06-21 | Paper |
scientific article; zbMATH DE number 1263994 (Why is no real title available?)
| 1999-03-16 | Paper |
A \(q\)-analog of approximation inclusion-exclusion
Advances in Applied Mathematics | 1998-10-19 | Paper |
A combinatorial treatment of balancing networks
Journal of the ACM | 1998-01-22 | Paper |
scientific article; zbMATH DE number 828718 (Why is no real title available?)
| 1996-11-04 | Paper |
Efficiency of semisynchronous versus asynchronous networks
Mathematical Systems Theory | 1994-10-30 | Paper |
Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
Computers & Mathematics with Applications | 1993-02-22 | Paper |
