Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates (Q2941740)
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 6475328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates |
scientific article; zbMATH DE number 6475328 |
Statements
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (English)
0 references
25 August 2015
0 references
0.8902056217193604
0 references
0.8757966756820679
0 references
0.8544179201126099
0 references
0.8505573272705078
0 references
0.8477466106414795
0 references