Polynomial asymptotic conjecture for multi-party auction vulnerability counts
Statement
Let be a positive integer and let be the input size. Define
where is the auction-output function. Asymptotic form conjecture for . There exists a positive rational number such that
This conjecture gives a leading-term description of the number of input tuples for which the auction output equals the targeted input. Empirical interpolation for several values of supports the conjecture, with the observed leading coefficients close to , but the general assertion remains open.
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.