Game theory | Mathematical theorems

Zermelo's theorem (game theory)

In game theory, Zermelo's theorem is a theorem about finite two-person games of perfect information in which the players move alternately and in which chance does not affect the decision making process. It says that if the game cannot end in a draw, then one of the two players must have a winning strategy (i.e. can force a win). An alternate statement is that for a game meeting all of these conditions except the condition that a draw is now possible, then either the first-player can force a win, or the second-player can force a win, or both players can at least force a draw.The theorem is named after Ernst Zermelo, a German mathematician and logician, who proved the theorem for the example game of chess in 1913. (Wikipedia).

Video thumbnail

Zermelo Fraenkel Choice

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We dicuss the axiom of chice, and sketch why it is independent of the other axioms of set theory. For the other lectures in the course see https://www.youtube.com/playlist?list=PL8yHsr3EFj52EKVgPi-p50f

From playlist Zermelo Fraenkel axioms

Video thumbnail

What's so wrong with the Axiom of Choice ?

One of the Zermelo- Fraenkel axioms, called axiom of choice, is remarkably controversial. It links to linear algebra and several paradoxes- find out what is so strange about it ! (00:22) - Math objects as sets (00:54) - What axioms we use ? (01:30) - Understanding axiom of choice (03:2

From playlist Something you did not know...

Video thumbnail

Zermelo Fraenkel Introduction

This lecture is part of an online course on the Zermelo Fraenkel axioms of set theory. This lecture gives an overview of the axioms, describes the von Neumann hierarchy, and sketches several approaches to interpreting the axioms (Platonism, von Neumann hierarchy, multiverse, formalism, pra

From playlist Zermelo Fraenkel axioms

Video thumbnail

Zermelo Fraenkel Separation and replacement

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the axioms of separation and replacement and some of their variations. For the other lectures in the course see https://www.youtube.com/playlist?list=PL8yHsr3EFj52EKVgPi-p50fRP2_SbG2oi

From playlist Zermelo Fraenkel axioms

Video thumbnail

Zermelo Fraenkel Infinity

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the axiom of infinity, and give some examples of models where it does not hold. For the other lectures in the course see https://www.youtube.com/playlist?list=PL8yHsr3EFj52EKVgPi-p50fRP2_SbG

From playlist Zermelo Fraenkel axioms

Video thumbnail

Set Theory (Part 2): ZFC Axioms

Please feel free to leave comments/questions on the video and practice problems below! In this video, I introduce some common axioms in set theory using the Zermelo-Fraenkel w/ choice (ZFC) system. Five out of nine ZFC axioms are covered and the remaining four will be introduced in their

From playlist Set Theory by Mathoma

Video thumbnail

Zermelo Fraenkel Powerset

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the powerset axiom, the strongest of the ZF axioms, and explain why the notion of a powerset is so hard to pin down precisely. For the other lectures in the course see https://www.youtube.com

From playlist Zermelo Fraenkel axioms

Video thumbnail

Infinite Sets and Foundations (Joel David Hamkins) | Ep. 17

Joel David Hamkins is a Professor of Logic with appointments in Philosophy and Mathematics at Oxford University. His main interest is in set theory. We discuss the field of set theory: what it can say about infinite sets and which issues are unresolved, and the relation of set theory to ph

From playlist Daniel Rubin Show, Full episodes

Video thumbnail

15. Backward induction: chess, strategies, and credible threats

Game Theory (ECON 159) We first discuss Zermelo's theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for player 2 to force a win. The proof is by induct

From playlist Game Theory with Ben Polak

Video thumbnail

Theory of numbers: Congruences: Euler's theorem

This lecture is part of an online undergraduate course on the theory of numbers. We prove Euler's theorem, a generalization of Fermat's theorem to non-prime moduli, by using Lagrange's theorem and group theory. As an application of Fermat's theorem we show there are infinitely many prim

From playlist Theory of numbers

Video thumbnail

Zermelo Fraenkel Foundation

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the axiom of foundation, which says that the membership relation is well founded, and give some examples of the bizarre things that can happen if sets are allowed to be non-well-founded. For

From playlist Zermelo Fraenkel axioms

Video thumbnail

Zermelo Fraenkel Pairing and union

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the axioms of pairing and union, the two easiest axioms of ZFC, and consider whether they are really needed. For the other lectures in the course see https://www.youtube.com/playlist?list=PL

From playlist Zermelo Fraenkel axioms

Video thumbnail

Topology Without Tears - Video 2c - Infinite Set Theory

This is the final part, part (c), of Video 2 in a series of videos supplementing the online book "Topology Without Tears" which is available at no cost at www.topologywithouttears.net

From playlist Topology Without Tears

Video thumbnail

Zermelo Fraenkel Extensionality

This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. In this lecture we discuss the axiom of extensionality, which says that two sets are equal if they have the same elements. For the other lectures in the course see https://www.youtube.com/playlist?list

From playlist Zermelo Fraenkel axioms

Video thumbnail

A new basis theorem for ∑13 sets

Distinguished Visitor Lecture Series A new basis theorem for ∑13 sets W. Hugh Woodin Harvard University, USA and University of California, Berkeley, USA

From playlist Distinguished Visitors Lecture Series

Video thumbnail

How ISPs Violate the Laws of Mathematics

Get a free trial of Audible at https://audible.com/minutephysics or by texting 'minutephysics' to 500500 Support MinutePhysics on Patreon! http://www.patreon.com/minutephysics Link to Patreon Supporters: http://www.minutephysics.com/supporters/ MinutePhysics is on twitter - @minutephysic

From playlist MinutePhysics

Related pages

Zero-sum game | Chess | Game theory | Pigeonhole principle | Perfect information | Proof by contradiction