Bernhard von Stengel

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 12

Top Venues

University of Passau, Germany (PHD)

Education History

University of Passau, Germany

PHD

Publications

Bernhard von Stengel
Zero-Sum Games and Linear Programming Duality. Math. Oper. Res. 49 (2) (2024)
Sahar Jahani, Bernhard von Stengel
Automated Equilibrium Analysis of 2˟ 2˟ 2 Games. SAGT (2022)
Bernhard von Stengel
Zero-Sum Games and Linear Programming Duality. CoRR (2022)
Bernhard von Stengel
Finding Nash Equilibria of Two-Player Games. CoRR (2021)
Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel
Fast Algorithms for Rank-1 Bimatrix Games. Oper. Res. 69 (2) (2021)
Eleonora Braggion, Nicola Gatti, Roberto Lucchetti, Tuomas Sandholm, Bernhard von Stengel
Strong Nash equilibria and mixed strategies. Int. J. Game Theory 49 (3) (2020)
Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel
Fast Algorithms for Rank-1 Bimatrix Games. CoRR (2018)
Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel
Special issue on combinatorial game theory. Int. J. Game Theory 47 (2) (2018)
Bernhard von Stengel
Recursive Inspection Games. Math. Oper. Res. 41 (3) (2016)
Rahul Savani, Bernhard von Stengel
Unit Vector Games. CoRR (2015)
László A. Végh, Bernhard von Stengel
Oriented Euler complexes and signed perfect matchings. Math. Program. 150 (1) (2015)
Rahul Savani, Bernhard von Stengel
Game Theory Explorer: software for the applied game theorist. Comput. Manag. Sci. 12 (1) (2015)
Bernhard von Stengel
Recursive Inspection Games. CoRR (2014)
Penélope Hernández, Bernhard von Stengel
Nash Codes for Noisy Channels. Oper. Res. 62 (6) (2014)
Rahul Savani, Bernhard von Stengel
Game Theory Explorer - Software for the Applied Game Theorist. CoRR (2014)
Sergiu Hart, Éva Tardos, Bernhard von Stengel
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161). Dagstuhl Reports 3 (4) (2013)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9 (4) (2013)
Penélope Hernández, Bernhard von Stengel
Nash Codes for Noisy Channels CoRR (2012)
László A. Végh, Bernhard von Stengel
Oriented Euler Complexes and Signed Perfect Matchings CoRR (2012)
Bernhard von Stengel
Rank-1 Games With Exponentially Many Nash Equilibria CoRR (2012)
Marta M. Casetti, Julian Merschen, Bernhard von Stengel
Finding Gale Strings. Electron. Notes Discret. Math. 36 (2010)
Bernhard von Stengel
Follower payoffs in symmetric duopoly games. Games Econ. Behav. 69 (2) (2010)
Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation (2010)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal Projective Algorithms for the List Update Problem CoRR (2010)
Bernhard von Stengel, Shmuel Zamir
Leadership games with convex strategy sets. Games Econ. Behav. 69 (2) (2010)
Joel Sobel, Bernhard von Stengel
In memoriam: David Gale (1921-2008). Games Econ. Behav. 66 (2) (2009)
Bernhard von Stengel, Françoise Forges
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity. Math. Oper. Res. 33 (4) (2008)
Arndt von Schemde, Bernhard von Stengel
Strategic Characterization of the Index of an Equilibrium. SAGT (2008)
Wan Huang, Bernhard von Stengel
Computing an Extensive-Form Correlated Equilibrium in Polynomial Time. WINE (2008)
Bernhard von Stengel
Games, geometry, and the computational complexity of finding equilibria. TARK (2007)
P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation (2007)
Rahul Savani, Bernhard von Stengel
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. FOCS (2004)
Srihari Govindan, Arndt von Schemde, Bernhard von Stengel
-Stability. Int. J. Game Theory 32 (3) (2004)
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) (2001)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal Projective Algorithms for the List Update Problem. ICALP (2000)
Bernhard von Stengel
New Maximal Numbers of Equilibria in Bimatrix Games. Discret. Comput. Geom. 21 (4) (1999)
Bernhard von Stengel, Ralph Werchner
Complexity of Searching an Immobile Hider in a Graph. Discret. Appl. Math. 78 (1-3) (1997)
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
Finding Composition Trees for Multiple-Valued Functions. ISMVL (1997)
Susanne Albers, Bernhard von Stengel, Ralph Werchner
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. Inf. Process. Lett. 56 (3) (1995)
Martin Fränzle, Bernhard von Stengel, Arne Wittmüss
A Generalized Notion of Semantic Independence. Inf. Process. Lett. 53 (1) (1995)
Daphne Koller, Nimrod Megiddo, Bernhard von Stengel
Fast algorithms for finding randomized strategies in game trees. STOC (1994)
Javier Esparza, Bernhard von Stengel
The Asynchronous Committee Meeting Problem. WG (1993)
Bernhard von Stengel
Closure Properties of Independence Concepts for Continuous Utilities. Math. Oper. Res. 18 (2) (1993)
Bernhard von Stengel
An Algebraic Characterization of Semantic Independence. Inf. Process. Lett. 39 (6) (1991)

Bernhard von Stengel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernhard von Stengel