On the computational complexity of non-dictatorial aggregation (Q5154769)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7406496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of non-dictatorial aggregation |
scientific article; zbMATH DE number 7406496 |
Statements
On the Computational Complexity of Non-Dictatorial Aggregation (English)
0 references
5 October 2021
0 references
constraint satisfaction
0 references
multiagent systems
0 references
0 references
0.987536609172821
0 references
0.8684377670288086
0 references
0.8095836043357849
0 references
0.8053736686706543
0 references
0.7964000105857849
0 references
