Fast Algorithms For Rank-1 Bimatrix Games | 0 | 0.34 | 2018 |
Special issue on combinatorial game theory. | 0 | 0.34 | 2018 |
Unit Vector Games | 0 | 0.34 | 2015 |
Recursive Inspection Games. | 1 | 0.44 | 2014 |
Game Theory Explorer - Software for the Applied Game Theorist. | 4 | 0.44 | 2014 |
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161). | 0 | 0.34 | 2013 |
Optimal lower bounds for projective list update algorithms | 2 | 0.36 | 2013 |
Oriented Euler complexes and signed perfect matchings | 4 | 0.50 | 2012 |
Nash Codes for Noisy Channels | 0 | 0.34 | 2012 |
Rank-1 Games With Exponentially Many Nash Equilibria | 5 | 0.47 | 2012 |
Follower payoffs in symmetric duopoly games | 2 | 0.62 | 2010 |
Follower payoffs in symmetric duopoly games | 2 | 0.62 | 2010 |
10171 Abstracts Collection - Equilibrium Computation. | 0 | 0.34 | 2010 |
Leadership games with convex strategy sets | 31 | 2.14 | 2010 |
Finding Gale Strings | 3 | 0.43 | 2010 |
In memoriam: David Gale (1921–2008) | 0 | 0.34 | 2009 |
Strategic Characterization of the Index of an Equilibrium | 3 | 0.51 | 2008 |
Equilibrium Computation, 18.11. - 23.11.2007 | 4 | 0.84 | 2008 |
Computing an Extensive-Form Correlated Equilibrium in Polynomial Time | 5 | 0.52 | 2008 |
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity | 14 | 1.05 | 2008 |
07471 Abstracts Collection - Equilibrium Computation | 0 | 0.34 | 2007 |
Games, geometry, and the computational complexity of finding equilibria | 0 | 0.34 | 2007 |
Symmetry and p-Stability | 2 | 0.43 | 2004 |
Exponentially many steps for finding a Nash equilibrium in a bimatrix game | 51 | 4.82 | 2004 |
A new lower bound for the list update problem in the partial cost model | 7 | 0.51 | 2001 |
Finding composition trees for multiple-valued functions | 4 | 0.59 | 1997 |
Complexity of searching an immobile hider in a graph | 9 | 0.81 | 1997 |
A combined BIT and TIMESTAMP algorithm for the list update problem | 40 | 1.65 | 1995 |
A generalized notion of semantic independence | 1 | 0.36 | 1995 |
Fast algorithms for finding randomized strategies in game trees | 79 | 16.08 | 1994 |
The Asynchronous Committee Meeting Problem | 0 | 0.34 | 1993 |
Closure Properties of Independence Concepts for Continuous Utilities | 1 | 0.49 | 1993 |
An algebraic characterization of semantic independence | 1 | 0.44 | 1991 |