Pages that link to "Item:Q2386202"

The following pages link to The computational complexity of the elimination problem in generalized sports competitions (Q2386202):

Displaying 7 items.

• Refining the complexity of the sports elimination problem (Q896666) (← links)
• On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
• A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
• Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
• Determining the results of tournament games using complete graphs generation (Q1715680) (← links)
• Soccer is Harder Than Football (Q2947803) (← links)
• Tournament schedules and incentives in a double round‐robin tournament with four teams (Q6187281) (← links)