Bernhard von Stengel

According to our database, Bernhard von Stengel authored at least 40 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Zero-Sum Games and Linear Programming Duality.

Bernhard von Stengel

Math. Oper. Res., 2024

The Condorcet Dimension of Metric Spaces.

Alexandra Lassota, Adrian Vetta, Bernhard von Stengel

CoRR, 2024

2022

Automated Equilibrium Analysis of 2˟ 2˟ 2 Games.

Sahar Jahani, Bernhard von Stengel

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2021

Fast Algorithms for Rank-1 Bimatrix Games.

Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel

Oper. Res., 2021

Finding Nash Equilibria of Two-Player Games.

Bernhard von Stengel

CoRR, 2021

2020

Strong Nash equilibria and mixed strategies.

Eleonora Braggion, Nicola Gatti, Roberto Lucchetti, Tuomas Sandholm, Bernhard von Stengel

Int. J. Game Theory, 2020

2018

Special issue on combinatorial game theory.

Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel

Int. J. Game Theory, 2018

2016

Recursive Inspection Games.

Bernhard von Stengel

Math. Oper. Res., 2016

2015

Oriented Euler complexes and signed perfect matchings.

László A. Végh, Bernhard von Stengel

Math. Program., 2015

Unit Vector Games.

Rahul Savani, Bernhard von Stengel

CoRR, 2015

Game Theory Explorer: software for the applied game theorist.

Rahul Savani, Bernhard von Stengel

Comput. Manag. Sci., 2015

2014

Nash Codes for Noisy Channels.

Penélope Hernández, Bernhard von Stengel

Oper. Res., 2014

2013

Optimal lower bounds for projective list update algorithms.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

ACM Trans. Algorithms, 2013

Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161).

Sergiu Hart, Éva Tardos, Bernhard von Stengel

Dagstuhl Reports, 2013

2012

Rank-1 Games With Exponentially Many Nash Equilibria

Bernhard von Stengel

CoRR, 2012

2010

Leadership games with convex strategy sets.

Bernhard von Stengel, Shmuel Zamir

Games Econ. Behav., 2010

Follower payoffs in symmetric duopoly games.

Bernhard von Stengel

Games Econ. Behav., 2010

Finding Gale Strings.

Marta M. Casetti, Julian Merschen, Bernhard von Stengel

Electron. Notes Discret. Math., 2010

10171 Abstracts Collection - Equilibrium Computation.

Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani

Proceedings of the Equilibrium Computation, 25.04. - 30.04.2010, 2010

2009

In memoriam: David Gale (1921-2008).

Joel Sobel, Bernhard von Stengel

Games Econ. Behav., 2009

2008

Extensive-Form Correlated Equilibrium: Definition and Computational Complexity.

Bernhard von Stengel, Françoise Forges

Math. Oper. Res., 2008

Computing an Extensive-Form Correlated Equilibrium in Polynomial Time.

Wan Huang, Bernhard von Stengel

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Strategic Characterization of the Index of an Equilibrium.

Arndt von Schemde, Bernhard von Stengel

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Games, geometry, and the computational complexity of finding equilibria.

Bernhard von Stengel

Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

07471 Abstracts Collection - Equilibrium Computation.

P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel

Proceedings of the Equilibrium Computation, 18.11. - 23.11.2007, 2007

2004

Symmetry and <i>p</i>-Stability.

Srihari Govindan, Arndt von Schemde, Bernhard von Stengel

Int. J. Game Theory, 2004

Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.

Rahul Savani, Bernhard von Stengel

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2002

Game Theory.

Theodore L. Turocy, Bernhard von Stengel

Proceedings of the Encyclopedia of Information Systems, 2002

2001

A new lower bound for the list update problem in the partial cost model.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Theor. Comput. Sci., 2001

2000

Optimal Projective Algorithms for the List Update Problem.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

New Maximal Numbers of Equilibria in Bimatrix Games.

Bernhard von Stengel

Discret. Comput. Geom., 1999

1997

Complexity of Searching an Immobile Hider in a Graph.

Bernhard von Stengel, Ralph Werchner

Discret. Appl. Math., 1997

Finding Composition Trees for Multiple-Valued Functions.

Elena Dubrova, Jon C. Muzio, Bernhard von Stengel

Proceedings of the 27th IEEE International Symposium on Multiple-Valued Logic, 1997

1995

A Generalized Notion of Semantic Independence.

Martin Fränzle, Bernhard von Stengel, Arne Wittmüss

Inf. Process. Lett., 1995

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.

Susanne Albers, Bernhard von Stengel, Ralph Werchner

Inf. Process. Lett., 1995

1994

Fast algorithms for finding randomized strategies in game trees.

Daphne Koller, Nimrod Megiddo, Bernhard von Stengel

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Closure Properties of Independence Concepts for Continuous Utilities.

Bernhard von Stengel

Math. Oper. Res., 1993

The Asynchronous Committee Meeting Problem.

Javier Esparza, Bernhard von Stengel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1991

Eine Dekompositionstheorie für mehrstellige Funktionen mit Anwendungen in Systemtheorie und Operations Research.

Bernhard von Stengel

PhD thesis, 1991

An Algebraic Characterization of Semantic Independence.

Bernhard von Stengel

Inf. Process. Lett., 1991