LSE creators

Number of items: 40.
LSE
  • von Stengel, Bernhard (2015). Bernhard von Stengel: Supermarket pricing tricks.
  • von Stengel, Bernhard (2015). A mathematician takes issue with supermarket price promotion gambits.
    • Management
  • Végh, László A., von Stengel, Bernhard (2015). Oriented Euler complexes and signed perfect matchings. Mathematical Programming, 150(1), 153-178. https://doi.org/10.1007/s10107-014-0770-4
    • Mathematics
  • Lassota, Alexandra, Vetta, Adrian, von Stengel, Bernhard (2026). The Condorcet dimension of metric spaces. Operations Research Letters, 65, https://doi.org/10.1016/j.orl.2025.107396 picture_as_pdf
  • Ickstadt, Constantin, Theobald, Thorsten, Von Stengel, Bernhard (2025). A stable-set bound and maximal numbers of Nash equilibria in bimatrix games. Mathematics of Operations Research, https://doi.org/10.1287/moor.2024.0809 picture_as_pdf
  • von Stengel, Bernhard, Ickstadt, Constantin, Theobald, Thorsten (2025). Stable-set bounds for 5x5-games. [Dataset]. Zenodo. https://doi.org/10.5281/zenodo.17064079
  • von Stengel, Bernhard (2024). Zero-sum games and linear programming duality. Mathematics of Operations Research, 49(2), 1091 - 1108. https://doi.org/10.1287/moor.2022.0149 picture_as_pdf
  • Jahani, Sahar, von Stengel, Bernhard (2022). Automated equilibrium analysis of 2 × 2 × 2 games. In Kanellopoulos, Panagiotis, Kyropoulou, Maria, Voudouris, Alexandros (Eds.), Algorithmic Game Theory - 15th International Symposium, SAGT 2022, Proceedings (pp. 223-237). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-15714-1_13 picture_as_pdf
  • Braggion, Eleonora, Gatti, Nicola, Lucchetti, Roberto, Sandholm, Thomas, Von Stengel, Bernhard (2020). Strong Nash equilibria and mixed strategies. International Journal of Game Theory, 49(3), 699 - 710. https://doi.org/10.1007/s00182-020-00723-3 picture_as_pdf
  • Adsul, Bharat, Garg, Jugal, Mehta, Ruta, Sohoni, Milind, Von Stengel, Bernhard (2020). Fast algorithms for rank-1 bimatrix games. Operations Research, 0(0), 0-0. https://doi.org/10.1287/opre.2020.1981 picture_as_pdf
  • Bednarz, David B., Muench, Paul L., Krupansky, Nicholas A., Von Stengel, Bernhard (2019). Games of timing with detection uncertainty and numerical estimates. In Shoemaker, Charles M., Nguyen, Hoa G., Muench, Paul L. (Eds.), Unmanned Systems Technology XXI . Society of Photo-optical Instrumentation Engineers. https://doi.org/10.1117/12.2519044 picture_as_pdf
  • Von Stengel, Bernhard (21 February 2019) A mathematical view of the will of the people. Democratic Audit Blog. picture_as_pdf
  • Fraenkel, Aviezri, Larsson, Urban, Santos, Carlos P., von Stengel, Bernhard (2018). Special issue on combinatorial game theory. International Journal of Game Theory, 47(2), 375-377. https://doi.org/10.1007/s00182-018-0627-9
  • von Stengel, Bernhard (2016). Recursive inspection games. Mathematics of Operations Research, 41(3), 935-952. https://doi.org/10.1287/moor.2015.0762
  • von Stengel, Bernhard, Savani, Rahul (2016). Unit vector games. International Journal of Economic Theory, 12(1), 7-27. https://doi.org/10.1111/ijet.12077
  • Végh, László A., von Stengel, Bernhard (2015). Oriented Euler complexes and signed perfect matchings. Mathematical Programming, 150(1), 153-178. https://doi.org/10.1007/s10107-014-0770-4
  • Hernández, Penélope, von Stengel, Bernhard (2014). Nash codes for noisy channels. Operations Research, 62(6), 1221-1235. https://doi.org/10.1287/opre.2014.1311
  • von Stengel, Bernhard (2014). Pretty pictures and diagrams. video_file
  • Savani, Rahul, von Stengel, Bernhard (2014). Game Theory Explorer: software for the applied game theorist. Computational Management Science, 12(1), 5-33. https://doi.org/10.1007/s10287-014-0206-x
  • Ambuehl, Christoph, Gaertner, Bernd, von Stengel, Bernhard (2013). Optimal lower bounds for projective list update algorithms. ACM Transactions on Algorithms, 9(4), No.31. https://doi.org/10.1145/2500120
  • von Stengel, Bernhard (2010). Follower payoffs in symmetric duopoly games. Games and Economic Behavior, 69(2), 512-516. https://doi.org/10.1016/j.geb.2009.10.012
  • von Stengel, Bernhard, Zamir, Shmuel (2010). Leadership games with convex strategy sets. Games and Economic Behavior, 69(2), 446-457. https://doi.org/10.1016/j.geb.2009.11.008
  • Ambuehl, Christoph, Gaertner, Bernd, von Stengel, Bernhard (2010). Optimal projective algorithms for the list update problem. arXiv.org.
  • von Stengel, Bernhard (2010). Computation of Nash equilibria in finite games: introduction to the symposium. Economic Theory, 42(1), 1-7. https://doi.org/10.1007/s00199-009-0452-2
  • Avis, David, Rosenberg, Gabriel D., Savani, Rahul, von Stengel, Bernhard (2010). Enumeration of Nash equilibria for two-player games. Economic Theory, 42(1), 9-37. https://doi.org/10.1007/s00199-009-0449-x
  • Casetti, Marta M., Merschen, Julian, von Stengel, Bernhard (2010). Finding Gale Strings. Electronic Notes in Discrete Mathematics, 36, 1065-1072. https://doi.org/10.1016/j.endm.2010.05.135
  • Sobel, Joel, von Stengel, Bernhard (2009). In memoriam: David Gale (1921–2008). Games and Economic Behavior, 66(2), p. 581. https://doi.org/10.1016/j.geb.2009.03.006
  • von Stengel, Bernhard, Forges, Francoise (2008). Extensive-form correlated equilibrium: definition and computational complexity. Mathematics of Operations Research, 33(4), 1002-1022. https://doi.org/10.1287/moor.1080.0340
  • von Stengel, Bernhard (2007). Equalibrium computation for two-player games in strategic and extensive form. In Nisan, N, Roughgarden, T, Tardos, E (Eds.), Algorithmic Game Theory (pp. 53-78). Cambridge University Press.
  • von Stengel, Bernhard (2007). Games, geometry, and the computational complexity of finding equilibria. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge - Tark '07 (pp. 4-5). ACM Press. https://doi.org/10.1145/1324249.1324253
  • von Stengel, Bernhard, Forges, Francoise (2006). Extensive form correlated equilibrium: definition and computational complexity. (CDAM research report LSE-CDAM-2006-04). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard, Savani, Rahul (2006). Hard-to-solve bimatrix games. Econometrica, 74(2), 397-429. https://doi.org/10.1111/j.1468-0262.2006.00667.x
  • Savani, Rahul, von Stengel, Bernhard (2004-10-17 - 2004-10-19) Exponentially many steps for finding a Nash equilibrium in a bimatrix game [Paper]. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, ITA.
  • Govindan, Srihari, von Schemde, Arndt, von Stengel, Bernhard (2004). Symmetry and p-stability. International Journal of Game Theory, 32(3), 359-369. https://doi.org/10.1007/s001820400167
  • Savani, Rahul, von Stengel, Bernhard (2004). Exponentially many steps for finding a Nash equilibrium in a bimatrix game. (CDAM research report series LSE-CDAM-2004-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard, Zamir, Schmuel (2004). Leadership with commitment to mixed strategies. (CDAM research report series LSE-CDAM-2004-01). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard (2003). Follower payoffs in symmetric duopoly games. (CDAM research report series LSE-CDAM-2003-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard, Turocy, T. L. (2002). Game theory. In Bidgoli, Hossein (Ed.), Encyclopedia of Information Systems (pp. 403-420). Elsevier (Firm).
  • Forges, Francoise, von Stengel, Bernhard (2002). Computationally efficient coordination in game trees. (CDAM research report series LSE-CDAM-2002-02). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard, van den Elzen, Antoon, Talman, Dolf (2002). Computing normal form perfect equilibria for extensive two-person games. Econometrica, 70(2), 693-715. https://doi.org/10.1111/1468-0262.00300
  • Ambühl, Christoph, Gärtner, Bernd, von Stengel, Bernhard (2001). A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science, 268(1), 3-16. https://doi.org/10.1016/S0304-3975(00)00257-7