Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Relaxations of the Best Response Algorithm in Ratio-Bounded Games

GERAD Research Center via YouTube

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

Reviews

Start your review of Relaxations of the Best Response Algorithm in Ratio-Bounded Games

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.