Lecturers

Prof. Nicola Gatti (nicola.gatti

Dr. Giuseppe De Nittis (giuseppe.denittis

Dr. Stefano Paladino (stefano.paladino

Course description

Economics and computer science have developed a remarkable number of points of contact over the past two decades. Some of these are directly motivated by applications such as large-scale digital auctions and markets, while others stem from fundamental questions such as the computational complexity of Nash equilibria, and complexity and approximation in mechanism design. Many computer scientists have realized that, in order to productively model and study the Internet and its novel computational phenomena, they need models and insights from disciplines such as game theory, economic theory and sociology, while many economists have found that a computational point of view is essential in order to understand a world in which markets are networked and the default platforms of economic transactions are algorithmic. During these past fifteen years much has been accomplished, both in achieving a remarkable degree of communication and collaboration between the fields, but also in making progress through interdisciplinary work on many central research questions, such as: studying the complexity of computing Nash and price equilibria; analyzing the efficiency of equilibria through the “price of anarchy”; and developing a computational theory of mechanism design which has informed the design of digital auctions. There is a consensus that the field is now ready for the next generation of problems and insights.

This is precisely the objective of this program: to further the interaction between theoretical computer scientists and economists so as to identify, articulate and make progress on the new generation of research challenges at the intersection of the two fields.

Detailed program of the course and material

00. Presentation:

01. Theory:

02. Theory:

03. Theory:

04. Theory:

05. Theory:

06. Theory:

07. Exercise:

08. Theory:

09. Theory:

10. Theory:

11. Theory:

12. Laboratory:

13. Theory:

14. Theory:

15. Theory:

16. Theory:

17. Laboratory:

18. Theory:

19. Presentation:

20. Laboratory:

21. Theory:

22. Laboratory:

23. Theory:

24. Theory:

25. Theory:

26. Theory:

27. Exercise:

28. Theory: DSIC and strict budget balance (notes) (questions)

29. Theory:

30. Theory:

31. Exercise:

32. Theory:

33. Exercise:

34. Exercise:

35. Theory: Analysis of non-truthful auctions (notes) (questions)

Notes about exam

The exam will be composed of two parts.

* Part 1 includes a set of questions randomly drawn from the questions reported above with only numeric variations. These questions could include (some examples of exercises can be found in the notes of the Laboratory Lectures and of the Exercise Lectures reported above). Part 1 gives at most 29 points.

* Part 2 includes a set of 3 questions on advanced topics not reported in above questions, from which the student can choose one question. Part 2 gives at most 4 points.

A student doing her/his thesis in topics related to the course is not requested to attend the exam.

Additional material

Compendium (by Nicola Gatti): formal definitions, statements, proofs, examples.

Additional exercises (by Nicola Gatti): some exercises.

Lab Instructions (by Stefano Paladino): instructions for installing the software used during the lab sessions

AMPL Cheat Sheet: AMPL syntax reference

Software download

(guide: How to determine if your OS is 32-bit or 64-bit)

AMPL Windows 32 bit

AMPL Windows 64 bit

AMPL Mac OS

AMPL Linux 32 bit

AMPL Linux 64 bit

Thesis topics

A number of thesis topics are available on all the themes discussed in the course.

Related courses

“

Powered by Politecnico di Milano

✕