23 January 2020, Computational Social Choice Seminar, Ulle Endriss

Abstract

Matching is a research area at the intersection of game theory and social choice theory that is concerned with the design of mechanisms for pairing up agents belonging to two different groups, such as job seekers and companies. In this talk I will explain how to use ideas from mathematical logic (model theory) and computational logic (SAT solving) to obtain impossibility theorems regarding the design of matching mechanisms that satisfy certain intuitively appealing properties (e.g., regarding the stability and fairness of outcomes).

For more information on the Computational Social Choice Seminar, please consult https://staff.science.uva.nl/u.endriss/seminar/.