Navigation auf


Department of Informatics Computation and Economics Research Group

Lecture: Economics and Computation (Fall 2016)

Lecturer: Prof. Dr. Sven Seuken, Dr. Timo Mennle
Teaching Assistants: Vitor Bosshard, Gianluca Brero, Ludwig Dierks, Dmitry Moor, Andreas Perschak
Teaching Language English
Level BSc, MSc
Academic Semester Fall 2016
Time and Location Tuesdays, 12:15 - 13:45 (Lecture)
Wednesdays, 12:15 - 13:45 (Exercises)
Room BIN 2.A.10
AP (ECTS): 6 (including a mark)
Office Hours Prof. Dr. Sven Seuken: email for appointments, BIN-2.B.02
Dr. Timo Mennle: email for appointments, BIN-2.B.03

Course Content

In this course, we will cover the interplay between economic thinking and computational thinking as it relates to electronic commerce in particular, and socio-economic systems in general. Topics covered include: game theory, mechanism design, p2p file-sharing, eBay auctions, advertising auctions, combinatorial auctions, matching markets, computational social choice, and crowdsourcing markets. Emphasis will be given to core methodologies necessary to design such systems with good economic and computational properties. Students will be engaged in theoretical, computational, and empirical exercises.


Lectures (tentative schedule)

Lecture Date Topic/Reading Comprehension Questions Fun & Interesting
1 Tue, 20.9.2016   Incentives
2 Tue, 27.9.2016 Game Theory (skip Sections 2.7 and 2.8)   Game Theory,
Primates & Game Theory ,
Badminton & Game Theory (jump to 15:00) (explanation)
3 Tue, 4.10.2016 The Economics of P2P File Sharing   Court...
4 Tue, 11.10.2016 Auction Theory and eBay (optional: 6.4)   eBay
5 Tue, 18.10.2016 Mechanism Design Part 1 (read: 8.1 + 8.2; optional: 8.4 + 8.5)   restaurant pricing
6 Tue, 25.10.2016 Mechanism Design Part 2 (read: 8.3 + 8.6; optional: 8.4 + 8.5)    
7 Tue, 1.11.2016 Online Advertising Auctions   online ads
8 Tue, 8.11.2016 Linear Programming (optional: 3.3 + 3.4)    
9 Tue, 15.11.2016 Integer Programming (optional 12.2, 12.4, 12.7, 12.8)   NP-hard
10 Tue, 22.11.2016 Combinatorial Auctions (optional: 11.5)    
11 Tue, 29.11.2016 Matching Markets (optional: 12.4.4 + 12.4.5)   Kidney markets
12 Tue, 6.12.2016 Computational Social Choice (optional: 15.2)   Elections
13 Tue, 13.12.2016 Review    
14 Tue, 20.12.2016
at 12:00 - 14:00
Final Exam (room tba)    

Exercise Sessions (tentative schedule)

Section Date Topic
1 Wed, 21.9.2016 Math Refresher
2 Wed, 28.9.2016 Game Theory
3 Wed, 5.10.2016 Game Theory + P2P File Sharing
4 Wed, 12.10.2016 Auction Theory
5 Wed, 19.10.2016 Mechanism Design (Part 1)
6 Wed, 26.10.2016 Mechanism Design (Part 2)
7 Wed, 2.11.2016 Online Advertising Auctions
8 Wed, 9.11.2016 Linear Programming
9 Wed, 16.11.2016 Integer Programming
10 Wed, 23.11.2016 Combinatorial Auctions
11 Wed, 30.11.2014 Matching Markets
12 Wed, 7.12.2016 Computational Social Choice
13 Wed, 14.12.2014 Review/Practice Exam

Homework Assignments (tentative schedule)

Number Out Date Due Date Topic Download
01 Tue, 27.9.2016 Tue, 11.10.2016, 12:15 Game Theory (Theory)  
02 Tue, 11.10.2016 Tue, 18.10.2016, 12:15 Auction Theory (Theory)  
03 Tue, 18.10.2016 Tue, 1.11.2016, 12:15 Mechanism Design (Theory)  
04 Tue, 1.11.2016 Tue, 8.11.2016, 12:15 Advertising Auctions (Programming)  
05(a) Tue, 8.11.2016 Tue, 15.11.2016, 12:15 Linear Programming (Programming) [40%]  
05(b) Tue, 15.11.2016 Tue, 22.11.2016, 12:15 Integer Programming (Programming) [60%]  
06 Tue, 22.11.2016 Tue, 29.11.2016, 12:15 Combinatorial Auctions (Theory/Programming)  
07(a) Tue, 29.11.2016 Tue, 6.12.2016, 12:15 Matching (Theory/Programming) [50%]  
07(b) Tue, 6.12.2016 Tue, 13.12.2016, 12:15 Social Choice (Theory/Programming) [50%]  

Teaching Format and Setup

  1. This course will be structured differently from most courses at IfI: For each lecture, there will be lecture notes (approx. 15-20 pages per lecture) that students must read before class to learn the new material at their own pace.
  2. Students must answer 4-5 short comprehension questions before every class to show they have completed the readings.
  3. During class, we will not go over all of the material from the lecture notes. Instead, lectures will be interactive, illustrating the concepts from the lecture notes, and students are expected to participate during class discussions.
  4. Every week, there will be a section (exercise session) to practice the concepts learned in the lecture. Participation in the exercise sessions will be very helpful to deepen the understanding of the material and to prepare for solving the homework exercises. However, attendance during the exercise sessions in not mandatory and will not be graded.
  5. There will be approximately 3-4 theoretical/mathematical homework exercises to deepen the understanding of the theoretical content of the course.
  6. There will be approximately 3-4 programming exercises where students need to apply the concepts learned in class.


No special prior knowledge is required. Students need to be proficient in math to solve the theoretical homework exercises, and they need to be able to program to solve the practical homework exercises. Taking the course Math-III before or while taking this course is recommended for BSc students, but not required. Furthermore, any background in microeconomics or game theory is helpful but not required.

Target Audience

Recommended for all BSc and MSc students with an interest in topics at the intersection of economics and computer science.

Teaching/Learning Goals

  1. Understand the importance of economic thinking in computational domains, and of computational thinking in economic domains.
  2. Be able to develop applicable models of complex Internet systems.
  3. Be able to analyze the behavior of systems that include people, computational agents as well as firms, and involve strategic behavior.
  4. Be able to solve both mathematical and conceptual problems involving such systems.
  5. Be able to write programs that implement strategic agents and mechanisms.

Examination + Grading

To pass the module, students need to obtain at least 50% of the points from the homework assignments and they need to pass the final exam. The final grade for the module will be determined as follows:

  1. Final Exam: 80% (expected date December 20th, 2016 at 12:00-14:00)
  2. Class participation: 10%
  3. Comprehension questions: 10%

Weiterführende Informationen


Teaser text