Finite-game conjecture for the Manickam–Miklós–Singhi problem
Statement
Let , and consider the finite game in which the coefficients satisfy the zero-sum normalization from the Manickam–Miklós–Singhi problem. Two solutions are equivalent under permutations. Finite-game conjecture. The optimal solution has the form
where , and
This is the only optimal solution up to equivalence. It is presented as the finite counterpart of the proposed limit-game classification, and remains unproved in the source.
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.