|
Date |
Topic |
Notes |
|
| 1 |
10.10. |
Optimization |
.pdf |
|
| 2 |
13.10. |
Convex and Linear Optimization |
.pdf |
|
| 3 |
15.10. |
The Simplex Method |
.pdf |
|
| 4 |
17.10. |
Advanced Simplex Procedures |
.pdf |
|
| 5 |
20.10. |
Complexity of Problems and Algorithms |
.pdf |
|
| 6 |
22.10. |
The Complexity of Linear Programming |
.pdf |
|
| 7 |
24.10. |
The Ellipsoid Method |
.pdf |
|
|
|
Example Sheet 1 |
|
|
| 8 |
27.10. |
Graphs and Flows |
.pdf |
|
| 9 |
29.10. |
Transportation and Assignment Problems |
.pdf |
|
| 10 |
31.11. |
Maximum Flows and Perfect Matchings |
.pdf |
|
| 11 |
03.11. |
Shortest Paths and Minimum Spanning Trees |
.pdf |
|
| 12 |
05.11. |
Semidefinite Programming |
.pdf |
|
| 13 |
07.11. |
Branch and Bound |
.pdf |
|
| 14 |
10.11. |
Heuristic Algorithms |
.pdf |
|
| 15 |
12.11. |
Approximation Algorithms |
.pdf |
|
|
|
Example Sheet 2 |
|
|
| 16 |
14.11. |
Non-Cooperative Games |
.pdf |
|
| 17 |
17.11. |
Strategic Equilibrium |
.pdf |
|
| 18 |
19.11. |
Equilibrium Computation |
.pdf |
|
| 19 |
21.11. |
Cooperative Games |
.pdf |
|
| 20 |
24.11. |
Bargaining |
.pdf |
|
| 21 |
26.11. |
Stable Matchings |
.pdf |
|
| 22 |
28.11. |
Social Choice |
.pdf |
|
| 23 |
01.12. |
Mechanism Design |
.pdf |
|
| 24 |
03.12. |
Mechanisms with Payments |
.pdf |
|
|
|
Example Sheet 3 |
|
|
| |
|
|
Complete Notes |
|
|
