atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Who Can Win a Single-Elimination Tournament?

AAAI 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 29 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Lower the CR Model upset-rate requirement to p ≥ C ln{n}/n, for C ≥ 64CR Model tournaments · CR Model tournamentsprobability every player is an SE winner: p ≥ C ln{n}/n; ≥ 1-1/Ω(n^2)Helped
Use a generalized model with random edges incident to each player in at least (1/2+Δ)n pairsGeneralized tournament model · Generalized tournament modelprobability every player is an SE winner: p > c√(log{n}/(2Δn)); > 1-Ω(n^{(c-5)/2ln{2}})Helped
Combine the sufficient king conditions by partitioning the in-neighborhood into H, I, and JKing tournament-fixing conditions · Arbitrary tournamentsSE winner guaranteeHelped
Replace the prior perfect-matching requirement with the stated 3-king conditions3-king tournament-fixing conditions · Arbitrary tournamentsSE winner guaranteeHelped
Select a maximum k-path player for fixed k in a sufficiently large tournamentIterative matrix tournament solution · Arbitrary tournamentsSE winner guarantee: there exists a constant N_kHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy