YoVDO

Relaxations of the Best Response Algorithm in Ratio-Bounded Games

Offered By: GERAD Research Center via YouTube

Tags

Game Theory Courses Numerical Methods Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the global convergence of affine relaxations of the best response algorithm in two-player ratio-bounded games through this 46-minute Dynamic Games and Applications Seminar. Delve into Francesco Caruso's presentation from Università Degli Studi Di Napoli Federico II, Italy, as he investigates this iterative scheme for finding Nash equilibria. Learn about a numerical approach based on direct-search methods to approximate Nash equilibria in ratio-bounded games and solutions to two-leader two-follower games involving ratio-bounded games in the second stage. Gain insights into collaborative research with Maria Carmela Ceparano and Jacqueline Morgan, presented at the GERAD Research Center on November 17, 2022.

Syllabus

Relaxations of the Best Response Algorithm in Ratio-Bounded Games, Francesco Caruso


Taught by

GERAD Research Center

Related Courses

Game Theory
Stanford University via Coursera
Model Thinking
University of Michigan via Coursera
Online Games: Literature, New Media, and Narrative
Vanderbilt University via Coursera
Games without Chance: Combinatorial Game Theory
Georgia Institute of Technology via Coursera
Competitive Strategy
Ludwig-Maximilians-Universität München via Coursera