Incompleteness and incomparability in preference aggregation: complexity results (Q646535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Incompleteness and incomparability in preference aggregation: complexity results |
scientific article; zbMATH DE number 5973653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incompleteness and incomparability in preference aggregation: complexity results |
scientific article; zbMATH DE number 5973653 |
Statements
Incompleteness and incomparability in preference aggregation: complexity results (English)
0 references
17 November 2011
0 references
preference in multi-agent systems
0 references
preference aggregation
0 references
computational complexity
0 references
uncertainty
0 references
elicitation
0 references
0.8129734992980957
0 references
0.8070203065872192
0 references
0.7887445092201233
0 references
0.785612940788269
0 references
0.7845672369003296
0 references
