Relaxations of the Best Response Algorithm in Ratio-Bounded Games

Relaxations of the Best Response Algorithm in Ratio-Bounded Games

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.