'Regret minimization' presentation slideshows

Price of Total Anarchy

747 views • 56 slides

Price of Total Anarchy

567 views • 56 slides

Algorithms for solving two-player normal form games

Algorithms for solving two-player normal form games. Recall: Nash equilibrium. Let A and B be | M | x | N | matrices. Mixed strategies: Probability distributions over M and N If player 1 plays x , and player 2 plays y , the payoffs are x T Ay and x T By

955 views • 32 slides

Regret Minimization in Stochastic Games

Regret Minimization in Stochastic Games. Shie Mannor and Nahum Shimkin Technion, Israel Institute of Technology Dept. of Electrical Engineering. Introduction. Modeling of a dynamic decision process as a stochastic game: Non stationarity of the environment

357 views • 20 slides