|
|
|
The following references are sourced from LSE Research Online|. References that are linked lead to the full text.
Ambuehl, Christoph and Gaertner, Bernd and von Stengel, Bernhard (2010) Optimal projective algorithms for the list update problem. arXiv.org Avis, David and Rosenberg, Gabriel D. and Savani, Rahul and von Stengel, Bernhard (2010) Enumeration of Nash equilibria for two-player games. Economic theory, 42 (1). pp. 9-37. ISSN 0938-2259 von Stengel, Bernhard (2010) Computation of Nash equilibria in finite games: introduction to the symposium. Economic theory, 42 (1). pp. 1-7. ISSN 1432-0479 Casetti, Marta M. and Merschen, Julian and von Stengel, Bernhard (2010) Finding Gale Strings. Electronic notes in discrete mathematics, 36 pp. 1065-1072. ISSN 1571-0653 Sobel, Joel and von Stengel, Bernhard (2009) In memoriam: David Gale (1921–2008). Games and economic behavior, 66 (2). ISSN 0899-8256 von Stengel, Bernhard and Forges, Francoise (2008) Extensive-form correlated equilibrium: definition and computational complexity. Mathematics of operations research, 33 (4). pp. 1002-1022. ISSN 0364-765X von Stengel, Bernhard (2007) Equalibrium computation for two-player games in strategic and extensive form. In: Nisan, N and Roughgarden, T and Tardos, E, (eds.) Algorithmic game theory. Cambridge University Press, Cambridge, UK, pp. 53-78. ISBN 9780521872829 von Stengel, Bernhard and Forges, Francoise (2006) Extensive form correlated equilibrium: definition and computational complexity. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK von Stengel, Bernhard and Savani, Rahul (2006) Hard-to-solve bimatrix games. Econometrica, 74 (2). pp. 397-429. ISSN 0012-9682 Savani, Rahul and von Stengel, Bernhard (2004) Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In:45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004) (17-19 Oct 2004 : Rome, Italy). Govindan, Srihari and von Schemde, Arndt and von Stengel, Bernhard (2004) Symmetry and p-stability. International journal of game theory, 32 (3). pp. 359-369. ISSN 0020-7276 Savani, Rahul and von Stengel, Bernhard (2004) Exponentially many steps for finding a Nash equilibrium in a bimatrix game. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK von Stengel, Bernhard and Zamir, Schmuel (2004) Leadership with commitment to mixed strategies. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK von Stengel, Bernhard (2003) Follower payoffs in symmetric duopoly games. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK von Stengel, Bernhard and Turocy, T. L. (2002) Game theory. In: Bidgoli, Hossein, (ed.) Encyclopedia of information systems. Elsevier, Amsterdam, The Netherlands, pp. 403-420. ISBN 9780122272400 Forges, Francoise and von Stengel, Bernhard (2002) Computationally efficient coordination in game trees. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK von Stengel, Bernhard and van den Elzen, Antoon and Talman, Dolf (2002) Computing normal form perfect equilibria for extensive two-person games. Econometrica, 70 (2). pp. 693-715. ISSN 0012-9682 Ambühl, Christoph and Gärtner, Bernd and von Stengel, Bernhard (2001) A new lower bound for the list update problem in the partial cost model. Theoretical computer science, 268 (1). pp. 3-16. ISSN 0304-3975
LSE Research Online is the primary resource for references to publications. For queries or updates please email the LSE Research Online team at lseresearchonline@lse.ac.uk|.
|
|
|
|
Browse the Experts Directory:
|
Collection of LSE research outputs
Service providing unique access
to LSE's expertise
[access restricted to staff]
Short articles about LSE research
|