First steps in constructive game theory

Mathematical Logic Quarterly 50 (4-5):501-506 (2004)
  Copy   BIBTEX

Abstract

The minimax theorem of matrix game theory is examined from a constructive point of view. It is then shown that the existence of solutions for matrix games cannot be proved constructively, but that a 2-by-2 game with at most one solution has a constructible solution

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Farkas' lemma and related propositions in BISH.Josef Berger & Gregor Svindland - 2022 - Annals of Pure and Applied Logic 173 (2):103059.
Guillermo Owen's Proof Of The Minimax Theorem.Ken Binmore - 2004 - Theory and Decision 56 (1-2):19-23.
Games, Logic, and Constructive Sets.Grigori Mints & Reinhard Muskens (eds.) - 2003 - Center for the Study of Language and Inf.
Unique solutions.Peter Schuster - 2006 - Mathematical Logic Quarterly 52 (6):534-539.
A Constructive Version of the Spectral Mapping Theorem.Douglas Bridges & Robin Havea - 2001 - Mathematical Logic Quarterly 47 (3):299-304.
A Definitive Constructive Open Mapping Theorem?Douglas Bridges & Hajime Ishihara - 1998 - Mathematical Logic Quarterly 44 (4):545-552.
An introduction to decision theory.Martin Peterson - 2009 - Cambridge University Press.

Analytics

Added to PP
2013-12-01

Downloads
14 (#1,282,918)

6 months
3 (#1,479,050)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Farkas' lemma and related propositions in BISH.Josef Berger & Gregor Svindland - 2022 - Annals of Pure and Applied Logic 173 (2):103059.

Add more citations

References found in this work

No references found.

Add more references