Pages that link to "Item:Q3392310"
From MaRDI portal
The following pages link to The Computational Complexity of Choice Sets (Q3392310):
Displaying 17 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- A distributed social choice protocol for combinatorial domains (Q524881) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Representations of votes based on pairwise information: monotonicity versus consistency (Q778380) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- Extending tournament solutions (Q1616754) (← links)
- The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet (Q1704412) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- A new old solution for weak tournaments (Q2450153) (← links)
- A note on contestation-based tournament solutions (Q2453439) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A new perspective on implementation by voting trees (Q5198671) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
