Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Bernhard von
Last name:	Stengel
DBLP:	95/4774
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 25  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Penelope Hernandez, Bernhard von Stengel. Nash Codes for Noisy Channels	CoRR 2012, Volume 0	(0)	2012
	Journal article László A. Végh, Bernhard von Stengel. Oriented Euler Complexes and Signed Perfect Matchings	CoRR 2012, Volume 0	(0)	2012
	Journal article Bernhard von Stengel. Rank-1 Games With Exponentially Many Nash Equilibria	CoRR 2012, Volume 0	(0)	2012
	Journal article Marta M. Casetti, Julian Merschen, Bernhard von Stengel. Finding Gale Strings.	Electronic Notes in Discrete Mathematics 2010, Volume 36	(0)	2010
	Journal article Bernhard von Stengel, Shmuel Zamir. Leadership games with convex strategy sets.	Games and Economic Behavior 2010, Volume 69	(0)	2010
	Journal article Bernhard von Stengel. Follower payoffs in symmetric duopoly games.	Games and Economic Behavior 2010, Volume 69	(0)	2010
	Journal article Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. Optimal Projective Algorithms for the List Update Problem	CoRR 2010, Volume 0	(0)	2010
	Journal article Joel Sobel, Bernhard von Stengel. In memoriam: David Gale (1921-2008).	Games and Economic Behavior 2009, Volume 66	(0)	2009
	Conference paper Wan Huang, Bernhard von Stengel. Computing an Extensive-Form Correlated Equilibrium in Polynomial Time.	Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings 2008	(0)	2008
	Conference paper Arndt von Schemde, Bernhard von Stengel. Strategic Characterization of the Index of an Equilibrium.	Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings 2008	(0)	2008
	Conference paper Bernhard von Stengel, Françoise Forges. Extensive-Form Correlated Equilibrium: Definition and Computational Complexity.	Math. Oper. Res. 2008, Volume 33	(0)	2008
	Conference paper P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel. 07471 Abstracts Collection - Equilibrium Computation.	Equilibrium Computation, 18.11. - 23.11.2007 2008	(0)	2007
	Conference paper Bernhard von Stengel. Games, geometry, and the computational complexity of finding equilibria.	Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25-27, 2007 2007	(0)	2007
	Journal article Srihari Govindan, Arndt von Schemde, Bernhard von Stengel. Symmetry and	Int. J. Game Theory 2004, Volume 32	(0)	2004
	Conference paper Rahul Savani, Bernhard von Stengel. Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.	45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings 2004	(0)	2004
	Conference paper 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. 2001, Volume 268	(0)	2001
	Conference paper Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. Optimal Projective Algorithms for the List Update Problem.	Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings 2000	(0)	2000
	Conference paper Bernhard von Stengel. New Maximal Numbers of Equilibria in Bimatrix Games.	Discrete Computational Geometry 1999, Volume 21	(0)	1999
	Conference paper Elena Dubrova, Jon C. Muzio, Bernhard von Stengel. Finding Composition Trees for Multiple-Valued Functions.	ISMVL 1997	(0)	1997
	Conference paper Bernhard von Stengel, Ralph Werchner. Complexity of Searching an Immobile Hider in a Graph.	Discrete Applied Mathematics 1997, Volume 78	(0)	1997
	Conference paper Susanne Albers, Bernhard von Stengel, Ralph Werchner. A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.	Inf. Process. Lett. 1995, Volume 56	(0)	1995
	Conference paper Martin Fränzle, Bernhard von Stengel, Arne Wittmüss. A Generalized Notion of Semantic Independence.	Inf. Process. Lett. 1995, Volume 53	(0)	1995
	Conference paper Daphne Koller, Nimrod Megiddo, Bernhard von Stengel. Fast algorithms for finding randomized strategies in game trees.	STOC 1994	(0)	1994
	Conference paper Javier Esparza, Bernhard von Stengel. The Asynchronous Committee Meeting Problem.	Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings 1994	(0)	1993
	Conference paper Bernhard von Stengel. An Algebraic Characterization of Semantic Independence.	Inf. Process. Lett. 1991, Volume 39	(0)	1991

Show item 1 to 25 of 25  

Your query returned 25 matches in the database.