Pages that link to "Item:Q1207833"
From MaRDI portal
The following pages link to The bipartisan set of a tournament game (Q1207833):
Displaying 43 items.
- Representative democracy and the implementation of majority-preferred alternatives (Q284362) (← links)
- Nash equilibria and values through modular partitions in infinite games (Q409463) (← links)
- Minimal retentive sets in tournaments (Q483107) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- Set-rationalizable choice and self-stability (Q634537) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- Rank-based choice correspondences (Q673207) (← links)
- A new monotonicity condition for tournament solutions (Q708800) (← links)
- Accessibility in oriented networks (Q869605) (← links)
- Set-monotonicity implies Kelly-strategyproofness (Q904832) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Choosing from a large tournament (Q1024772) (← links)
- Probabilities within optimal strategies for tournament games (Q1343161) (← links)
- A theorem on symmetric two-player zero-sum games (Q1363375) (← links)
- Condorcet choice correspondences: A set-theoretical comparison (Q1377475) (← links)
- Choosing from a weighted tournament (Q1575093) (← links)
- Bounds for mixed strategy equilibria and the spatial model of elections (Q1599828) (← links)
- Distributive politics and electoral competition (Q1599829) (← links)
- Extending tournament solutions (Q1616754) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Optimal strategies for random tournament games (Q1805310) (← links)
- Tournament games and Condorcet voting (Q1805311) (← links)
- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games (Q1935924) (← links)
- Representation in majority tournaments (Q1964740) (← links)
- Tournament solutions based on cooperative game theory (Q2178642) (← links)
- On the subgame perfect implementability of voting rules (Q2244426) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- Equilibrium existence for zero-sum games and spatial models of elections (Q2384431) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- Multidimensional electoral competition between differentiated candidates (Q2411520) (← links)
- A new old solution for weak tournaments (Q2450153) (← links)
- Uncovered sets (Q2453411) (← links)
- Social choice and electoral competition in the general spatial model (Q2490129) (← links)
- Downsian competition when no policy is unbeatable (Q2501073) (← links)
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games (Q2576212) (← links)
- Strategy-proofness of the randomized Condorcet voting system (Q2628714) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- An analytical and experimental comparison of maximal lottery schemes (Q2667570) (← links)
- Rational stability of choice functions (Q6053637) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
