Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The Game of Hex and the Brouwer Fixed-Point Theorem - MaRDI portal

The Game of Hex and the Brouwer Fixed-Point Theorem

From MaRDI portal
Publication:3895282

DOI10.2307/2320146zbMath0448.90097OpenAlexW4230874062WikidataQ55887623 ScholiaQ55887623MaRDI QIDQ3895282

David Gale

Publication date: 1979

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2320146



Related Items

Fixed points of continuous functions: Surprising and well-known facts., Cube-like complexes, Steinhaus' chains and the Poincaré-Miranda theorem, On the asymptotic dimension of products of coarse spaces, Waiter-client and client-waiter colourability and \(k\)-SAT games, Clustered 3-colouring graphs of bounded degree, Strategies in Games: A Logic-Automata Study, On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences, Robust estimation for varying index coefficient models, Model structure selection in single-index-coefficient regression models, Stack-number is not bounded by queue-number, CPT symmetry and some theorems, Topological games at Princeton, a mathematical memoir, Colorful versions of the Lebesgue, KKM, and Hex theorem, On approximation of asymmetric separators of the \(n\)-cube, Equivalence of the HEX game theorem and the Arrow impossibility theorem, A winning strategy for \(3 \times n\) cylindrical Hex, On the composition of digitally continuous multivalued functions, Large Monochromatic Components in Two-colored Grids, Graph coloring with no large monochromatic components, Weakly compact sets and Riesz representation theorem in Musielak sequence spaces, On the dimension growth of groups., Using Brouwer’s Fixed Point Theorem, Hex and combinatorics, An analogue of Gromov's waist theorem for coloring the cube, Multilabeled and topological versions of the Hex theorem, Contractible, hyperbolic but non-CAT(0) complexes, Unnamed Item, Fixed point theory in weak second-order arithmetic, Zero-Sum Two Person Games, Algorithms for finding connected separators between antipodal points, Equivalent forms of the Brouwer fixed point theorem. II., Partitioning \(H\)-minor free graphs into three subgraphs with no large components, An \(n\)-dimensional version of Steinhaus' chessboard theorem, On mathematical games, A Brouwer fixed-point theorem for graph endomorphisms, Multiple \(\mu \)-stability and multiperiodicity of delayed memristor-based fuzzy cellular neural networks with nonmonotonic activation functions, Characterization of the deletion of \((26, 6)\)-simple points as multivalued \((\mathcal{N}, 26)\)-retractions, Nash equilibria via duality and homological selection, Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies, A hierarchical approach to computer Hex, Games solved: Now and in the future, Euler, Stirling, and Wallis: a case study in the notion of equivalence between theorems, Some properties of Hölder surfaces in the Heisenberg group, THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS, Covering dimension using toric varieties, Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Planar Ramsey graphs, Simplicial algorithms for computing stationary probabilities of stochastic matrices, Equilibrium points, periodic solutions and the Brouwer fixed point theorem for convex and non-convex domains, The Power of the Half Power, A crossing lemma for annular regions and invariant sets with an application to planar dynamical systems, Weakly compact sets in Orlicz sequence spaces, On the Helly property working as a compactness criterion on graphs, Low diameter graph decompositions, Solving \(7\times 7\) hex with domination, fill-in, and virtual connections