.png){kind=icon}
Return
Lifting integrity constraints in binary aggregation
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2013.05.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider problems in which several individuals each need to make a yes/no choice regarding a number of issues and these choices then need to be aggregated into a collective choice. Depending on the application at hand, different combinations of yes/no may be considered rational. We describe rationality assumptions as integrity constraints using a simple propositional language and we explore the question of whether or not a given aggregation procedure will lift a given integrity constraint from the individual to the collective level, i.e., whether the collective choice will be rational whenever all individual choices are. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Collective decision making
Computational social choice
Multi-issue domains
Combinatorial vote
Judgment aggregation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
Role of Attachment to Surfaces on the Prevalence and Survival of Campylobacter through Food Systems
PREAI
ShareSaveShareSaveShareSaveHealth and well-being issues of Nepalese migrant workers in the Gulf Cooperation Council countries and Malaysia: a systematic review.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAIShareSave
View more