The following pages link to (Q4583963):
Displaying 6 items.
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- A note on the complexity of manipulating weighted Schulze voting (Q2203580) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- Toward Computing the Margin of Victory in Single Transferable Vote Elections (Q5139621) (← links)
