- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i4 |      | |
| i3 | | László A. Végh, Bernhard von Stengel: Oriented Euler Complexes and Signed Perfect Matchings. CoRR abs/1210.4694 (2012) |
| i2 | | Bernhard von Stengel: Rank-1 Games With Exponentially Many Nash Equilibria. CoRR abs/1211.2405 (2012) |
| 2010 | ||
| j12 | | Marta M. Casetti, Julian Merschen, Bernhard von Stengel: Finding Gale Strings. Electronic Notes in Discrete Mathematics 36: 1065-1072 (2010) |
| j11 | | Bernhard von Stengel, Shmuel Zamir: Leadership games with convex strategy sets. Games and Economic Behavior 69(2): 446-457 (2010) |
| j10 | | Bernhard von Stengel: Follower payoffs in symmetric duopoly games. Games and Economic Behavior 69(2): 512-516 (2010) |
| i1 | | Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. CoRR abs/1002.2440 (2010) |
| 2009 | ||
| j9 | | Joel Sobel, Bernhard von Stengel: In memoriam: David Gale (1921-2008). Games and Economic Behavior 66(2): 581 (2009) |
| 2008 | ||
| j8 | | Bernhard von Stengel, Françoise Forges: Extensive-Form Correlated Equilibrium: Definition and Computational Complexity. Math. Oper. Res. 33(4): 1002-1022 (2008) |
| c9 | | Arndt von Schemde, Bernhard von Stengel: Strategic Characterization of the Index of an Equilibrium. SAGT 2008: 242-254 |
| c8 | | |
| e1 | | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel (Eds.): Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 2007 | ||
| c7 | | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007 |
| c6 | | Bernhard von Stengel: Games, geometry, and the computational complexity of finding equilibria. TARK 2007: 4-5 |
| 2004 | ||
| j7 | | Srihari Govindan, Arndt von Schemde, Bernhard von Stengel: Symmetry and p-Stability. Int. J. Game Theory 32(3): 359-369 (2004) |
| c5 | | Rahul Savani, Bernhard von Stengel: Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. FOCS 2004: 258-267 |
| 2001 | ||
| j6 | | 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 | ||
| c4 | | Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316 |
| 1999 | ||
| j5 | | Bernhard von Stengel: New Maximal Numbers of Equilibria in Bimatrix Games. Discrete & Computational Geometry 21(4): 557-568 (1999) |
| 1997 | ||
| j4 | | Bernhard von Stengel, Ralph Werchner: Complexity of Searching an Immobile Hider in a Graph. Discrete Applied Mathematics 78(1-3): 235-249 (1997) |
| c3 | | Elena Dubrova, Jon C. Muzio, Bernhard von Stengel: Finding Composition Trees for Multiple-Valued Functions. ISMVL 1997: 19-26 |
| 1995 | ||
| j3 | | Martin Fränzle, Bernhard von Stengel, Arne Wittmüss: A Generalized Notion of Semantic Independence. Inf. Process. Lett. 53(1): 5-9 (1995) |
| j2 | | 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 | ||
| c2 | | Daphne Koller, Nimrod Megiddo, Bernhard von Stengel: Fast algorithms for finding randomized strategies in game trees. STOC 1994: 750-759 |
| 1993 | ||
| c1 | | |
| 1991 | ||
| j1 | | Bernhard von Stengel: An Algebraic Characterization of Semantic Independence. Inf. Process. Lett. 39(6): 291-296 (1991) |
Colors in the list of coauthors
Last update Thu May 23 04:39:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page