Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:ss19:vl-agt [2019/06/05 15:00]
kesselheim
teaching:ss19:vl-agt [2019/08/05 16:59] (current)
kesselheim [Exams]
Line 1: Line 1:
 ====== MA-INF 1301: Algorithmic Game Theory and the Internet ====== ====== MA-INF 1301: Algorithmic Game Theory and the Internet ======
 +
 +===== Next Semester =====
 +Next semester, we will offer a [[teaching:​ws19:​seminar-agt|seminar]] and a [[teaching:​ws1920:​lab-kesselheim|lab]],​ which are both on topics of algorithmic game theory. Please contact [[staff:​thomaskesselheim|Thomas Kesselheim]] if you are interested. The lab will probably much more fun with many participants.
  
 ===== Lecture ===== ===== Lecture =====
Line 13: Line 16:
  
 ===== Exams ===== ===== Exams =====
-The exams will take place in the weeks of July 22 and September 9, possibly also the following respective weeks. Please register ​for the exams in BASIS. After the registration in BASIS is closedyou will each have the chance ​to sign up for your individual exam time slot.+To be assigned a time slot for the examplease send an e-mail ​to [[staff:​thomaskesselheim|Thomas Kesselheim]].
  
 +One more thing: If you have been assigned a time slot but then decide to not take the exam, please remember to cancel it. It is very important for us to know that you will not show up because otherwise we will be waiting for you. In this case, send an e-mail to [[staff:​thomaskesselheim|Thomas Kesselheim]]. Even a last-minute cancellation is better than a no-show. Of course, make sure that you also follow the official procedures (if applicable).
 ===== Content ===== ===== Content =====
 Throughout the world of modern computer networks, there are environments in which participants act strategically. Just consider internet service providers, which strive to route packets as cheaply as possible. Another example are cloud-based services: End-users and service providers rent remote infrastructure for storage or computations,​ giving rise to huge markets. Last but not least, advertisers want to reach their audience as cheaply as possible. This is the foundation of the business models of the world’s largest companies. Throughout the world of modern computer networks, there are environments in which participants act strategically. Just consider internet service providers, which strive to route packets as cheaply as possible. Another example are cloud-based services: End-users and service providers rent remote infrastructure for storage or computations,​ giving rise to huge markets. Last but not least, advertisers want to reach their audience as cheaply as possible. This is the foundation of the business models of the world’s largest companies.
Line 50: Line 54:
   * {{:​teaching:​ss19:​vl-agt:​lecturenotes16.pdf|Lecture Notes Jun 3, 2019 (Simple Combinatorial Auctions)}} ​   * {{:​teaching:​ss19:​vl-agt:​lecturenotes16.pdf|Lecture Notes Jun 3, 2019 (Simple Combinatorial Auctions)}} ​
   * {{:​teaching:​ss19:​vl-agt:​lecturenotes17.pdf|Lecture Notes Jun 5, 2019 (Revenue Maximization)}}   * {{:​teaching:​ss19:​vl-agt:​lecturenotes17.pdf|Lecture Notes Jun 5, 2019 (Revenue Maximization)}}
-  * {{:​teaching:​ss19:​vl-agt:​lecturenotes18.pdf|Lecture Notes Jun 17, 2019 (Revenue Maximization with Identical Distributions)}} (preview)+  * {{:​teaching:​ss19:​vl-agt:​lecturenotes18.pdf|Lecture Notes Jun 17, 2019 (Revenue Maximization with Identical Distributions)}} 
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes19.pdf|Lecture Notes Jun 19, 2019 (Allocations without Money)}}  
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes20.pdf|Lecture Notes Jun 24, 2019 (Walrasian Equilibria)}} 
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes21.pdf|Lecture Notes Jun 26, 2019 (Posted Prices with Incomplete Information)}} 
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes22.pdf|Lecture Notes Jul 1, 2019 (Stable Matching)}}  
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes23.pdf|Lecture Notes Jul 3, 2019 (Cake Cutting)}}  
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes24.pdf|Lecture Notes Jul 8, 2019 (Voting)}}  
 +  * {{:​teaching:​ss19:​vl-agt:​lecturenotes25.pdf|Lecture Notes Jul 10, 2019 (Cost Sharing)}} (Corrected proof of Lemma 25.7 in comparison to lecture.)
 ===== Exercises ===== ===== Exercises =====
   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt01.pdf|Exercise Set 1, due Apr 10}}   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt01.pdf|Exercise Set 1, due Apr 10}}
Line 62: Line 73:
   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt09.pdf|Exercise Set 9, due June 5}}   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt09.pdf|Exercise Set 9, due June 5}}
   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt10.pdf|Exercise Set 10, due June 19}} (updated due date)   * {{:​teaching:​ss19:​vl-agt:​uebungsblatt10.pdf|Exercise Set 10, due June 19}} (updated due date)
 +  * {{:​teaching:​ss19:​vl-agt:​uebungsblatt11.pdf|Exercise Set 11, due June 26}}
 +  * {{:​teaching:​ss19:​vl-agt:​uebungsblatt12.pdf|Exercise Set 12, due July 3}}
 +  * {{:​teaching:​ss19:​vl-agt:​uebungsblatt13.pdf|Exercise Set 13, due July 10}}
  
 ===== Further Reading ===== ===== Further Reading =====

Page Tools