| Computational Social Choice |
|
Course outline |
Social choice studies how groups of agents aggregate their preferences to reach a collective decision. In this course, we are interested in both computational and analytical aspects of this decision making. We plan to cover classical and recent results in computational social choice, particularly in fair division, voting, and matching. Evaluation will be on the basis of assignments, quizzes, in-class exams, and either a project or a paper presentation.
|
|
Prerequisites |
The course will be easier if you've taken algorithms, linear and nonlinear programming, and algorithmic game theory. You are welcome to take the course if you haven't taken these, though some extra effort may be required.
|
|
Details |
Classes will be held Wed / Fri 11:30-1 pm in A-201.
Classes begin on Friday, August 21st.
|
|
Reference material |
The following courses also cover similar material:
|
|
Lectures |
| Aug 19: Lecture Notes |
Markets and equilibria.
References:
|