## Paolo Penna: Catalogue data in Spring Semester 2018 |

Name | Dr. Paolo Penna |

URL | https://www.inf.ethz.ch/personal/pennap/ |

Department | Computer Science |

Relationship | Lecturer |

Number | Title | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|

252-4302-00L | Seminar Algorithmic Game Theory Limited number of participants. | 2 credits | 2S | P. Widmayer, P. Penna | |

Abstract | In the seminar we will get familiar with the current original research in the area of algorithmic game theory by reading and presenting selected research papers in that area. | ||||

Objective | Develop an understanding of selected problems of current interest in the area of algorithmic game theory, and a practice of a scientific presentation. | ||||

Content | Study and understanding of selected topics of current interest in algorithmic game theory such as: Complexity Results (class PPAD, PLS, NP), Sponsored Search, Approximation Algorithms via Algorithmic Game Theory, Price of Anarchy, New paradigms of computation (e.g., envy-fee, truthful), Mechanism Design. | ||||

Literature | Selected research articles. | ||||

Prerequisites / Notice | You must have passed our "Algorithmic Game Theory" class (or have acquired equivalent knowledge, in exceptional cases). | ||||

263-4310-00L | Linear Algebra Methods in Combinatorics | 5 credits | 2V + 2U | P. Penna | |

Abstract | This course describes the linear algebra bound technique also called dimension argument. To learn the technique we discuss several examples in combinatorics, geometry, and computer science. Besides this technique, the course aims at showing the mathematical elegance of certain proofs and the simplicity of the statements. | ||||

Objective | Becoming familiar with the method and being able to apply it to problems similar to those encountered during the course. | ||||

Content | This course is (essentially) about one single technique called the "linear algebra bound" (also known as "dimension argument"). We shall see several examples in combinatorics, geometry, and computer science and learn the technique throughout these examples. Towards the end of the course, we shall see the power of this method in proving rather amazing results (e.g., a circuit complexity lower bound, explicit constructions of Ramsey graphs, and a famous conjecture in geometry disproved). The course also aims at illustrating the main ideas behind the proofs and how the various problems are in fact connected to each other. | ||||

Lecture notes | Lecture notes of each single lecture will be made available (shortly after the lecture itself). | ||||

Literature | Most of the material of the course is covered by the following book: 1. Linear algebra methods in combinatorics, by L. Babai and P. Frankl, Department of Computer Science, University of Chicago, preliminary version, 1992. Some parts are also taken from 2. Extremal Combinatorics (with Applications in Computer Science), by Stasys Jukna, Springer-Verlag 2001. |