default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard von Stengel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Bernhard von Stengel
:
Zero-Sum Games and Linear Programming Duality. Math. Oper. Res. 49(2): 1091-1108 (2024)- 2022
- [c9]Sahar Jahani, Bernhard von Stengel:
Automated Equilibrium Analysis of 2˟ 2˟ 2 Games. SAGT 2022: 223-237 - [i13]Bernhard von Stengel:
Zero-Sum Games and Linear Programming Duality. CoRR abs/2205.11196 (2022) - 2021
- [j21]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel:
Fast Algorithms for Rank-1 Bimatrix Games. Oper. Res. 69(2): 613-631 (2021) - [i12]Bernhard von Stengel:
Finding Nash Equilibria of Two-Player Games. CoRR abs/2102.04580 (2021) - 2020
- [j20]Eleonora Braggion, Nicola Gatti, Roberto Lucchetti, Tuomas Sandholm, Bernhard von Stengel:
Strong Nash equilibria and mixed strategies. Int. J. Game Theory 49(3): 699-710 (2020)
2010 – 2019
- 2018
- [j19]Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel:
Special issue on combinatorial game theory. Int. J. Game Theory 47(2): 375-377 (2018) - [i11]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel:
Fast Algorithms for Rank-1 Bimatrix Games. CoRR abs/1812.04611 (2018) - 2016
- [j18]Bernhard von Stengel:
Recursive Inspection Games. Math. Oper. Res. 41(3): 935-952 (2016) - 2015
- [j17]Rahul Savani, Bernhard von Stengel:
Game Theory Explorer: software for the applied game theorist. Comput. Manag. Sci. 12(1): 5-33 (2015) - [j16]László A. Végh, Bernhard von Stengel:
Oriented Euler complexes and signed perfect matchings. Math. Program. 150(1): 153-178 (2015) - [i10]Rahul Savani, Bernhard von Stengel:
Unit Vector Games. CoRR abs/1501.02243 (2015) - 2014
- [j15]Penélope Hernández, Bernhard von Stengel:
Nash Codes for Noisy Channels. Oper. Res. 62(6): 1221-1235 (2014) - [i9]Rahul Savani, Bernhard von Stengel:
Game Theory Explorer - Software for the Applied Game Theorist. CoRR abs/1403.3969 (2014) - [i8]Bernhard von Stengel:
Recursive Inspection Games. CoRR abs/1412.0129 (2014) - 2013
- [j14]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9(4): 31:1-31:18 (2013) - [i7]Sergiu Hart, Éva Tardos, Bernhard von Stengel:
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161). Dagstuhl Reports 3(4): 69-90 (2013) - 2012
- [i6]Penélope Hernández, Bernhard von Stengel:
Nash Codes for Noisy Channels. CoRR abs/1202.1547 (2012) - [i5]László A. Végh, Bernhard von Stengel:
Oriented Euler Complexes and Signed Perfect Matchings. CoRR abs/1210.4694 (2012) - [i4]Bernhard von Stengel:
Rank-1 Games With Exponentially Many Nash Equilibria. CoRR abs/1211.2405 (2012) - 2010
- [j13]Marta M. Casetti, Julian Merschen, Bernhard von Stengel:
Finding Gale Strings. Electron. Notes Discret. Math. 36: 1065-1072 (2010) - [j12]Bernhard von Stengel, Shmuel Zamir:
Leadership games with convex strategy sets. Games Econ. Behav. 69(2): 446-457 (2010) - [j11]Bernhard von Stengel:
Follower payoffs in symmetric duopoly games. Games Econ. Behav. 69(2): 512-516 (2010) - [e2]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Vijay V. Vazirani, Bernhard von Stengel:
Equilibrium Computation, 25.04. - 30.04.2010. Dagstuhl Seminar Proceedings 10171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i3]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani:
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2010 - [i2]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. CoRR abs/1002.2440 (2010)
2000 – 2009
- 2009
- [j10]Joel Sobel, Bernhard von Stengel:
In memoriam: David Gale (1921-2008). Games Econ. Behav. 66(2): 581 (2009) - 2008
- [j9]Bernhard von Stengel, Françoise Forges:
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity. Math. Oper. Res. 33(4): 1002-1022 (2008) - [c8]Arndt von Schemde, Bernhard von Stengel:
Strategic Characterization of the Index of an Equilibrium. SAGT 2008: 242-254 - [c7]Wan Huang, Bernhard von Stengel:
Computing an Extensive-Form Correlated Equilibrium in Polynomial Time. WINE 2008: 506-513 - [e1]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [c6]Bernhard von Stengel:
Games, geometry, and the computational complexity of finding equilibria. TARK 2007: 4-5 - [i1]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007 - 2004
- [j8]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 - 2002
- [p1]Theodore L. Turocy, Bernhard von Stengel:
Game Theory. Encyclopedia of Information Systems 2002: 403-420 - 2001
- [j7]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
1990 – 1999
- 1999
- [j6]Bernhard von Stengel:
New Maximal Numbers of Equilibria in Bimatrix Games. Discret. Comput. Geom. 21(4): 557-568 (1999) - 1997
- [j5]Bernhard von Stengel, Ralph Werchner:
Complexity of Searching an Immobile Hider in a Graph. Discret. Appl. Math. 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
- [j4]Martin Fränzle, Bernhard von Stengel, Arne Wittmüss:
A Generalized Notion of Semantic Independence. Inf. Process. Lett. 53(1): 5-9 (1995) - [j3]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
- [j2]Bernhard von Stengel:
Closure Properties of Independence Concepts for Continuous Utilities. Math. Oper. Res. 18(2): 346-389 (1993) - [c1]Javier Esparza, Bernhard von Stengel:
The Asynchronous Committee Meeting Problem. WG 1993: 276-287 - 1991
- [b1]Bernhard von Stengel:
Eine Dekompositionstheorie für mehrstellige Funktionen mit Anwendungen in Systemtheorie und Operations Research. University of Passau, Germany, Hain 1991, ISBN 978-3-445-09826-9, pp. 1-260 - [j1]Bernhard von Stengel:
An Algebraic Characterization of Semantic Independence. Inf. Process. Lett. 39(6): 291-296 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
