Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
pub:gtfmas2021 [2024/05/10 12:08]
basilico 		pub:gtfmas2021 [2024/05/10 12:16] (current)
basilico
Line 4: Line 4:
 //(Ph.D. in Computer Science, University of Milan, 2021)// //(Ph.D. in Computer Science, University of Milan, 2021)//
  
-//Lecturer: Dr. Nicola Basilico//+//Lecturer: Prof. Nicola Basilico//
  
 This course provides an introduction to multiagent systems by concentrating on modeling agents interactions by means of competitive games. The main objectives of this course are: conveying basic notions of game theoretical models, discussing in detail some of the algorithms for their resolution, and presenting some recent real-world applications. The course has 20 hours of class lectures and is worth 3 credits (CFU). This course provides an introduction to multiagent systems by concentrating on modeling agents interactions by means of competitive games. The main objectives of this course are: conveying basic notions of game theoretical models, discussing in detail some of the algorithms for their resolution, and presenting some recent real-world applications. The course has 20 hours of class lectures and is worth 3 credits (CFU).
Line 26: Line 26:
   * June 29, 2021, 14:00-17:00 (3 hours)   * June 29, 2021, 14:00-17:00 (3 hours)
   * July 2, 2021, 14:00-17:00 (3 hours)   * July 2, 2021, 14:00-17:00 (3 hours)
 +
 +=== Lectures ===
 +
 +{{:pub:1-gtfmas-r18-80-18-june-2021.mp4|Video}}
 +
 +{{:pub:2-gtfmas-r18-80-22-june-2021.mp4|Video}}
 +
 +{{:pub:3-gtfmas-r18-80-25-june-2021.mp4|Video}}
 +
 +{{:pub:4-gtfmas-r18-80-29-june-2021.mp4|Video}}
 +
 +{{:pub:5-gtfmas-r18-80-2-july-2021_1_.mp4|Video}}
 +
 +{{:pub:gtfmas-r18-80-whiteboard-5.pdf|Whiteboards}}
 +
 +=== References ===
 +
 +  * Shoham, Yoav, and Kevin Leyton-Brown. Multiagent systems: Algorithmic, game-theoretic, and logical foundations. Cambridge University Press, 2008.
 +  * Leyton-Brown, Kevin, and Yoav Shoham. "Essentials of game theory: A concise multidisciplinary introduction." Synthesis lectures on artificial intelligence and machine learning 2.1 (2008): 1-88.
 +  * Adler, Ilan, Constantinos Daskalakis, and Christos H. Papadimitriou. "A note on strictly competitive games." International Workshop on Internet and Network Economics. Springer, Berlin, Heidelberg, 2009.
 +  * Porter, Ryan, Eugene Nudelman, and Yoav Shoham. "Simple search methods for finding a Nash equilibrium." Games and Economic Behavior 63.2 (2008): 642-662.
 +  * Daskalakis, Constantinos, Paul W. Goldberg, and Christos H. Papadimitriou. "The complexity of computing a Nash equilibrium." SIAM Journal on Computing 39.1 (2009): 195-259.
 +  * Sandholm, Tuomas, Andrew Gilpin, and Vincent Conitzer. "Mixed-integer programming methods for finding Nash equilibria." AAAI. 2005.
 +  * Papadimitriou, Christos H., and Tim Roughgarden. "Computing correlated equilibria in multi-player games." Journal of the ACM (JACM) 55.3 (2008): 1-29.
 +  * von Stengel, Bernhard, and Daphne Koller. "Team-maxmin equilibria." Games and Economic Behavior 21.1-2 (1997): 309-321.
 +  * Blum, Avrim, et al. "Computing Stackelberg Equilibria of Large General-Sum Games." International Symposium on Algorithmic Game Theory. Springer, Cham, 2019.
 +  * Vazirani, Vijay V. Approximation algorithms. Springer Science & Business Media, 2013.
  
 === Assignment === === Assignment ===