Pages that link to "Item:Q2316935"
From MaRDI portal
The following pages link to \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935):
Displaying 8 items.
- Exploring the median of permutations problem (Q1711664) (← links)
- Voting paradoxes and digraphs realizations (Q1865256) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- The nonmanipulative vote-deficits of voting rules (Q2695443) (← links)
- Voting 'Against' in regular and nearly regular graphs (Q4907272) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- On weakly and strongly popular rankings (Q6094721) (← links)
- Construction of aggregation paradoxes through load-sharing models (Q6159384) (← links)