Pages that link to "Item:Q1366685"
From MaRDI portal
The following pages link to Tournament solutions and majority voting (Q1366685):
Displaying 50 items.
- On the reversal bias of the minimax social choice correspondence (Q277309) (← links)
- Representative democracy and the implementation of majority-preferred alternatives (Q284362) (← links)
- Axioms for centrality scoring with principal eigenvectors (Q284377) (← links)
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The Condorcet set: majority voting over interconnected propositions (Q402080) (← links)
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- Internal slackening scoring methods (Q430913) (← links)
- Renegotiation perfection in infinite games (Q457872) (← links)
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective (Q459386) (← links)
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- Can strategizing in round-robin subtournaments be avoided? (Q483532) (← links)
- On the solution of \(w\)-stable sets (Q502372) (← links)
- Strategic manipulation in tournament games (Q523525) (← links)
- Dynamic coalitional equilibrium (Q533100) (← links)
- A social choice theory of legitimacy (Q537545) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- Following the traces: an introduction to conjoint measurement without transitivity and additivity (Q706884) (← links)
- A new monotonicity condition for tournament solutions (Q708800) (← links)
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting (Q836934) (← links)
- Accessibility in oriented networks (Q869605) (← links)
- Dynamic stable set as a tournament solution (Q892846) (← links)
- Hyper-stable collective rankings (Q900257) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Set-monotonicity implies Kelly-strategyproofness (Q904832) (← links)
- The informational basis of scoring rules (Q905166) (← links)
- Winning isn't everything: how sports competition rules can make you want to lose (Q906032) (← links)
- Self-selective social choice functions (Q930487) (← links)
- The budget-voting paradox (Q931428) (← links)
- Computing the minimal covering set (Q943589) (← links)
- Ranking participants in tournaments by means of rating functions (Q952697) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A characterization of the Copeland solution (Q985210) (← links)
- Strategy-proofness and weighted voting (Q991312) (← links)
- Characterization of dominance relations in finite coalitional games (Q993504) (← links)
- Uncovered set choice rules (Q1024770) (← links)
- Choosing from a large tournament (Q1024772) (← links)
- Approximability of Dodgson's rule (Q1024774) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Neighborhood monotonicity, the extended Zermelo model, and symmetric knockout tournaments (Q1043567) (← links)
- Jeffrey Scot Banks (1958--2000) (Q1411039) (← links)
