MoL-2019-24: Colley, Rachael H. (2019) Guaranteeing Feasible Outcomes in Judgment Aggregation. [Report]
Preview |
Text
MoL-2019-24.text.pdf Download (682kB) | Preview |
Abstract
In this thesis, we identify properties which guarantee consistent outcomes in a model of judgment aggregation, called 'binary aggregation with rationality and feasibility constraints'. We consider an outcome to be consistent when we can guarantee that the outcome will abide by with the feasibility constraint when all voters provide a judgment that is consistent with the rationality constraint. In order to guarantee feasible outcomes, we take inspiration from the formula-based model of judgment aggregation and translate both properties and the consistency results which follow from them, to our model. We translate types of 'agenda properties' and 'domain restrictions' to our setting, in particular the (k-)median property and value restriction, respectively. Following this, we recreate the corresponding consistency results, guaranteeing feasible outcomes on rational profiles.
In turn, we study the computational complexity of problems related to the median property and value restriction, as well as their binary aggregation counterparts. Our results support the claim that they are complete for a class at least as hard as co-NP, and no harder than Π^p_2.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2019-24 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2019 |
| Subjects: | Computation Logic |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 05 Nov 2019 15:43 |
| Last Modified: | 05 Nov 2019 15:43 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1721 |
Actions (login required)
 |
View Item |
