![[Séminaire Caen] Computing Better Approximate Pure Nash Equilibria in Payoff-maximization Potential Games](https://cdn.openagenda.com/main/c5c41ff13bf74525a3af0bcb5b20e08e.base.image.jpg)
[séminaire caen] computing better approximate pure nash equilibria in payoff-maximization potential games
Présentation de Angelo Fanelli, LAMSADE, PSL Université Paris Dauphine
Loisirs à Caen
Chargement de la carte…
[séminaire caen] computing better approximate pure nash equilibria in payoff-maximization potential games
**Abstract:** Potential games are a fundamental class of games in which pure Nash equilibria are guaranteed to exist, but computing such equilibria is…
Offres spéciales - hexa gourmet
OFFRES SPÉCIALES SALONS