Nash equilibria over games equipped with a communication mechanism

Nathan Thomasset
Friday, 31 May, 2019 - 16:00
Solvay Room, NO-5

We introduce the structure of concurrent games over graphs and explain how we equip it with a communication mechanism allowing the players to send messages among themselves. We then study the concept of Nash equilibrium in this new model, before giving an algorithm to compute such an equilibrium satisfying given bounds on the players' payoff.