Proportional Representation in Temporal Voting with Ranked Preferences

arXiv:2609.30555 · cs.GT, cs.AI · Submitted 2026-09-24 · Read on arXiv

cs.GT, cs.AI

Submitted: 2026-09-24

Updated: 2026-09-24

Terminology

• Axioms — 77× in this paper · explained in 2 episodes
• Verification — 58× in this paper · explained in 2 episodes
• Alignment — 4× in this paper · explained in 1 episode
• Greedy Cohesive Rule — 3× in this paper
• ACM Conference on Economics and Computation — 2× in this paper
• International Joint Conference on Artificial Intelligence — 2× in this paper
• AI Alignment — 1× in this paper · explained in 2 episodes
• Aggregation — 1× in this paper · explained in 1 episode
• International Conference on Machine Learning — 1× in this paper
• Method of Equal Shares — 1× in this paper

Sources

• Online Temporal Voting: Strategyproofness, Proportionality and Asymptotic Analysis
• The Price of Proportional Representation in Temporal Voting
• Strengthening Full Justified Representation: Efficient Verification and Computation

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• In-Context Credit Assignment via the Core
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
• Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
• LLM Bidders Preserve the Mechanism-Level Orderings of Human Bidders
• Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps