arXiv (All)
open access
The Role of Degrees and Acyclic Neighborhoods in the Complexity of Tournament Fixing
The \textsc{Tournament Fixing} problem asks whether a knockout tournament can be scheduled to make a favorite player win when all pairwise match outcomes are given. Such tournaments are used in sports and provide models for elections and organizational decision-making. Although the problem is NP-har
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Money Making Matching Markets: Analyzing Student-Athlete Sorting and Welfare Outcomes under NCAA NIL-Policy#322633
- Strategic Effort and Non-Linear Positional Bandwagon Drafting Benefits in Multi-Stage Competitive Games: Evidence from Triathlon#1117225
- Sports law and institutional integrity in addressing match fixing and doping#667009
- The Ethics of Tennis: Can the Sport Grow Without Losing Its Integrity?#1318009
- A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL#997493
Record · ID 1386239
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive