Research map / Learning theory and algorithms / Submodular and game algorithms
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? (AAAI 2026 · similarity 0.93)
- Adaptive Manipulation for Coalitions in Knockout Tournaments (AAAI 2025 · similarity 0.92)
- An Exercise in Tournament Design: When Some Matches Must Be Scheduled (AAAI 2024 · similarity 0.91)
- Who Can Win a Single-Elimination Tournament? (AAAI 2016 · similarity 0.91)
- How to Make Knockout Tournaments More Popular? (AAAI 2024 · similarity 0.88)
- A Matching-Based Algorithm for the Traveling Tournament Problem (AAAI 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.