Noam Nisan, Tim Roughgarden, Eva Tardos, V. Vazirani,
Libro adottato a Politecnico di Milano, a.a. 2026/2027 · 4 canali
«Noam Nisan, Tim Roughgarden, Eva Tardos, V. Vazirani,» è adottato per Algorithmic Game Theory dal prof. Nicola Gatti (Computer Science and Engineering, Mathematical Engineering, Mechanical Engineering - BV,PC e altri corsi – Politecnico di Milano).
Noam Nisan, Tim Roughgarden, Eva Tardos, V. Vazirani,Cerca su Amazon ›
Come lo indica il docente: Noam Nisan, Tim Roughgarden, Eva Tardos, V. Vazirani, Algorithmic Game Theory, Cambridge University Press
Chi lo adotta
Algorithmic Game Theory – Prof. Nicola Gatti (canale unico)Computer Science and Engineering · Laurea triennale · 1º anno · 2º semestre · ICT ENGINEERING, BUSINESS AND INNOVATION · 056959 CFU / esame facoltativo · ARTIFICIAL INTELLIGENCE · 056959 CFU
Argomenti del programma: We report the topics discussed in both versions of the course (6 CFU and 5 CFU). We use '(*)' for the topics that will not be discussed in the 5 CFU version. PRELIMINARIES OF GAME THEORY Definition of non-cooperative game Representations of a game ALGORITHMIC GAME THEORY Solving maxmin/minmax problems Computational complexity of finding a Nash equilibrium Algorithms for finding a Nash equilibrium Arrow-Debreu market…
Argomenti del programma: We report the topics discussed in both versions of the course (6 CFU and 5 CFU). We use '(*)' for the topics that will not be discussed in the 5 CFU version. PRELIMINARIES OF GAME THEORY Definition of non-cooperative game Representations of a game ALGORITHMIC GAME THEORY Solving maxmin/minmax problems Computational complexity of finding a Nash equilibrium Algorithms for finding a Nash equilibrium Arrow-Debreu market…
Argomenti del programma: We report the topics discussed in both versions of the course (6 CFU and 5 CFU). We use '(*)' for the topics that will not be discussed in the 5 CFU version. PRELIMINARIES OF GAME THEORY Definition of non-cooperative game Representations of a game ALGORITHMIC GAME THEORY Solving maxmin/minmax problems Computational complexity of finding a Nash equilibrium Algorithms for finding a Nash equilibrium Arrow-Debreu market…
Argomenti del programma: We report the topics discussed in both versions of the course (6 CFU and 5 CFU). We use '(*)' for the topics that will not be discussed in the 5 CFU version. PRELIMINARIES OF GAME THEORY Definition of non-cooperative game Representations of a game ALGORITHMIC GAME THEORY Solving maxmin/minmax problems Computational complexity of finding a Nash equilibrium Algorithms for finding a Nash equilibrium Arrow-Debreu market…
Libri Universitari