## HW3 Grades Are Published | |

Please submit your appeals to the TA via email by Sunday, October 15. |

עדכון אחרון ב-24/9/2023, 17:46:32 Last updated on 24/9/2023, 17:46:32 Последняя модификация24/9/2023, 17:46:32 تمت الحتلنة الأخيرة ب-24/9/2023, 17:46:32 |

## An Announcement + A Clarification for the Final Projects | |

Dear students, 1. If you wish to guarantee scheduling a meeting with Konstantin about the final projects a reasonable amount of time before the deadline - please notify him by the end of this week. Konstantin will be unavailable during certain periods of time for meetings (but still available via email). 2. Following many questions about the requirements from the literature survey - first, you should note that writing a good literature survey is not easy, especially in "real" papers that you submit to a conference/journal. In a conference, an insufficiently good literature review might lead to rejecting your paper. Regarding the final project - your literature survey must include both (some of the) papers cited by your chosen paper and some papers not cited by it. References from the latter category should imply that you are familiar with the state-of-the-art results related to your chosen paper. If your chosen paper does not have follow-up papers yet - you still have to cite at least 1-2 papers not cited by it, and you should use your discretion to select them - e.g., some papers that are relevant to the research direction you chose (maybe in another framework) or some related papers published almost simultaneously with your chosen paper. So far we have discussed chronological issues - let us move to more technical details. Your literature review should contain: (a) The most important papers related to your chosen paper (e.g., the paper that established the relevant research field). (b) The papers most closely related to your chosen paper. (c) The papers most closely related to the research direction you chose (even if they are not closely related to the results from your chosen paper). *Note that the three categories above are all different, and in a good survey you should address each of them.* These guidelines are similar to guidelines for writing a publishable follow-up paper for your chosen paper, with the exception being the length - we do not expect you to include as many references as published papers do. How many references should you include? Again, you should use your discretion. 5 are insufficient, 40 are too much. Of course, these guidelines are still quite ambiguous, but (as has already been written above) writing a good literature review is not easy, and you should use your discretion. |

עדכון אחרון ב-21/8/2023, 13:39:38 Last updated on 21/8/2023, 13:39:38 Последняя модификация21/8/2023, 13:39:38 تمت الحتلنة الأخيرة ب-21/8/2023, 13:39:38 |

## HW2 Grades Are Published | |

Please submit your appeals to the TA via email by 19.7. A remark about the revenue curve - it's trivially always nonnegative, as the revenue is always nonnegative. |

פורסם ב-5/7/2023, 00:52:31 Created on 5/7/2023, 00:52:31 Создано5/7/2023, 00:52:31 تم النشر ب-5/7/2023, 00:52:31 |

## A Remark Following Students' Questions | |

In Exercise 7.5, it is not trivial that there is a polynomial-time implementation of the payment rule - externalities are not generally computable in polynomial time. You have to prove that in the specific case it can be done in polynomial time (and this part of the exercise is worth about half of its points). Another remark - NEVER share your LaTeX source code with other students. Copy-pasting a LaTeX source code (even with minor modifications) is easily identifiable by the anti-plagiarism software used by the gr system, and such a case was identified in HW2. |

עדכון אחרון ב-2/7/2023, 22:20:09 Last updated on 2/7/2023, 22:20:09 Последняя модификация2/7/2023, 22:20:09 تمت الحتلنة الأخيرة ب-2/7/2023, 22:20:09 |

## Some Important Updates | |

1. Following students' questions, some clarifications were added to HW3 (marked in pink). 2. As has already been announced, Konstantin will hold a reception hour next week on Sunday 11:30-12:30 (Zoom only) instead of the usual slot. 3. If you wish to schedule a special reception hour regarding HW3 - please note that Konstantin will only be available on Sunday and Tuesday (Monday is the first day of the COMSOC conference in BGU, which includes a lecture by Aumann). 4. You can schedule a special reception hour with Konstantin in July/August concerning the projects, but please note that he will be unavailable during certain slots (but still available via email). |

עדכון אחרון ב-29/6/2023, 01:16:27 Last updated on 29/6/2023, 01:16:27 Последняя модификация29/6/2023, 01:16:27 تمت الحتلنة الأخيرة ب-29/6/2023, 01:16:27 |

## HW3 Is Published | |

The submission (in singles, electronically, in a single pdf file created using LaTeX) is due on July 6 (23:59). Good luck! |

פורסם ב-16/6/2023, 14:17:41 Created on 16/6/2023, 14:17:41 Создано16/6/2023, 14:17:41 تم النشر ب-16/6/2023, 14:17:41 |

## Zoom link for today's lecture | |

https://technion.zoom.us/j/7291142129 |

פורסם ב-16/6/2023, 08:39:58 Created on 16/6/2023, 08:39:58 Создано16/6/2023, 08:39:58 تم النشر ب-16/6/2023, 08:39:58 |

## One Final Change to the Course Schedule - Important! | |

Dear students, Konstantin will hold the last tutorial on Monday 19.6 10:30-11:20 via Zoom. The tutorial will be held with slides (already online) and it will be recorded, as usual. The reason for the schedule change is the desire to give a tutorial that may help you understand better the topic of the last hour of tomorrow's lecture, which is the last topic required for HW3. After the tutorial, Konstantin will be available via the same Zoom link for answering questions until 12:00 (but if all the students leave earlier - these "40 reception minutes" will finish earlier, as 12:00 pm in Israel is 2:00 am in Berkeley). We kindly remind you that during the next week both Inbal and Konstantin are in the US, and besides Konstantin's tutorial and reception hour - their availability will be limited. PS The full schedule until the semester end appears on the course website under general information. |

עדכון אחרון ב-15/6/2023, 17:35:49 Last updated on 15/6/2023, 17:35:49 Последняя модификация15/6/2023, 17:35:49 تمت الحتلنة الأخيرة ب-15/6/2023, 17:35:49 |

## A Clarification on HW2, Task 1(b) | |

As written in the task, you may use *ideas* from Slides 37-38 of Tutorials 6-8 or from the bonus part of Tutorial 8.5. However, if you wish to use the fact that Sender's optimal expected utility as a function of the prior is concave - you have to prove it (in fact, proving this is exactly the intention of Task 1(b)). |

עדכון אחרון ב-15/6/2023, 13:10:26 Last updated on 15/6/2023, 13:10:26 Последняя модификация15/6/2023, 13:10:26 تمت الحتلنة الأخيرة ب-15/6/2023, 13:10:26 |

## HW1 Grades Are Published | |

Please submit your appeals to the TA via email by 27.6. A subtle remark about using the term “group” in your solutions – it is OK to use it for groups of people, agents, etc. (many papers use this term), and sometimes it is also used for inanimate entities. However, you should note that a group is a term from group theory – “havura” in Hebrew, and a subgroup is “tat-havura”. Therefore, when talking about abstract objects and presenting the formal mathematical proof itself – it is better to use the terms “set” and “subset”. The term “collection” (which is somewhat vague, but sometimes it refers to sets for which one wants to avoid discussing whether they are necessarily sets in the set theory sense) is also OK. Regarding the bonus section of the last task - the full proof appears in the first half of Chapter 2 in the paper "Approximation techniques for utilitarian mechanism design" - Patrick Briest, Piotr Krysta and Berthold Vöcking (2005). Note that you can simplify the proof presentation - e.g., you don't really need to use the "bitonicity" notion defined in this chapter. The algorithm itself is quite simple - for a maximum bid B, it essentially wants to find K s.t B is between 2^K and 2^{K+1}, and run the algorithm from Sections (a)-(b) of the task with m=\frac{\epsilon 2^K}{n}. However, such an algorithm wouldn't yield a monotone allocation rule. Therefore, the idea is to run, for every k up to K, the algorithm from Sections (a)-(b) of the task with m=\frac{\epsilon 2^k}{n} and all the bids above 2^{k+1} replaced by 2^{k+1} (trying to guess the range [2^k,2^{k+1}) containing B). At first sight, it still doesn't need to yield a monotone allocation rule, as K depends on max b_i. And here comes the ingenious part - it turns out than when we return the best allocation among all iterations, with the tiebreak rule giving priority to earlier iterations - it can be straightforwardly shown that continuing running the iterations for *every k* (rather than stopping at k=K) doesn't change the resultant allocation! Thus, purely for the analysis, one can assume that we run the algorithm from Sections (a)-(b) of the task with m=\frac{\epsilon 2^k}{n} for any k>=1, and this way - we only use constant values of k. |

עדכון אחרון ב-13/6/2023, 23:50:11 Last updated on 13/6/2023, 23:50:11 Последняя модификация13/6/2023, 23:50:11 تمت الحتلنة الأخيرة ب-13/6/2023, 23:50:11 |

## The Tutorial (12:30-13:30) and Konstantin's Reception Hour (13:30-14:30) Tomorrow | |

Both will be held at Taub 7. The tutorial topic will be the VCG mechanism, and it will be held without slides (the tasks we shall solve might appear in HW in future years). We shall solve Exercises 7.2-7.3 and 7.5. See you! |

עדכון אחרון ב-13/6/2023, 17:49:30 Last updated on 13/6/2023, 17:49:30 Последняя модификация13/6/2023, 17:49:30 تمت الحتلنة الأخيرة ب-13/6/2023, 17:49:30 |

## An Important Update on Konstantin's Tutorials, Reception Hours and Availability Until the Semester End | |

Dear students, I'm available via email for asking any questions about the course material, the final projects or bureaucracy. Besides this, the rest of my schedule will look as follows - *please ignore the usual schedule from this point on*: Monday 12.6 13:30-14:30 - reception hour at Taub 301. Wednesday 14.6 12:30-13:30 - Tutorial 12 (The VCG auction); room TBA. Wednesday 14.6 13:30-14:30 - reception hour; room TBA I'm also available for scheduling special reception hours by request via email by Friday 16.6 (inclusive). During the week of 18.6-24.6, there will be no lessons / reception hours and I won't be able to schedule special reception hours, as I'm co-organizing two events - a summer school at Berkeley and a virtual tutorial on information design preceding the EC conference. If you are interested, you may register for the virtual tutorial by registering (free of charge) for the EC 2023 Preview Week using the following link: https://docs.google.com/forms/d/e/1FAIpQLSd6ftDo2Z7VCCV6K3LnQYTu-Aw9qRvvtcM3expj-RuFMYDB9Q/viewform?pli=1 The website of the tutorial: https://zabarnyi.cswp.cs.technion.ac.il/ec-2023-tutorial-information-design-algorithmic-fundamentals-and-new-frontiers/ You can also register for participating virtually in the EC (Economics and Computation) conference itself, but it costs starting from 25 USD. I will still be available via email during that week, by I kindly ask you to try and ask as many questions as you can before that week, since my schedule will be extremely tight and due to the time differences with California. Monday 26.6 13:30-14:30 - reception hour at Taub 301. Starting from this date, it will be possible again to schedule special reception hours by request via email. Sunday 2.7 11:30-12:30 - Zoom reception hour. The last tutorial is *tentatively* scheduled to Monday July 3 12:30-13:30 (topic TBA), but it still might change. Have a nice weekend! Konstantin |

עדכון אחרון ב-9/6/2023, 19:13:11 Last updated on 9/6/2023, 19:13:11 Последняя модификация9/6/2023, 19:13:11 تمت الحتلنة الأخيرة ب-9/6/2023, 19:13:11 |

## Planned course schedule till the end of the semester | |

Here's the planned schedule till the end of the course (watch out for future updates please). There is one lesson and one recitation at unusual times (marked with a *), these will be recorded of course. Thanks so much in advance for your understanding and flexibility, much appreciated! Monday 12.6 2-hour lesson 11:30-13:30 (no recitation) *Wednesday 14.6 1-hour recitation around noon (time TBA) *Friday 16.6 3-hour lesson 9:00-12:00 Week of 18.6 no lesson/recitation (course staff is giving a summer school at Berkeley) Monday 26.6 3-hour lesson 10:30-13:30 Monday 3.7 2-hour lesson 10:30-12:30 Monday 3.7 1-hour recitation 12:30-13:30 (tentative) |

פורסם ב-7/6/2023, 14:30:49 Created on 7/6/2023, 14:30:49 Создано7/6/2023, 14:30:49 تم النشر ب-7/6/2023, 14:30:49 |

## Some Remarks Following HW1 Check | |

You are allowed to read the hints at the end of the course textbook, but you still must prove them if you wish to use them. A general well-known advice: If you believe that some problem statement has multiple interpretations, then (whether it is indeed the case or not) you should ask the staff rather than choosing the interpretation more convenient to you. You should read the messages on the course website. In particular, one such message emphasized in the context of HW1, Task 4 that an allocation rule always gets as input the bids, not the valuations. In this specific case, you will only lose 1 point if you referred to an allocation rule as depending directly on the valuations. |

עדכון אחרון ב-6/6/2023, 01:50:34 Last updated on 6/6/2023, 01:50:34 Последняя модификация6/6/2023, 01:50:34 تمت الحتلنة الأخيرة ب-6/6/2023, 01:50:34 |

## Resuming lectures - today 11:30-13:30 | |

As the strike is over, let's meet today for Inbal's lecture at 11:30 (one hour later than usual). There will be no recitation. |

פורסם ב-5/6/2023, 08:14:48 Created on 5/6/2023, 08:14:48 Создано5/6/2023, 08:14:48 تم النشر ب-5/6/2023, 08:14:48 |

## Konstantin's Reception Hour Next Week Is Shifted to the Upcoming Thursday, 1.6, 8:00-9:00 (Zoom Only) | |

There will be no reception hour next week |

פורסם ב-30/5/2023, 15:20:41 Created on 30/5/2023, 15:20:41 Создано30/5/2023, 15:20:41 تم النشر ب-30/5/2023, 15:20:41 |

## The List of Papers for the Final Projects Will Be Locked Today on 19:15 |

פורסם ב-22/5/2023, 19:00:43 Created on 22/5/2023, 19:00:43 Создано22/5/2023, 19:00:43 تم النشر ب-22/5/2023, 19:00:43 |

## A Clarification on HW1, Task 4, Following Students' Questions | |

As follows from the second paragraph in Problem 4.2 formulation, the described algorithm is for the knapsack *problem*, not the knapsack auction (the word "auction" is not mentioned in that paragraph). In particular, the v_i-s in the algorithm formulation are the values of the items from the knapsack problem. In contrast, in Subsections (c)-(e), you are asked about the knapsack *auction*. The allocation rule that the given algorithm yields is obtained by running the given algorithm when the input for the v_i-s are the *bids*, not the valuations (it is similar to using the same name for the variables in the main function and a helper function). The allocation rule *always* gets as input the bids, and not the valuations (as valuations are private, and the auctioneer cannot observe them directly). While when assuming truthful bidding the bids equal the valuations, you cannot use these two terms interchangeably when proving or disproving monotonicity. The definition of monotonicity talks about increasing the bid, not the valuation (a bidder cannot change her valuation). |

עדכון אחרון ב-22/5/2023, 12:18:15 Last updated on 22/5/2023, 12:18:15 Последняя модификация22/5/2023, 12:18:15 تمت الحتلنة الأخيرة ب-22/5/2023, 12:18:15 |

## The Lessons Today Will Be in Taub 9 |

פורסם ב-21/5/2023, 10:12:41 Created on 21/5/2023, 10:12:41 Создано21/5/2023, 10:12:41 تم النشر ب-21/5/2023, 10:12:41 |

## A Clarification Was Added to HW2, Task 2 (e) |

פורסם ב-19/5/2023, 18:57:41 Created on 19/5/2023, 18:57:41 Создано19/5/2023, 18:57:41 تم النشر ب-19/5/2023, 18:57:41 |

## HW2 Is Published (Earlier than Planned, Following Students' Requests) + An Announcement | |

The submission (in singles, electronically, in a single pdf file created using LaTeX) is due on June 25 (23:59). For the last two tasks, you need the material that will be taught on Sunday. Regarding another topic - until the strike of the senior staff is over, Inbal will not be able to give any lectures. Due to the delays it causes - we encourage you to dedicate your time to working on the projects. The course staff will be available via email for any questions regarding the projects. Good luck and have a nice weekend! |

עדכון אחרון ב-19/5/2023, 18:45:54 Last updated on 19/5/2023, 18:45:54 Последняя модификация19/5/2023, 18:45:54 تمت الحتلنة الأخيرة ب-19/5/2023, 18:45:54 |

## Some Important Updates | |

Dear students, 1. Konstantin will hold two lessons on Sunday, May 21, 16:30-18:30 (room TBA). During the lessons, we shall first finish, without slides, Problem 5.1 from last tutorial (please make sure you come to class with the problem formulation in front of you!). Then we shall go over Chapter 8 from the course textbook, with slides (i.e., there will be a lecture). Both lessons will be recorded. 2. The material required for HW2 is the material taught by Sunday, May 21. 3. Konstantin's reception hours on May 22 and May 29 will be *virtual only*, during the usual time slot (the Zoom link will be uploaded soon). 4. If you wish to schedule a special reception hour with Konstantin before HW1 deadline, please contact him via email by *May 21*. 5. Konstantin will not give lessons on May 22, May 29 and June 5. Some or all of these slots may be taken by Inbal if the strike is over - please follow the announcements. 6. Anyway, there will be no lecture and no tutorial on June 19. Best, The course staff |

עדכון אחרון ב-18/5/2023, 16:13:40 Last updated on 18/5/2023, 16:13:40 Последняя модификация18/5/2023, 16:13:40 تمت الحتلنة الأخيرة ب-18/5/2023, 16:13:40 |

## במידה וביום שני הקרוב יהיו שיבושי לימודים - ההרצאה והתרגול יתקיימו ביום ראשון שלפניו בשעות 16:30-19:30 | |

נכון לרגע זה ובמידה ולא נודיע אחרת - השיעורים מתקיימים כמתוכנן |

פורסם ב-17/5/2023, 02:21:52 Created on 17/5/2023, 02:21:52 Создано17/5/2023, 02:21:52 تم النشر ب-17/5/2023, 02:21:52 |

## A Clarification on Problem 2.2 from HW1 | |

You have to prove a necessary and sufficient condition on S (in terms of valuations of bidders inside/outside S) for the ability of the members of S to strictly increase the sum of their utilities by non-truthful bidding. You do *not* have to explain how should the members of S bid to maximize the sum of their utilities. |

עדכון אחרון ב-16/5/2023, 00:55:46 Last updated on 16/5/2023, 00:55:46 Последняя модификация16/5/2023, 00:55:46 تمت الحتلنة الأخيرة ب-16/5/2023, 00:55:46 |

## Postponement of HW2 Publication | |

Because of the slow progress in the material due to the strike, and given students' concerns about the significant overlapping between the time allocated to HW1 and HW2 - we decided to postpone the publication (and the due date) of HW2 by a week. HW3 will not be postponed (we are not allowed to set the due date after the semester end), but it will be shorter than we originally planned. |

עדכון אחרון ב-15/5/2023, 23:17:29 Last updated on 15/5/2023, 23:17:29 Последняя модификация15/5/2023, 23:17:29 تمت الحتلنة الأخيرة ب-15/5/2023, 23:17:29 |

## An Email Encouraging Selecting a Final Project Paper on Bayesian Persuasion | |

Dear students, Unfortunately, no team has chosen to work on a Bayesian persuasion paper by now. It might be due to your impression of this topic as a hard one, based, among other things, on my comments intended to encourage you to come to the lessons and actively participate. Of course, I cannot be fully objective since Bayesian persuasion is my main research interest, but I suggest you to consider the following issues before making a final decision on the paper: - The main conceptual hardness of Bayesian persuasion is the idea of considering the signaling scheme to be a single distribution over posteriors and understanding the splitting lemma and the main theorem (ideally - with their proofs). Once you get used to working with distributions over posteriors, the topic becomes not that hard compared to other topics from our course. In particular, if you have a strong general mathematical background, or you are interested in probability, convexity and optimization - you do not have to be scared of Bayesian persuasion at all. - There are many extensions of the original Bayesian persuasion model explored in papers from the published list, in each of them there are many interesting research questions to study. - In the past two years, the attendance to the Bayesian persuasion lessons was much worse than this year (which might have affected the performance in HW). Still, several teams did good job on Bayesian persuasion projects. - You have to understand the concept of Bayesian persuasion anyway, unless you are OK with getting a very low grade in HW2 (about 50% of which will be dedicated to Bayesian persuasion). Best, Konstantin |

עדכון אחרון ב-15/5/2023, 21:07:55 Last updated on 15/5/2023, 21:07:55 Последняя модификация15/5/2023, 21:07:55 تمت الحتلنة الأخيرة ب-15/5/2023, 21:07:55 |

## Tutorial 9 Tomorrow | |

We shall solve Exercises 5.1 (a), 5.2 and 5.3 and Problem 5.1. Note that these questions are important for HW2. The tutorial will be held without slides. |

פורסם ב-14/5/2023, 19:33:38 Created on 14/5/2023, 19:33:38 Создано14/5/2023, 19:33:38 تم النشر ب-14/5/2023, 19:33:38 |

## The list of final project papers is published under the course material | |

Please register by writing the IDs of the students in your team in the relevant fields (if you do not have a third team member - please write "-" in the field "student 3 ID"). Please register by 21/5 23:59 (then the list will be locked, and you will not be able to change your paper choice without a special permission from the course staff). |

עדכון אחרון ב-9/5/2023, 23:54:04 Last updated on 9/5/2023, 23:54:04 Последняя модификация9/5/2023, 23:54:04 تمت الحتلنة الأخيرة ب-9/5/2023, 23:54:04 |

## A Correction to Slides + An Asynchronous Complementary Tutorial | |

Dear students, 1. The original Slide 35 in the presentation for Tutorials 6-8 contained an inaccuracy in the expression for \Sigma^* and its support, which is now corrected. More details are provided in the asynchronous complementary tutorial as described in the next bullet. 2. A recording of an asynchronous complementary Tutorial 8.5 was uploaded to the course website. This tutorial is part of the course material, but you may skip some of its parts using your discretion. Detailed contents of the tutorial are provided near the link to its recording. 3. Tutorial 8.5 is about information design and algorithmic mechanism design (Problem 4.3 (b)-(c)). It is not required for understanding the material of the lessons next week. |

עדכון אחרון ב-9/5/2023, 02:13:42 Last updated on 9/5/2023, 02:13:42 Последняя модификация9/5/2023, 02:13:42 تمت الحتلنة الأخيرة ب-9/5/2023, 02:13:42 |

## The Guidelines for the Final Projects (Including the Mid-Report) Were Published | |

Moreover, you can find the obligatory template for the final report under the course material section. You must work on the projects either in pairs or in triples (your choice). Working individually requires getting a special approval from the lecturer. We shall publish the list of papers for the project within 36 hours. Each team must sign up for a paper by writing the student IDs of all the team members in the appropriate fields near the chosen paper. Please be polite to other teams and avoid fighting over papers. In general, it is not possible for more than one team to work on the same paper. However, if for some reason you have a strong preference to work on a paper already taken by another team - please contact the lecturer to ask for a special approval. |

פורסם ב-8/5/2023, 01:34:16 Created on 8/5/2023, 01:34:16 Создано8/5/2023, 01:34:16 تم النشر ب-8/5/2023, 01:34:16 |

## Update of the Program for Tomorrow's Tutorial | |

We shall first finish information design (including some proofs we skipped today). Then we shall finish solving Problem 4.3. |

עדכון אחרון ב-8/5/2023, 00:28:46 Last updated on 8/5/2023, 00:28:46 Последняя модификация8/5/2023, 00:28:46 تمت الحتلنة الأخيرة ب-8/5/2023, 00:28:46 |

## Some Minor Updates Were Performed in Tutorial 6-7 Slides | |

Including a typo correction is Slide 35 |

עדכון אחרון ב-7/5/2023, 14:38:34 Last updated on 7/5/2023, 14:38:34 Последняя модификация7/5/2023, 14:38:34 تمت الحتلنة الأخيرة ب-7/5/2023, 14:38:34 |

## The Complementary Lessons Tomorrow Will Go Ahead As Planned |

פורסם ב-6/5/2023, 22:51:28 Created on 6/5/2023, 22:51:28 Создано6/5/2023, 22:51:28 تم النشر ب-6/5/2023, 22:51:28 |

## Complementary Lessons + Announcements | |

1. Konstantin will give 2 complementary tutorial hours this Sunday (May 7) 16:30-18:30 in Taub 8. The topic will be information design. We remind you that this topic is conceptually hard (especially the material that will be taught on the second part of the complementary tutorial). Thus, you are strongly encouraged to come and actively participate. Nevertheless, the tutorial will be recorded. We know that teaching such a topic during complementary lessons is not ideal, but it seems to be the only way to avoid a significant postponement of the rest of the information design material and keep up with the scheduled lecture-tutorial topics. 2. You are encouraged to read by yourself the definitions (and some simple examples) of a convex set, the convex hull of a set and a convex function before the complementary tutorials if you are not familiar with them, but we shall go over the definitions in class. 3. If there is a strike next Monday - the complementary tutorials will be shifted to the usual lecture hours on May 8. 4. Anyway, during the next usual tutorial hour (on May 8) we shall finish Problem 4.3 and solve Exercises 5.1 (a), 5.2 and 5.3 (without slides). 5. Following students' questions - as there is a possibility of future strikes, it is not possible yet to finalize the course schedule. For now - we decided not to postpone the publication date of HW2, but we shall review the decision again once the situation with the possible strike becomes clear. Please remember that anyway, the due date of HW2 encompasses an automatic extension of 7 days compared to the due date we consider reasonable. 6. We are planning to publish the list of papers for the final project next week. 7. Unfortunately, the bonus lecture was not recorded. However, the lecturer encourages you to contact him via the email address in the first slide of his presentation if you have any questions or just want to learn more about the discussed topics. |

עדכון אחרון ב-3/5/2023, 00:28:03 Last updated on 3/5/2023, 00:28:03 Последняя модификация3/5/2023, 00:28:03 تمت الحتلنة الأخيرة ب-3/5/2023, 00:28:03 |

## An Updated Version of HW1 with Several Clarifications Was Uploaded | |

Note the clarifications for Task 1 (specifically, Footnote 2), Task 3 and Task 4 (written in pink). We thank the students whose helpful questions, remarks and attention to extreme cases (including an extreme case that remained unnoticed for 3 years!) produced these clarifications. |

עדכון אחרון ב-1/5/2023, 15:21:33 Last updated on 1/5/2023, 15:21:33 Последняя модификация1/5/2023, 15:21:33 تمت الحتلنة الأخيرة ب-1/5/2023, 15:21:33 |

## An Important Clarification for HW1, Problem 4.2 | |

Unfortunately, it turns out that the hint for Problem 4.2(b) at the end of the course textbook is inconsistent with the algorithm presented in the problem formulation (we thank Oren for pointing this out). There are two possibilities to derive an FTPAS in the setting of Problem 4.2. Specifically, in the first bullet of the presented algorithm, you can either round every v_i up to the nearest multiple of m or round every v_i down to the nearest multiple of m. Both options are OK, but while the presented algorithm uses the former option, the hint for Subsection (b) is relevant for the second option. You are allowed to choose between rounding up or down in the first bullet of the algorithm formulation, but you must not change the rounding direction from subsection to subsection. If you decide to round down (unlike the textbook) - please mention it explicitly at the beginning of your solution. |

עדכון אחרון ב-1/5/2023, 11:59:18 Last updated on 1/5/2023, 11:59:18 Последняя модификация1/5/2023, 11:59:18 تمت الحتلنة الأخيرة ب-1/5/2023, 11:59:18 |

## Update for Tomorrow: 10:30-11:30 and 12:30-13:30 - Tutorials; 11:30-12:30 - Bonus Lecture |

עדכון אחרון ב-30/4/2023, 20:30:47 Last updated on 30/4/2023, 20:30:47 Последняя модификация30/4/2023, 20:30:47 تمت الحتلنة الأخيرة ب-30/4/2023, 20:30:47 |

## Important Updates Regarding the Lessons Next Week | |

Dear students, The three teaching hours and Konstantin's reception hour will be held next week. However, due to the strike of the senior academic staff, we have to change both the format of the lessons and the planned course schedule. Specifically: 1. Konstantin will finish solving Problem 4.3 (without slides), but the exercises from Section 5 will be postponed. 2. Konstantin will dedicate at least 1.5 hours to a new theoretical material - information design (Bayesian persuasion), which is a part of the course syllabus, but it will not be taught in the lectures and it does not appear in the course textbook (it is possible since information design is an orthogonal topic to mechanism design). This part of the lesson will be taught with slides. 3. If it works out, one hour will be a bonus lecture about ethics in AGT by a guest lecturer. While not required to get a good grade in the course, the lecture is expected to be exciting and it may help you in your future career. Unfortunately, we will probably only know on Sunday whether the bonus lecture will go on, and if yes - in which time slot. If it does not work out, Konstantin will teach information design for 2.5 hours. 4. We are expected to study information design for 3.5 hours in total this semester. Please note that this topic is conceptually challenging, and in the previous two years it was among the most problematic topics for the students in homework. Therefore, it is highly recommended that you come to the relevant lessons, listen and actively participate. 5. As information design is tightly connected to probability, it is recommended to recall what is conditional probability, Bayes' law and the law of total probability. 6. The three lesson hours next week will be recorded (but the bonus lecture will not be broadcast live). However, we stress again that it is not recommended to miss the information design lessons. Have a nice weekend! |

עדכון אחרון ב-1/5/2023, 11:44:39 Last updated on 1/5/2023, 11:44:39 Последняя модификация1/5/2023, 11:44:39 تمت الحتلنة الأخيرة ب-1/5/2023, 11:44:39 |

## HW1 Is Published | |

The submission (in singles, electronically, in a single pdf file created using LaTeX) is due on May 29 (23:59). Good luck! |

עדכון אחרון ב-24/4/2023, 03:34:28 Last updated on 24/4/2023, 03:34:28 Последняя модификация24/4/2023, 03:34:28 تمت الحتلنة الأخيرة ب-24/4/2023, 03:34:28 |

## Last and Next Tutorials | |

1. Towards the end of last tutorial, I briefly wrote on the board a general definition of the payment rule in auctions, which was incorrect. The payment rule gets as input the vector of bids and returns the vector of payments of the bidders. 2. When solving Problem 4.3 (a) and defining the instance of the auction, I forgot to specify the bids b_i of the bidders (which the allocation rule treats as if they were the true valuations v_i). In the reduction from Problem 4.3 (a), it is reasonable to take all the bids to be 1 - think why. 3. Next tutorial, we shall finish Problem 4.3 and solve Exercises 5.1 (a), 5.2 and 5.3. It will be held without slides. See you next week! |

עדכון אחרון ב-24/4/2023, 01:34:53 Last updated on 24/4/2023, 01:34:53 Последняя модификация24/4/2023, 01:34:53 تمت الحتلنة الأخيرة ب-24/4/2023, 01:34:53 |

## All Our Lessons Today Are Moved to Taub 1 |

עדכון אחרון ב-23/4/2023, 12:19:20 Last updated on 23/4/2023, 12:19:20 Последняя модификация23/4/2023, 12:19:20 تمت الحتلنة الأخيرة ب-23/4/2023, 12:19:20 |

## Some Announcements | |

1. Please read the solution of Exercise 2.8 from Tutorial 2 slides - unfortunately, we will not have time to go over it in class. 2. The complementary lectures and tutorial will be on the upcoming Sunday, April 23, 16:30-19:30 at Taub 7. 3. The upcoming tutorial will be held without slides, but it will be recorded. We will solve Problem 4.3 from the course textbook and talk a bit about the NP complexity class. 4. Note that there will be no lessons on Monday, April 24 (as that day will be according to a Thursday schedule). 5. Konstantin will not hold a prespecified reception hour in the upcoming week. Please contact Konstantin if you wish to schedule a reception hour. See you on Sunday! |

עדכון אחרון ב-21/4/2023, 16:30:48 Last updated on 21/4/2023, 16:30:48 Последняя модификация21/4/2023, 16:30:48 تمت الحتلنة الأخيرة ب-21/4/2023, 16:30:48 |

## LaTeX Bonus Task Grades Were Published | |

Your grade is the bonus you will get to HW1. If your submission didn't contain any significant issues - you will not get any feedback for it. |

עדכון אחרון ב-19/4/2023, 17:27:10 Last updated on 19/4/2023, 17:27:10 Последняя модификация19/4/2023, 17:27:10 تمت الحتلنة الأخيرة ب-19/4/2023, 17:27:10 |

## הרצאה+תרגול השלמה | |

ביום ראשון ה-23.4 יתקיימו הרצאת ותרגול השלמה בשעות 16:30-19:30 (שעתיים הרצאה ואז שעת תרגול). החדר יימסר בהמשך. חופשה נעימה! |

פורסם ב-4/4/2023, 15:55:39 Created on 4/4/2023, 15:55:39 Создано4/4/2023, 15:55:39 تم النشر ب-4/4/2023, 15:55:39 |

## LaTeX Bonus Task Has Been Published | |

The submission deadline is 18/04 23:59 (submission in singles). Submitting this task is optional, but it is highly recommended if you are not familiar with LaTeX (and it should be very easy otherwise), as you must submit all your further assignments using LaTeX. The grading will be "pass"/"fail", and if you pass - you will get a bonus of 10 points to HW1 grade (it is possible to get more than 100). Further general instructions for HW submissions are provided at the top of the HW section of the website. |

עדכון אחרון ב-28/3/2023, 15:04:52 Last updated on 28/3/2023, 15:04:52 Последняя модификация28/3/2023, 15:04:52 تمت الحتلنة الأخيرة ب-28/3/2023, 15:04:52 |

## לאור החלטת ראשי אוניברסיטאות המחקר על עצירת הלימודים, לא יתקיימו ההרצאה, התרגול ושעת הקבלה מחר | |

נעדכן כשנדע יותר. צוות הקורס |

עדכון אחרון ב-27/3/2023, 01:59:32 Last updated on 27/3/2023, 01:59:32 Последняя модификация27/3/2023, 01:59:32 تمت الحتلنة الأخيرة ب-27/3/2023, 01:59:32 |

## אנא היו ערניים לעדכונים נוספים שיכול ויגיעו במהלך הלילה או בבוקר | |

תודה, צוות הקורס |

פורסם ב-26/3/2023, 22:10:36 Created on 26/3/2023, 22:10:36 Создано26/3/2023, 22:10:36 تم النشر ب-26/3/2023, 22:10:36 |

## השיעור הראשון | |

שלום לכולם, ההרצאה הראשונה לא תכלול חומר שיופיע בשיעורי הבית או בעבודת הסיכום. התרגיל יועבר בזום ויוקלט. בהצלחה לכולנו, צוות הקורס |

פורסם ב-26/3/2023, 21:57:46 Created on 26/3/2023, 21:57:46 Создано26/3/2023, 21:57:46 تم النشر ب-26/3/2023, 21:57:46 |

## לו״ז הקורס + הודעות לקראת התרגול הראשון ושעת הקבלה של המתרגל | |

לאתר הקורס הועלה לו״ז משוער של המטלות. לצערנו, אין באפשרותנו לפרסם בשלב זה את לוח זמני ההוראה לפי נושאים או להתחייב שלא יהיו שינויים במועדי המטלות. זאת לאור חוסר הוודאות האופף את הסמסטר הקרוב, הכולל, בין היתר, אפשרות של שביתה ושיבושי לימודים. לאור הקושי לזהות פנים שיש למתרגל, אתם/ן מתבקשים/ות לשבת בכל התרגולים במהלך הסמסטר עם שלט עליו רשומים השם פרטי ושם המשפחה שלכם/ן (החשיבות של שם המשפחה היא למתן הבונוסים לציון על השתתפות פעילה). בתרגול הקרוב נדבר על מושגים בסיסיים בתורת המשחקים (חומר תיאורטי שאינו מופיע בחלקו בספר הקורס ולא יועבר בהרצאה) וכן נפתור את Exercise 1.3 מספר הקורס: Twenty Lectures on Algorithmic Game Theory מאת Tim Roughgarden. התרגול יועבר עם מצגת שתועלה לאתר לפני התרגול, אך אין צורך לעבור עליה מראש. רוב התרגולים במהלך הסמסטר יועברו גם הם עם מצגות, אך לא כולם (בדגש על תרגולים הכוללים פיתוחים מתמטיים כבדים או כאלה שנפתור בהם שאלה שעשויה להופיע בתרגילי בית בסמסטר אחר). מיד לאחר התרגול תתקיים (באופן קבוע) שעת קבלה של המתרגל בטאוב 301. לאור הסמיכות לתרגול - ייתכנו עיכובים קלים בהגעתו של המתרגל לחדר שעת הקבלה. בנוסף, ניתן לשאול את המתרגל על חומר הלימוד או תרגילי הבית בדוא״ל, או לתאם שעת קבלה פרטנית (אין צורך להודיע מראש במידה ומתכוונים להגיע לשעת הקבלה הקבועה). נתראה מחר! |

עדכון אחרון ב-26/3/2023, 20:47:41 Last updated on 26/3/2023, 20:47:41 Последняя модификация26/3/2023, 20:47:41 تمت الحتلنة الأخيرة ب-26/3/2023, 20:47:41 |

## ברוכות הבאות וברוכים הבאים לקורס ״תורת המשחקים החישובית״ | |

לאתר הקורס הועלה סילבוס מפורט, הכולל, בין השאר, את עיקרי דרישות הקורס וכן המלצות ללמידה. בנוסף, פורסמו שעות הקבלה של המתרגל. בימים הקרובים נפרסם לו"ז משוער של הקורס. בברכת סמסטר מוצלח, סגל הקורס |

פורסם ב-22/3/2023, 00:32:26 Created on 22/3/2023, 00:32:26 Создано22/3/2023, 00:32:26 تم النشر ب-22/3/2023, 00:32:26 |