ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

159 results

Big Think
How to Win with Game Theory & Defeat Smart Opponents | Kevin Zollman | Big Think

How to Win with Game Theory & Defeat Smart Opponents New videos DAILY: https://bigth.ink Join Big Think Edge for exclusive ...

3:38
How to Win with Game Theory & Defeat Smart Opponents | Kevin Zollman | Big Think

1,045,527 views

7 years ago

Joshua Emmanuel
Decision Analysis 1: Maximax, Maximin, Minimax Regret

For an example where payoffs are costs please see: https://youtu.be/ajkXzvVegBk ~~~~~~~~~~~ Decision Making Without ...

4:44
Decision Analysis 1: Maximax, Maximin, Minimax Regret

1,184,145 views

10 years ago

William Spaniel
Game Theory 101 (#3): Iterated Elimination of Strictly Dominated Strategies

Game Theory 101: The Complete Textbook on Amazon: ...

7:11
Game Theory 101 (#3): Iterated Elimination of Strictly Dominated Strategies

457,637 views

13 years ago

Thomas Jansen | Team tutoring.
MaxiMin und MaxiMax-Strategie | Spieltheorie #101

ℹ️ Im zweiten Video der Reihe zeige ich dir, wie du die MaxiMin- und MaxiMax-Strategie innerhalb eines Spiels findest.

4:38
MaxiMin und MaxiMax-Strategie | Spieltheorie #101

2,912 views

2 years ago

Spanning Tree
Minimax: How Computers Play Games

An introduction to Minimax, an algorithm that can be used to find the best move to play in an adversarial game like Tic-Tac-Toe, ...

14:37
Minimax: How Computers Play Games

243,557 views

2 years ago

Simons Institute for the Theory of Computing
Min-Max Optimization (Part II)

Constantinos Daskalakis (MIT) https://simons.berkeley.edu/talks/min-max-optimization-part-ii Learning and Games Boot Camp.

1:09:05
Min-Max Optimization (Part II)

2,678 views

Streamed 3 years ago

openlectures sg
Dominant Strategies

Dominant Strategies [27/29] by openlectures First let's look at how game theory scenarios can be resolved and the implications of ...

3:00
Dominant Strategies

827 views

12 years ago

Computer Science Theory Explained
The Iterated Elimination of Dominated Strategies

Strategy dominance can be a very useful idea in game theory, and we can push this idea even a bit further. If a strategy t is ...

11:02
The Iterated Elimination of Dominated Strategies

2,484 views

4 years ago

CORE Econ
Video tutorial: Coordination game

In coordination games, there are two Nash equilibria. Find out why and how one of them can be selected. Learn more about ...

6:25
Video tutorial: Coordination game

16,942 views

5 years ago

Joshua Emmanuel
Decision Analysis 1.1 (Costs) - Optimistic, Conservative, Minimax Regret

Decision Making Without Probabilities: Cost Example. This brief video explains the components of the Payoff Table and the ...

5:00
Decision Analysis 1.1 (Costs) - Optimistic, Conservative, Minimax Regret

134,005 views

10 years ago

Aniruddha Bagchi
Identifying Mixed Strategy Nash Equilibrium

I describe the procedure of finding Mixed Strategy Nash equilibrium in a simultaneous move game with two players.

13:54
Identifying Mixed Strategy Nash Equilibrium

130 views

5 years ago

Google TechTalks
Maxmin Fairness in Bargaining

A Google Algorithms TechTalk, 3/20/18, presented by Anilesh Krishnaswamy (Stanford University) Talks from visiting speakers on ...

52:05
Maxmin Fairness in Bargaining

1,219 views

7 years ago

What Does That Mean?
What does maximin mean?

What does maximin mean? A spoken definition of maximin. Intro Sound: Typewriter - Tamskp Licensed under CC:BA 3.0 Outro ...

0:49
What does maximin mean?

30 views

10 years ago

Simons Institute for the Theory of Computing
Min-Max Optimization (Part I)

Constantinos Daskalakis (MIT) https://simons.berkeley.edu/talks/min-max-optimization-part-i' Learning and Games Boot Camp.

1:03:06
Min-Max Optimization (Part I)

9,476 views

Streamed 3 years ago

NPTEL IIT Bombay
#21 Iterated Elimination of Strictly Dominated Strategies | July 2019 Game Theory

Welcome to 'July 2019 Game Theory' course ! This lecture presents an intuitive method for solving some non zero sum games: ...

26:36
#21 Iterated Elimination of Strictly Dominated Strategies | July 2019 Game Theory

1,290 views

6 years ago

Udacity
Repeated Games and the Folk Theorem - Georgia Tech - Machine Learning

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud262/l-639748716/m-640409510 Check out the full Advanced ...

1:47
Repeated Games and the Folk Theorem - Georgia Tech - Machine Learning

4,051 views

10 years ago

Aditya Jagannatham
Lecture 12:  Mixed Strategies and Nash Equilibrium

Want to learn AI/ ML, Deep Learning with PYTHON Projects?* https://www.iitk.ac.in/mwn/AIML/index.html Check out our school!

32:52
Lecture 12: Mixed Strategies and Nash Equilibrium

14,749 views

10 years ago

Computer Science Theory Explained
Existence and Computation of Nash Equilibria in Two-Player Zero-Sum Games

A strategy x from the mixed strategy simplex of player I is called a maximin-strategy if x maximizes the smallest entry of A ...

11:17
Existence and Computation of Nash Equilibria in Two-Player Zero-Sum Games

2,230 views

4 years ago

Roy Zhou
Game theory | Zero Sum Game

Game theory | Zero Sum Game ---------------------------- Thanks for stopping by, if you like this video then please help me out by ...

5:17
Game theory | Zero Sum Game

400 views

4 years ago

Complexity Explorer
Game Theory Tutorial: Static Games:  Introduction

Part of Complexity Explorer's Game Theory tutorial, hosted by Justin Grana, PhD. To learn more, visit gts.complexityexplorer.org ...

4:48
Game Theory Tutorial: Static Games: Introduction

9,330 views

8 years ago