Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation

Dorothea Baumeister. Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation. PhD thesis, Heinrich Heine University Düsseldorf, 2012. [doi]

Abstract

Abstract is missing.