Pages that link to "Item:Q2341131"
From MaRDI portal
The following pages link to Sorting out single-crossing preferences on networks (Q2341131):
Displaying 5 items.
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q2109969) (← links)
- The single crossing conditions for incomplete preferences (Q2259424) (← links)
- Condorcet domains, median graphs and the single-crossing property (Q2323590) (← links)
- Identifying Preferences in Networks With Bounded Degree (Q4628433) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)