Back to Bernhard von Stengel's homepage

Recent publications of Bernhard von Stengel

• C. Ambühl, B. Gärtner, and B. von Stengel (2000), A new lower bound for the list update problem in the partial cost model. To appear in: Theoretical Computer Science.

• R. Avenhaus, B. von Stengel, and S. Zamir (1998), Inspection games. To appear in: Handbook of Game Theory, Vol. 3, eds. R. J. Aumann and S. Hart, North-Holland, Amsterdam.

• B. von Stengel (1998), Computing equilibria for two-person games. To appear in: Handbook of Game Theory, Vol. 3, eds. R. J. Aumann and S. Hart, North-Holland, Amsterdam.

• B. von Stengel (1998), New maximal numbers of equilibria in bimatrix games. Revised version for Discrete and Computational Geometry.

• E. V. Dubrova, J. C. Muzio, and B. von Stengel (1997), Finding composition trees for multiple-valued functions. Proceedings of the 27th IEEE International Symposium on Multiple Valued Logic, 19-26.

• B. von Stengel and D. Koller (1997), Team-maxmin equilibria. Games and Economic Behavior 21, 309-321.

• B. von Stengel and R. Werchner (1997), Complexity of searching an immobile hider in a graph. Discrete Applied Mathematics 78, 235-249.

• B. von Stengel, A. H. van den Elzen und A. J. J. Talman (1996), Tracing Equilibria in Extensive Games by Complementary Pivoting. Discussion paper No. 9686, CentER for Economic Research, Tilburg University. Abstract, gz-compressed POSTSCRIPT-file (158 kB, 30 pages).

• B. von Stengel (1996), Efficient computation of behavior strategies. Games and Economic Behavior 14, 220-246.

• D. Koller, N. Megiddo, and B. von Stengel (1996), Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior 14, 247-259.

• R. Avenhaus, M. D. Canty, D. M. Kilgour, B. von Stengel, and S. Zamir (1996), Invited review: Inspection games in arms control. European Journal of Operational Research 90, 383-394.

• S. Albers, B. von Stengel, and R. Werchner (1995), A combined BIT and TIMESTAMP algorithm for the list update problem. Information Processing Letters 56, 135-139.

• D. Koller, N. Megiddo, and B. von Stengel (1994), Fast algorithms for finding randomized strategies in game trees. Proceedings of the 26th ACM Symposium on Theory of Computing, 750-759.