## נושאים בגבול כלכלה וחישוב –67677

### Topics on the Border of Computation and Economics

### Place and Time

שפרינצק 216 — Sundays 10-12 — Fall 2009/10 (תש”ע)

### Instructors

Noam Nisan and Michal Feldman.

### Course Text

The course will be based mostly on parts I & III from the book Algorithmic Game Theory (online version).

### Syllabus (tentative)

- Introduction: Games and CS
- Pure Nash Equilibria
- Potential Games and Congestion Games
- Price of Anarchy and of Stability
- Convergence to pure equilibrium
- The class PLS
- Network creation games
- Scheduling Games
- Communication complexity of Convergence
- Coalitions and strong equilibria
- Subgame perfection and backward induction
- game-tree evaluation and alpha-beta pruning
- Mixed Nash equilibrium
- Nash’s Theorem, Brouwer Fixed point Theorem, Sperner’s Lemma
- The class PPAD
- Lemke-Howson Algorithm
- Epsilon-Nash
- Correlated equilibrium
- Mediators and their simulation
- Regret Minimization

### Course Requirements

- Attend (essentially) all classes
- Solve 3-4 homework exercises
- Write one set of Lecture Notes using this LaTeX template. You can sign up for scribe duty here.
- Grade the solutions of the entire class for one homework question
- Write one new Wikipedia entry (Hebrew or English) on a topic of your choice that is covered by the course.

Advertisements

on December 19, 2009 at 7:31 pm |Amos Kleinbergerאשמח לסכם בעברית על

Correlated equilibrium

תודה

on January 2, 2010 at 5:59 pm |DocHarrisMeyerI’m with Amos and correlated equilibrium.

on January 10, 2010 at 4:04 pm |Computer Science and Economics « Abner’s Postgraduate Days[…] Topics on the Border of Computation and Economics, Noam Nisan and Michal Feldman, Fall […]

on January 15, 2015 at 9:02 am |RebekahHi webmaster do you need unlimited articles for your site ?

What if you could copy post from other websites, make it unique and publish on your page – i know the

right tool for you, just search in google:

loimqua’s article tool