Theorems | Game theory equilibrium concepts
In game theory, folk theorems are a class of theorems describing an abundance of Nash equilibrium payoff profiles in repeated games. The original Folk Theorem concerned the payoffs of all the Nash equilibria of an infinitely repeated game. This result was called the Folk Theorem because it was widely known among game theorists in the 1950s, even though no one had published it. Friedman's (1971) Theorem concerns the payoffs of certain subgame-perfect Nash equilibria (SPE) of an infinitely repeated game, and so strengthens the original Folk Theorem by using a stronger equilibrium concept: subgame-perfect Nash equilibria rather than Nash equilibria. The Folk Theorem suggests that if the players are patient enough and far-sighted (i.e. if the discount factor ), then repeated interaction can result in virtually any average payoff in an SPE equilibrium. "Virtually any" is here technically defined as "feasible" and "individually rational". For example, in the one-shot Prisoner's Dilemma, both players cooperating is not a Nash equilibrium. The only Nash equilibrium is that both players defect, which is also a mutual minmax profile. One folk theorem says that, in the infinitely repeated version of the game, provided players are sufficiently patient, there is a Nash equilibrium such that both players cooperate on the equilibrium path. But if the game is repeated a known finite number of times, backward induction shows that both players will play the one-shot Nash equilibrium in each period, i.e. they will defect each time. (Wikipedia).
Why Game Theory is Not About Competition
This video was made possible by our Patreon community! ❤️ See new videos early, participate in exclusive Q&As, and more! ➡️ https://www.patreon.com/EconomicsExplained ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ Game Theory is supposed to show how businesses (and prisoners) can outdo each other to win out
From playlist Case Studies
Nash Equilibriums // How to use Game Theory to render your opponents indifferent
Check out Brilliant ► https://brilliant.org/TreforBazett/ Join for free and the first 200 subscribers get 20% off an annual premium subscription. Thank you to Brilliant for sponsoring this playlist on Game Theory. Game Theory Playlist ► https://www.youtube.com/playlist?list=PLHXZ9OQGMqx
From playlist Game Theory
The Mathematics of Trust // How Game Theory Explains Cooperation
Check out Brilliant ► https://brilliant.org/TreforBazett/ Join for free and the first 200 subscribers get 20% off an annual premium subscription. Thank you to Brilliant for sponsoring this playlist on Game Theory. My Game Theory Playlist ► https://www.youtube.com/playlist?list=PLHXZ9OQG
From playlist Game Theory
Pythagorean theorem - What is it?
► My Geometry course: https://www.kristakingmath.com/geometry-course Pythagorean theorem is super important in math. You will probably learn about it for the first time in Algebra, but you will literally use it in Algebra, Geometry, Trigonometry, Precalculus, Calculus, and beyond! That’s
From playlist Geometry
This geometry video tutorial provides a basic introduction into the pythagorean theorem. It explains how to use it to find missing sides and solve for x. In addition, it provides examples of solving word problems using pythagorean theorem for shapes such as right triangles, squares, rhom
From playlist Geometry Video Playlist
F. Santambrogio - Optimal Control, Differential Games, Mean Field Games, ...
Optimal Control, Differential Games, Mean Field Games, and Pontryagin and Hamilton-Jacobi equations on probabilities The talk will be a short introduction to the emerging topic of Mean Field Games in connection with optimal control and differential games. I will present what is in general
From playlist Journées Sous-Riemanniennes 2017
Jules Hedges - compositional game theory - part I
Compositional game theory is an approach to game theory that is designed to have better mathematical (loosely “algebraic” and “geometric”) properties, while also being intended as a practical setting for microeconomic modelling. It gives a graphical representation of games in which the flo
From playlist compositional game theory
A Beautiful Proof of Ptolemy's Theorem.
Ptolemy's Theorem seems more esoteric than the Pythagorean Theorem, but it's just as cool. In fact, the Pythagorean Theorem follows directly from it. Ptolemy used this theorem in his astronomical work. Google for the historical details. Thanks to this video for the idea of this visual
From playlist Mathy Videos
Gregory Henselman-Petrusek (9/28/22): Saecular persistence
Homology with field coefficients has become a mainstay of modern TDA, thanks in part to structure theorems which decompose the corresponding persistence modules. This naturally begs the question -- what of integer coefficients? Or homotopy? We introduce saecular persistence, a categoric
From playlist AATRN 2022
Scalable Privacy-Friendly Client Cloud Computing
Carl Hewitt, Emeritus in the Electrical Engineering and Computer Science department at MIT, talks about Organizations of Restricted Generality (ORGs). ORGs is an architecture providing foundations for the development of privacy-friendly Internet applications by incorporating cloud computin
From playlist Engineering
Galois theory II | Math History | NJ Wildberger
We continue our historical introduction to the ideas of Galois and others on the fundamental problem of how to solve polynomial equations. In this video we focus on Galois' insights into how extending our field of coefficients, typically by introducing some radicals, the symmetries of the
From playlist MathHistory: A course in the History of Mathematics
Minmax minimal surfaces in arbitrary codimension with - Tristan Rivière
Variational Methods in Geometry Seminar Topic: Minmax minimal surfaces in arbitrary codimension with Speaker: Tristan Rivière Affiliation: ETH Zürich; Member, School of Mathematics Date: January 29, 2019 For more video please visit http://video.ias.edu
From playlist Variational Methods in Geometry
Computing with Randomness: Probability Theory and the Internet
October 21, 2010 - In recent years, probability theory has come to play an increasingly important role in computing. Professor Sahami gives examples of how probability underlies a variety of applications on the Internet including web search and email spam filtering. This lecture is offered
From playlist Reunion Homecoming
Alexander Veselov: Growth and geometry in SL_2(ℤ) dynamics
Abstract: Usual discrete dynamics can be considered as the action of the group of integers. What happens if we replace ℤ by SL_2(ℤ)? There is a classical example of such dynamics goes back to remarkable work by Andrei A. Markov (1880), who described the solutions of the Diophantine equatio
From playlist Dynamical Systems and Ordinary Differential Equations
IMS Public Lecture - Can Every Mathematical Problem Be Solved?
Menachem Magidor, The Hebrew University of Jerusalem, Israel
From playlist Public Lectures
Perfect crystals for quantum affine algebras and combinatorics of Young walls
Seok-Jin Kang (Seoul National University). Plenary Lecture from the 1st PRIMA Congress, 2009. Plenary Lecture 12. Abstract: In this talk, we will give a detailed exposition of theory of perfect crystals, which has brought us a lot of significant applications. On the other hand, we will al
From playlist PRIMA2009
Complete Statistical Theory of Learning (Vladimir Vapnik) | MIT Deep Learning Series
Lecture by Vladimir Vapnik in January 2020, part of the MIT Deep Learning Lecture Series. Slides: http://bit.ly/2ORVofC Associated podcast conversation: https://www.youtube.com/watch?v=bQa7hpUpMzM Series website: https://deeplearning.mit.edu Playlist: http://bit.ly/deep-learning-playlist
From playlist AI talks
New Dialogues: Entanglement, Holography and Renormalization (Chandrasekhar Lecture Series)
Discussion Meeting: Entanglement from Gravity(URL: http://www.icts.res.in/discussion_meeting/EG2014/) Dates: Wednesday 10 Dec, 2014 - Friday 12 Dec, 2014 Description: In the last few years, quantum entanglement considerations have led to profound insights in the connection with gravity.
From playlist Chandrasekhar Lectures
3 game theory tactics, explained
How to maximize wins and minimize losses, explained by four experts on game theory. Subscribe to Big Think on YouTube ► https://www.youtube.com/channel/UCvQECJukTDE2i6aCoMnS-Vg?sub_confirmation=1 Up next, Harvard negotiator explains how to argue ► https://youtu.be/IDj1OBG5Tpw Game theory
From playlist Get smarter, faster
Live CEOing Ep 413: Logic Programming Discussion for Wolfram Language
In this episode of Live CEOing, Stephen Wolfram discusses Logic Programming for the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen Wolfram here: https://w
From playlist Behind the Scenes in Real-Life Software Design