2008 |
16 | | P. Jean-Jacques Herings,
Marcin Jurdzinski,
Peter Bro Miltersen,
Éva Tardos,
Bernhard von Stengel:
Equilibrium Computation, 18.11. - 23.11.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
15 | EE | Arndt von Schemde,
Bernhard von Stengel:
Strategic Characterization of the Index of an Equilibrium.
SAGT 2008: 242-254 |
14 | EE | Wan Huang,
Bernhard von Stengel:
Computing an Extensive-Form Correlated Equilibrium in Polynomial Time.
WINE 2008: 506-513 |
2007 |
13 | EE | P. Jean-Jacques Herings,
Marcin Jurdzinski,
Peter Bro Miltersen,
Éva Tardos,
Bernhard von Stengel:
07471 Abstracts Collection - Equilibrium Computation.
Equilibrium Computation 2007 |
12 | EE | Bernhard von Stengel:
Games, geometry, and the computational complexity of finding equilibria.
TARK 2007: 4-5 |
2004 |
11 | EE | Rahul Savani,
Bernhard von Stengel:
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.
FOCS 2004: 258-267 |
2001 |
10 | EE | Christoph Ambühl,
Bernd Gärtner,
Bernhard von Stengel:
A new lower bound for the list update problem in the partial cost model.
Theor. Comput. Sci. 268(1): 3-16 (2001) |
2000 |
9 | EE | Christoph Ambühl,
Bernd Gärtner,
Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem.
ICALP 2000: 305-316 |
1999 |
8 | EE | Bernhard von Stengel:
New Maximal Numbers of Equilibria in Bimatrix Games.
Discrete & Computational Geometry 21(4): 557-568 (1999) |
1997 |
7 | EE | Elena Dubrova,
Jon C. Muzio,
Bernhard von Stengel:
Finding Composition Trees for Multiple-Valued Functions.
ISMVL 1997: 19-26 |
6 | EE | Bernhard von Stengel,
Ralph Werchner:
Complexity of Searching an Immobile Hider in a Graph.
Discrete Applied Mathematics 78(1-3): 235-249 (1997) |
1995 |
5 | EE | Martin Fränzle,
Bernhard von Stengel,
Arne Wittmüss:
A Generalized Notion of Semantic Independence.
Inf. Process. Lett. 53(1): 5-9 (1995) |
4 | EE | Susanne Albers,
Bernhard von Stengel,
Ralph Werchner:
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Inf. Process. Lett. 56(3): 135-139 (1995) |
1994 |
3 | EE | Daphne Koller,
Nimrod Megiddo,
Bernhard von Stengel:
Fast algorithms for finding randomized strategies in game trees.
STOC 1994: 750-759 |
1993 |
2 | | Javier Esparza,
Bernhard von Stengel:
The Asynchronous Committee Meeting Problem.
WG 1993: 276-287 |
1991 |
1 | | Bernhard von Stengel:
An Algebraic Characterization of Semantic Independence.
Inf. Process. Lett. 39(6): 291-296 (1991) |