Pages that link to "Item:Q256771"
From MaRDI portal
The following pages link to Computational complexity in the design of voting rules (Q256771):
Displaying 4 items.
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Social choice and computational complexity (Q1101310) (← links)
- Bounds for the Nakamura number (Q2417421) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)