The paper investigates proportional representation in a temporal voting setting where a single candidate is chosen each round and voters submit ranked preferences that may evolve over time. It extends classic proportionality axioms—justified representation (JR), proportional JR (PJR), extended JR (EJR), and proportionality for solid coalitions (PSC)—to accommodate various ways of determining which top-ranked candidates are considered approved, ranging from a fixed common cutoff to individual, round‑specific cutoffs. The authors analyze which axioms can be guaranteed under different informational assumptions about future rounds, showing that while EJR is unattainable, JR, PJR, and PSC can be achieved with a fixed cutoff if all preferences are known in advance; varying cutoffs reduce guarantees, yet PJR can still be achieved efficiently for groups that agree in every round, and PSC can be satisfied without future knowledge. They also demonstrate that checking these axioms is often coNP‑complete, though some stronger axioms may be easier to verify.
By Noam Hazon, Leora Schmerler, Nicholas Teh
arXiv:2607. 25484v1 Announce Type: new Abstract: In some real applications a plan may later become unfeasible due to newly imposed budget constraints, yet, at the same time, using only the original actions of the plan and their order is mandatory.
By Martha Del Toro, Raquel Fuentetaja, Angel Garc\'ia-Olaya
arXiv:2608.23247v1 Announce Type: cross
Abstract: We introduce multi-winner voting with argumentative ballots (MVArg) and investigate theoretical properties. As our conceptual contribution, we genera...
By Ryuta Arisaka, Hirotaka Ono
arXiv:2503. 01985v2 Announce Type: replace-cross Abstract: In the classic committee election setting each voter approves a subset of candidates and the goal is to select $k$ winners based on these preferences.
By Sonja Kraiczy, Georgios Papasotiropoulos, Grzegorz Pierczy\'nski, Piotr Skowron
The paper investigates the Reverse Sequential Proportional Approval Voting Rule (RevSeqPAV) used in approval-based committee elections. It examines the rule’s performance in terms of proportional representation—specifically Extended Justified Representation and related metrics—and its ability to approximate the maximum PAV score. The authors first present strong negative results for general election instances, then identify specific settings where RevSeqPAV offers meaningful fairness and optimization guarantees.
arXiv:2606. 11164v1 Announce Type: new Abstract: Long chain-of-thought (CoT) trajectories in large language model (LLM) reasoning cause severe inference bottlenecks due to rapid key-value (KV) cache growth.
By Wenhao Liu, Hao Shi, Yunhe Li, Weizhi Fei, Xiangyuan Wang, Mengzhe Ruan, Hanxu Hou, Peisong Wang, Linqi Song, Shuang Qiu
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
By Abolfazl Asudeh, Zeinab Asoodeh, Bita Asoodeh, Omid Asudeh
Long chain-of-thought (CoT) trajectories in large language model (LLM) reasoning cause severe inference bottlenecks due to rapid key-value (KV) cache growth. Current decoding-time compression methods mitigate this issue via token eviction, but typically assume a uniform budget distribution across all layers and heads.
arXiv:2609.39559v1 Announce Type: new
Abstract: In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produ...
By Oren Salzman
arXiv:2603. 27049v2 Announce Type: replace-cross Abstract: AI-assisted task delegation is increasingly common, yet human effort in such systems is costly and typically unobserved.
By Qichuan Yin, Ziwei Su, Shuangning Li
arXiv:2608. 07532v1 Announce Type: new Abstract: Modern agentic AI systems combine multiple large language model agents with heterogeneous skills, yet most architectures either fix communication in advance or allow full broadcast.
By Mojtaba Eslami
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
By Saar Cohen, Nicholas Teh, Paul W. Goldberg, Michael J. Wooldridge