In computational social choice, a major challenge is to model and reason about complex collective decision making processes. An example of a combinatorial domain is multi-winner voting in which a set of candidates are selected. Another example is making decisions on multiple related issues simultaneously.  The goal of this project will be to mathematically model how agents express preferences over combinatorial outcomes as well as to propose efficient algorithms that satisfy desirable axioms.


Computer Science and Engineering

Research Area

Algorithms | Artificial intelligence

The project will involve working with members of the Algorithmic Decision Theory group.

This project will require the student to learn about recent developments in resource algorithms. Some algorithms which have not been implemented will be both implemented and tested by the student.

The expected outcome of the project will be a technical report which surveys the algorithms considered during the project as well as an understanding of some of the key issues involved in the field. One other major outcome will be implementation of some state of the art algorithms and evaluation of their relative performance over various metrics.