Linear Social Choice with Few Queries: A Moment-Based Approach
#linear social choice #queries #moment-based approach #collective decision-making #preference approximation
📌 Key Takeaways
- The article introduces a moment-based approach for linear social choice with minimal queries.
- It focuses on reducing the number of queries needed to make collective decisions in social choice theory.
- The method leverages statistical moments to approximate preferences efficiently.
- This approach aims to balance accuracy and computational efficiency in decision-making processes.
📖 Full Retelling
arXiv:2603.19510v1 Announce Type: cross
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
🏷️ Themes
Social Choice, Algorithmic Efficiency
Entity Intersection Graph
No entity connections available yet for this article.
Original Source
arXiv:2603.19510v1 Announce Type: cross
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
Read full article at source