3-2 Strictly Dominated Strategies & Iterative Removal

Loading...
Université de Stanford
4.6 (2,479 notes) | 210K étudiants inscrits
Visualiser le programme de cours

Compétences que vous apprendrez

Game Theory, Backward Induction, Bayesian Game, Problem Solving

Avis

4.6 (2,479 notes)
  • 5 stars
    1,787 ratings
  • 4 stars
    553 ratings
  • 3 stars
    97 ratings
  • 2 stars
    26 ratings
  • 1 star
    16 ratings
DA

Apr 14, 2019

It was such a helpful course that gave me the opportunity to learn few basic methods and terms about game theory through lots of interesting and to the point examples by three unique professors

LY

Dec 30, 2017

Easily the most challenging introductory course I've taken, but definitely worth it. I must say though that I learnt more from failing the quizzes than the lectures or practice questions.

À partir de la leçon
Week 3: Alternate Solution Concepts
Iterative removal of strictly dominated strategies, minimax strategies and the minimax theorem for zero-sum game, correlated equilibria

Enseigné par

  • Matthew O. Jackson

    Matthew O. Jackson

    Professor
  • Kevin Leyton-Brown

    Kevin Leyton-Brown

    Professor
  • Yoav Shoham

    Yoav Shoham

    Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.