The following pages link to Choosing from a tournament (Q1089228):
Displaying 37 items.
- King-chicken choice correspondences (Q2108774) (← links)
- Characterising scoring rules by their solution in iteratively undominated strategies (Q2168539) (← links)
- Choice resolutions (Q2235096) (← links)
- An axiomatic characterization of the Slater rule (Q2235101) (← links)
- The solution of generalized stable sets and its refinement (Q2243513) (← links)
- On the subgame perfect implementability of voting rules (Q2244426) (← links)
- Condorcet choice and the Ostrogorski paradox (Q2272188) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- Condorcet choice correspondences for weak tournaments (Q2386312) (← links)
- Comparison functions and choice correspondences (Q2386329) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- A new old solution for weak tournaments (Q2450153) (← links)
- Uncovered sets (Q2453411) (← links)
- In quest of the Banks set in spatial voting games (Q2453435) (← links)
- Fuzzy social choice: a selective retrospect (Q2466739) (← links)
- Weakened WARP and top-cycle choice rules (Q2468509) (← links)
- Social choice and electoral competition in the general spatial model (Q2490129) (← links)
- A refinement of the uncovered set in tournaments (Q2633439) (← links)
- Black and Farquharson on order-of-voting effects: An extension (Q2640427) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- ON THE CHACTERISTIC NUMBERS OF VOTING GAMES (Q3444828) (← links)
- Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
- (Q4883193) (← links)
- (Q4934188) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A new perspective on implementation by voting trees (Q5198671) (← links)
- FUZZY SETS IN POLITICAL SCIENCE: AN OVERVIEW (Q5386749) (← links)
- Robust bounds on choosing from large tournaments (Q5918815) (← links)
- A note on the McKelvey uncovered set and Pareto optimality (Q5964644) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)
- Rational stability of choice functions (Q6053637) (← links)
- Two‐stage majoritarian choice (Q6059521) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
- Revealed VNM-solutions: characterizations (Q6545007) (← links)
- A solution for abstract decision problems based on maximum flow value (Q6589395) (← links)
- Building bridges over the great divide (Q6637494) (← links)
