logo-polimi
Loading...
Risorse bibliografiche
Risorsa bibliografica obbligatoria
Risorsa bibliografica facoltativa
Scheda Riassuntiva
Anno Accademico 2017/2018
Scuola Scuola di Ingegneria Industriale e dell'Informazione
Insegnamento 097676 - ECONOMICS AND COMPUTATION
Docente Gatti Nicola
Cfu 6.00 Tipo insegnamento Monodisciplinare

Corso di Studi Codice Piano di Studio preventivamente approvato Da (compreso) A (escluso) Insegnamento
Ing Ind - Inf (Mag.)(ord. 270) - BV (479) MANAGEMENT ENGINEERING - INGEGNERIA GESTIONALE*AZZZZ097688 - ECONOMICS AND COMPUTATION
Ing Ind - Inf (Mag.)(ord. 270) - MI (474) TELECOMMUNICATION ENGINEERING - INGEGNERIA DELLE TELECOMUNICAZIONI*AZZZZ097688 - ECONOMICS AND COMPUTATION
Ing Ind - Inf (Mag.)(ord. 270) - MI (481) COMPUTER SCIENCE AND ENGINEERING - INGEGNERIA INFORMATICA*AZZZZ097688 - ECONOMICS AND COMPUTATION
Ing Ind - Inf (Mag.)(ord. 270) - MI (487) MATHEMATICAL ENGINEERING - INGEGNERIA MATEMATICA*AZZZZ097676 - ECONOMICS AND COMPUTATION

Programma dettagliato e risultati di apprendimento attesi

PRELIMINARIES OF GAME THEORY

  • Definition of non-cooperative game
  • Solution concepts (Maxmin/minmax, Nash, Correlated equilibrium, Leader-Follower equilibrium) 

COMPUTATIONAL ISSUES OF GAME THEORY

  • Concise representation (congestion games, graphical games, sequence form)
  • Solving maxmin/minmax problems
  • Computational complexity of finding a Nash equilibrium
  • Algorithms for finding a Nash equilibrium
  • Algorithms for finding a Correlated equilibrium
  • Algorithms for finding a Leader-Follower equilibrium
  • Real-world application: security games
  • Price of Anarchy and Price of Stability
  • Real-world applications: telecommunication networks and PoA and PoS

ECONOMIC MECHANISM DESIGN

  • Social choice function
  • Definition of economic mechanism
  • Gibbard-Satterthwaite theorem
  • Quasi-linear environment and linear environment
  • Implementation of a social choice function
  • Groves mechanisms
  • Green-Laffont characterization and Myerson characterization

COMPUTATIONAL ISSUES OF MECHANISM DESIGN

  • Non-scalability of Groves mechanisms (real-world examples: combinatorial auctions)
  • Developing computationally efficient mechanisms
  • Economic mechanisms for combinatorial auctions (real-world applications)
  • Economic mechanisms for auctions with budget constraints over the auctioneer (real-world applications)
  • Economic mechanisms for multi-item multi-unit auctions (real-world applications)
  • Economic mechanisms for matching (real-world applications)
  • Economic mechanisms for online advertising (real-world applications)
  • Automated mechanism design

 

The course includes about 10 hours of laboratory.


Note Sulla Modalità di valutazione

The exam is written and contains exercises and theoretical questions. Few points are also assigned to the laboratory activity.


Bibliografia
Risorsa bibliografica facoltativaY. Shoham and K. Leyton-Brown, Multiagent Systems Algorithmic, Game-Theoretic, and Logical Foundations
Risorsa bibliografica facoltativaV. Vazirani, N. Nisan, T. Roughgarden, E. Tardos, Algorithmic Game Theory

Mix Forme Didattiche
Tipo Forma Didattica Ore didattiche
lezione
36.0
esercitazione
24.0
laboratorio informatico
0.0
laboratorio sperimentale
0.0
progetto
0.0
laboratorio di progetto
0.0

Informazioni in lingua inglese a supporto dell'internazionalizzazione
Insegnamento erogato in lingua Inglese
Disponibilità di materiale didattico/slides in lingua inglese
Disponibilità di libri di testo/bibliografia in lingua inglese
Possibilità di sostenere l'esame in lingua inglese
schedaincarico v. 1.6.1 / 1.6.1
Area Servizi ICT
08/12/2019