New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich

First Page		Document Content
Date: 2015-07-28 05:00:07 Polyhedral combinatorics Polytopes Polyhedra Convex geometry Real algebraic geometry Face Vertex enumeration problem Upper bound theorem Cyclic polytope LemkeHowson algorithm Abstract polytope		New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich Add to Reading List Source URL: www.maths.lse.ac.uk Download Document from Source Website File Size: 116,54 KB Share Document on Facebook

	A centrally symmetric version of the cyclic polytope Alexander Barvinok ∗ Department of Mathematics, DocID: 1olD0 - View Document
	New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich DocID: 1ocaT - View Document
	The Dedekind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Abstract Abstract Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional and all other con DocID: 1fZ6R - View Document
	Interval Analysis Without Intervals Paul Taylor 20 February 2006 Abstract We argue that Dedekind completeness and the Heine–Borel property should be seen as part of the “algebraic” structure of the real line, along DocID: 1fTrZ - View Document
	ANALYZING THE BIAS IN THE PRIMAL-DUAL UPPER BOUND METHOD FOR EARLY EXERCISABLE DERIVATIVES: BOUNDS, ESTIMATION AND REMOVAL MARK S. JOSHI Abstract. We analyze the primal-dual upper bound method and prove that its bias is DocID: 161OK - View Document