Pages that link to "Item:Q4326540"
From MaRDI portal
The following pages link to Tournament games and positive tournaments (Q4326540):
Displayed 25 items.
- Minimal retentive sets in tournaments (Q483107) (← links)
- Minimal stable sets in tournaments (Q634517) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- Probabilities within optimal strategies for tournament games (Q1343161) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Extending tournament solutions (Q1616754) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Pick's inequality and tournaments (Q1801444) (← links)
- Optimal strategies for random tournament games (Q1805310) (← links)
- Tournament games and Condorcet voting (Q1805311) (← links)
- Representation in majority tournaments (Q1964740) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Tournament solutions based on cooperative game theory (Q2178642) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games (Q2576212) (← links)
- An analytical and experimental comparison of maximal lottery schemes (Q2667570) (← links)
- (Q4521493) (← links)
- Robust bounds on choosing from large tournaments (Q5918815) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)