2 papers
cs.CC2025
Multiquadratic Sum-of-Squares Lower Bounds Imply VNC VNP
Benjamin Rossman, Davidson Zhu
The \emph{sum-of-squares (SoS) complexity} of a -multiquadratic polynomial (quadratic in each of blocks of variables) is the minimum such that $f = \sum_{i=1}^s…
cs.GT2025
Fair Multi-agent Persuasion with Submodular Constraints
Yannan Bai, Kamesh Munagala, Yiheng Shen +1
We study the problem of selection in the context of Bayesian persuasion. We are given multiple agents with hidden values (or quality scores), to whom resources must be allocated by…