Lectures in Fair Division 1000-2M26LFD
1. Introduction to Fair Cake-Cutting (divisible resource)
2. Introduction to Discrete Dair Division (indivisible resources)
3. Introduction to Fair Rent Division
4. Connections between fair division and fixed-point theory
5. Fairness and (economic) efficiency (2 lectures)
6. Discrete chores setting (2 lectures)
7. Market Design (2 lectures)
8. Fair division with charity
9. New Fairness notions for discrete setting (2 lectures)
10. Best-of-both-worlds: ex-ante and ex-post fairness guarantees with randomzied allocations
Main fields of studies for MISMaP
Course coordinators
Type of course
Learning outcomes
Knowledge:
- Knows fundamental problems and research directions in the theory fair division.
- Knows the basic algorithms around the well-studied notions of fairness and efficiency in resource allocation settings.
- Knows the formal tools to analyse algorithms for fair division
Skill:
- Can use new techniques in own research work (K_U01)
- Can use literature and research articles (in English) (K_U14)
Competences:
- understands the need to systematically read scientific articles to broaden and expand knowledge (K_K08)
- can formulate precise questions to deepen own understanding of the topic or to find the missing pieces of the reasoning (K_K02)
Assessment criteria
Final grade is based on points scored in a written exam. Same rules apply in the retake session.
The course can be taken in a PhD programme as a "methodological" one. In that case, there is an additional requirement of presenting one research article.
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes: