Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs (Q5000656)
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: Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs |
scientific article; zbMATH DE number 7371753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs |
scientific article; zbMATH DE number 7371753 |
Statements
Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs (English)
0 references
15 July 2021
0 references
probabilistic rules
0 references
unanimity
0 references
single-peaked preferences
0 references
strategy-proofness
0 references
graphs
0 references
block trees
0 references
0 references
0 references
0 references
0.8704020380973816
0 references
0.8630298376083374
0 references
0.8428072333335876
0 references
0.8368126153945923
0 references
0.8076285123825073
0 references
