The permutation-degree conjecture for friendly triangulations
Statement
Let be a triangulation of the partition simplex , and let be a consistent labeling of . A triangulation is friendly when it has the ownership structure required for the labeling in the paper, and a labeling is single-valued when it assigns one element of to each vertex.
Permutation-degree conjecture. The labeling induces a single-valued labeling such that
This conjecture is the extension to of the lemma used to prove the existence of connected envy-free divisions for three selective agents. Establishing it would extend the combinatorial argument to more agents; the paper states that the authors could not prove it for .
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.