WF 10:05-11:20, LSRC D106

Instructor: Vincent Conitzer (please call me Vince). Office hours: Monday 8:45-10am (LSRC D207), Wednesday 11:20-11:40am (catch me right after class), Friday 11:20-11:45am (catch me right after class).

Teaching Assistant: Andrew Kephart. Office hour: Wednesday 2:30-3:30pm in LSRC D301, and by appointment.

Textbook:

comfortable programming in language such as C (or C++) or Java

some knowledge of algorithmic concepts such as running times of algorithms; having some rough idea of what NP-hard means

some familiarity with probability (we will go over this from the beginning but we will cover the basics only briefly)

not scared of mathematics, some background in discrete mathematics, able to do simple mathematical proofs

If you do not have a standard undergraduate computer science background, the course may still be appropriate for you, but talk to me first. Well-prepared undergraduates are certainly welcome.

You do

Assignments: 35%

Midterm exams: 30%

Final exam: 30%

Participation: 5%

For a quals pass, you need a B+ grade or higher in the course. If you want to take the qualifying exam, it will be on Wednesday, August 20, 2014, 9am-noon, LSRC D106.

For the homework assignments, you may discuss them with another person, but you should do your own writeup, programming, etc. This also means that you should not take extremely detailed notes during your meeting with the other person; if you can't remember what you talked about, you probably didn't really understand it...

I have not taught this course for a while so we will be flexible with the schedule. Each topic will probably take a number of lectures to finish.

Sometimes, a book chapter will include more information than what we cover in class; in those cases, for the purpose of exams, you are only responsible for what we covered in class.

For your convenience there are links to chapters that are available online (which would be useful if you have an old edition of the book; the chapter correspondence is here).

Date |
Topic |
Materials |

8/27 | Introduction. | Chapter 1. Introduction slides: ppt, pdf. |

8/29-9/12 | Search. Constraint satisfaction and optimization problems. | Chapters 3, 4, 6.
Search slides: ppt, pdf. More search slides: ppt, pdf. For more about linear and integer programming, you can go to the website of a course I taught recently; especially the introduction and branch and bound lecture notes might be useful. Homework 1. Helper files: knight distances, queens file from Andrew, tile puzzle file 1 from Andrew, tile puzzle file 2 from Andrew. |

9/17, 9/19 | Game playing. | Chapter 5. Slides: ppt, pdf. |

9/19-10/8 | Logic. | Chapters 7, 8,
9.
Propositional logic slides: ppt, pdf. First-order logic slides: ppt, pdf. Homework 2. |

10/10-10/15 | Planning. |
Chapter 10. Planning slides: ppt, pdf. Homework 3. |

10/17-11/5 | Probabilistic reasoning. | Chapters 13-15. Probability slides: ppt, pdf. Bayes nets slides: ppt, pdf. Markov processes and HMMs slides: ppt, pdf. Homework 4. |

11/5-11/21 | Decision theory. Markov decision processes, POMDPs. Game theory. | Chapters 16, 17. Decision theory slides: ppt, pdf. MDP/POMDP slides: ppt, pdf. Game theory slides: ppt, pdf. Homework 5. |

SKIPPED | Machine learning (briefly, if time allows). | Chapters 18, 19, 20, 21. (You do not need
to know this in great detail since we will spend so little time on this in
class, the chapters are just in case you're interested.) |

Wrapping up. |