Tardos-code convergence and orthogonal-projection conjecture for worst collusion attacks
Statement
Let be the bias parameter, let be the collusion size, and let denote the output-one probability under the worst collusion attack. For the Tardos pdf
define
Tardos worst-attack convergence conjecture. As the collusion size increases, the worst collusion attack makes converge to . More specifically, is the orthogonal projection of onto the affine subspace spanned by the Bernstein polynomials and containing the polynomial ; equivalently,
The claim is presented as a conjecture inferred from numerical optimization, with no formal proof supplied in the paper.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.