Navigation auf uzh.ch
Lecturers: | Prof. Dr. Sven Seuken, Prof. Dr. Peter Widmayer, Dr. Paolo Penna |
Teaching Assistant: | Steffen Schuldenzucker |
Teaching Language | English |
Level | BSc, MSc |
Academic Semester | Spring 2018 |
Time and Location |
Kick-off meeting: 21.02.2018, 12:15-13:45 at ETH CAB H52 (Universitätstrasse 6). Slides: Seminar Kick-Off (PDF, 277 KB) Presentation day: 18.05.2018, 9:00 - 18:30 at UZH BIN 1.D.29 (Binzmühlestrasse 14) |
AP (ECTS): | 3 (including a mark) |
Office Hours | Send email for appointments. |
In this seminar, we will discuss advanced topics in economics and computation (list of topics will be made available in the kick-off meeting). Students review a paper, independently acquire the necessary background knowledge, and write a ca. 10 pages manuscript. They give a presentation (20 min.) on the topic of their paper, and lead a short discussion (10 min.) following their presentation. Students support each other as "buddies".
The seminar will be held as a "Block-Seminar". The kick-off meeting will be at the beginning of the semester on 21.02.2018.
After the kick-off meeting, students can report which topics they prefer and in which order (cf. the kick-off slides for the format), and we will then assign topics to students accordingly via the RSD mechanism. After that, students will receive their own topic and date of their talk as well as the list of all assigned topics and they have to confirm their participation in the seminar. They may also submit a preference order for the topic for which to act as the "buddy". We will then assign buddies using RSD again.
To guarantee an acceptable student/staff ratio, we may have to restrict the number of students.
Together with their topic, students are assigned an advisor (one of the lecturers or a PhD student or PostDoc with expertise in the relevant area). Students read and understand their paper and write their manuscript, which has to be sent to the advisor and to the buddy at least four weeks before the talk, i.e., until 20.04.2017. About three weeks before the talk, a meeting with the advisor and the buddy is held in which the manuscript is discussed. The aim of this meeting is to test the student's understanding of the topic, clear any remaining gaps in understanding and to ensure a high quality of the talk. The advisor may suggest improvements to the manuscript, which should be implemented until the day of the talk: the final version of the manuscript is due the day of the talk.
The version of the manuscript sent to the advisor will be subject to grading, so this version should be as good as possible.
The manuscript should read like a written version of your talk. It should contain everything you want to present, e.g. motivation, formal model, related literature, core theorems and interesting proofs or proof ideas. It does not have to contain every aspect of your topic in full detail (but references where to find the details are appreciated). Your talk, and therefore also your manuscript, should describe at least one technical key contribution in depth. Depending on your paper, this could be a proof or even an example. Avoid providing a mere overview of the contribution.
The value of 10 pages is by no means mandatory as the length of your manuscript. However, experience has shown that good manuscripts tend to be about this long, so if your manuscript is much shorter, you might want to re-think whether you have laid out your topic in sufficient detail. On the other hand, if your manuscript is much longer, you should check if some aspect can be described in a more compact or simplified way. Furthermore, you should think about the manuscript as a "speaker's manuscript.'' Thus, if it is much longer than 10 pages, you will not be able to cover everything in 20 minutes!
Although it may be tempting at times, please do not copy any passages literally from the paper into your manuscript without attribution. This is plagiarism and will not be tolerated. In case the authors of the original paper have found a particularly good wording that you want to keep, format it as a proper quotation. Another thing you'll want to avoid is to rephrase essentially every sentence one by one, so that you technically didn't copy anything, but the message of your text is exactly the same as the original. Instead, you can often summarize or emphasize different aspects, focus on what you consider important, or present the material from your own point of view. This is how you add value on top of the original material. Exempt from these rules are very technical parts like formulas or the statements of theorems. Proofs, on the other hand, can often be simplified significantly.
Every student supports another student as a "buddy" in understanding the material and preparing the talk. In particular, it is expected that a buddy ...
The "buddy" relation will not in general be symmetric.
You can find some useful guides (how to read a paper, how to give a talk) at this website (at "Links and resources") of a previous course taught by Tim Roughgarden at Stanford.
The following are two very good manuscripts from last year's seminar. Feel free to use them as an example.
Successful completion of one of the courses "Economics and Computation" or "Algorithmic Game Theory" or explicit consent from an instructor. Students who have not taken any of the two lectures, but have enough background in relevant areas (e.g., microeconomics, game theory, multi-agent systems, auction theory, or mechanism design) may also be eligible to participate, but must contact an instructor ahead of time.
Suitable for all BSc and MSc students who have successfully completed one of the courses "Economics and Computation" or "Algorithmic Game Theory", or who have obtained similar background knowledge elsewhere. Specifically recommended for students thinking about writing their BSc or MSc thesis on a topic related to Economics and Computation.
Approximate Time |
Speaker |
Topic |
---|---|---|
9:00 |
Casey Chow |
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. |
9:30 |
Hussein Hassan Harrirou |
Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash. |
10:00 |
Michael Bucher |
Almost Envy-Freeness with General Valuations. |
10:30 |
15 mins |
Feedback / Buffer |
10:45 |
15 mins |
Break |
11:00 |
Manuel Beyeler |
Optimal auctions through deep learning. |
11:30 |
Marius Högger |
Competing Combinatorial Auctions. |
12:00 |
15 mins |
Feedback / Buffer |
12:15 |
60 mins |
Lunch Break |
13:15 |
Markus Göckeritz |
GSP — The Cinderella of Mechanism Design. |
13:45 |
David Lehnherr |
Simple Pricing Schemes for the Cloud. |
14:15 |
Carla Coccia |
Learning about the arrival of sales. |
14:45 |
15 mins |
Feedback / Buffer |
15:00 |
15 mins |
Break |
15:15 |
Varun Maram |
Online Prediction with Selfish Experts. |
15:45 |
Pouyan Rezakhani |
Network Formation and Systemic Risk. |
16:15 |
15 mins |
Feedback / Buffer |
16:30 |
|
END |