[2603.19510] Linear Social Choice with Few Queries: A Moment-Based Approach

Computer Science > Computer Science and Game Theory arXiv:2603.19510 (cs) [Submitted on 19 Mar 2026] Title:Linear Social Choice with Few Queries: A Moment-Based Approach Authors:Luise Ge, Daniel Halpern, Gregory Kehne, Yevgeniy Vorobeychik View a PDF of the paper titled Linear Social Choice with Few Queries: A Moment-Based Approach, by Luise Ge and 3 other authors View PDF HTML (experimental) Abstract:Most social choice rules assume access to full rankings, while current alignment practice -- despite aiming for diversity -- typically treats voters as anonymous and comparisons as independent, effectively extracting only about one bit per voter. Motivated by this gap, we study social choice under an extreme communication budget in the linear social choice model, where each voter's utility is the inner product between a latent voter type and the embedding of the context and candidate. The candidate and voter spaces may be very large or even infinite. Our core idea is to model the electorate as an unknown distribution over voter types and to recover its moments as informative summary statistics for candidate selection. We show that one pairwise comparison per voter already suffices to select a candidate that maximizes social welfare, but this elicitation cannot identify the second moment and therefore cannot support objectives that account for inequality. We prove that two pairwise comparisons per voter, or alternatively a single graded comparison, identify the second moment; ...