## HW1 and Course Book | |

+ https://www.cambridge.org/core/books/twenty-lectures-on-algorithmic-game-theory/A9D9427C8F43E7DAEF8C702755B6D72B This link is a link to the course book, it is available inside the Technion network. + In HW1, some of you claimed that the changes in problem 3.3 were incorrect - Thus, we will accept any answer to this question (the old version or the new version) as long as it is well-explained. Good Luck, Course Staff |

14/11/2018, 12:19:41 |

## HW1 mistake and deadline change | |

Hi, As some of you already noticed there is a mistake in the homework assignment. In Problem 3.2 the payment rule should be modified to a price of max(R/|S|, b_(k+1)) per bidder. In Problem 3.3 prove a weaker statement for the modified auction: -when the number of items k equals the number of bidders n, the Revenue Target Auction is group-strategyproof. Thanks to Shay, Hila and Lior for pointing that out. As a result, you can submit HW1 until November 19. Take into consideration that the 2nd assignment should be published on that day. Good Luck! |

6/11/2018, 14:30:53 |

## HW1 | |

For Homework 1 (out of 3), please solve the following from the course textbook (Twenty Lectures on Algorithmic Game Theory by Tim Roughgarden). Note that the textbook has both "exercises" and "problems", make sure you're solving the right one! Please *work alone and independently* (don't use references besides the course textbook; you're allowed to use the hints at the end of the textbook if you're stuck), type up your solution in Latex, and submit your solution to Ohad at the class of Monday November 12. Exercise 2.3 + Problem 3.2 (k-unit auctions) Exercise 2.8 + Exercise 3.4 (sponsored search – for Exercise 3.4 wait till after the lesson on Monday November 5) Problem 2.2 + Problem 3.3 (collusion) |

30/10/2018, 12:53:19 |

## Late Registration | |

If you're an undergrad who wants to take the course for credit but isn't registered, and you signed up during the first lesson, please email Inbal to confirm you're still interested. |

30/10/2018, 12:35:51 |

## Welcome to Algorithmic Game Theory! | |

+ Lecture Notes from Stanford course - https://theory.stanford.edu/~tim/notes.html + Online books - - https://www.cambridge.org/files/3914/7629/0049/Algorithmic_Game_Theory.pdf - http://jasonhartline.com/MDnA/ + We encourage you to write the assignments using latex or word. Some helpful links: - Latex Template - http://agttau-2017.wdfiles.com/local--files/scribe-notes/agt2017-template.tex - Latex tutorial - https://tobi.oetiker.ch/lshort/lshort.pdf - great place to start latex - https://www.overleaf.com/ Good Luck, Course Staff |

20/10/2018, 19:05:37 |