Тёмный

Finding Zero Sum Nash Equilibria with Linear Programming (AGT 13) 

Professor Bryce
Подписаться 5 тыс.
Просмотров 796
50% 1

Опубликовано:

 

7 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 1   
@jonnyx850
@jonnyx850 7 месяцев назад
When you're proving the minimax thm, it seems like you need to prove #2 and #3 before proving #1. You stated that the payoff for the NE must be at least as high as the payoff for the maxMin, but the NE is just the best response to the strategy that the other player is playing in the Nash equilibrium, right? So it's not necessarily a best response to player 2's minimization strategy (unless player 2's min strategy is equal to player 2's NE strategy). Therefore, you need to prove #3 first, which says that player 2's NE strategy is equivalent to the minimization strategy of player 2, right?
Далее
Nash's Theorem: Every Game has an Equilibrium (AGT 10)
23:00
POV: Your kids ask to play the claw machine
00:20
Просмотров 8 млн
Я ЖЕ БЕРЕМЕННА#cat
00:13
Просмотров 231 тыс.
Will A Guitar Boat Hold My Weight?
00:20
Просмотров 61 млн
24. Linear Programming and Two-Person Games
53:34
Просмотров 65 тыс.
Fictitious Play and Regret Matching (AGT 17)
13:19
Просмотров 1,7 тыс.
Counterfactual Regret Minimization (AGT 26)
41:44
Просмотров 8 тыс.
A 90-year-old Unsolved Telephone Question
28:45
Просмотров 68 тыс.
Physics Professors Be Like
2:46
Просмотров 4,7 млн
POV: Your kids ask to play the claw machine
00:20
Просмотров 8 млн