This paper studies strict majority reasoning in finite electorates using so-called $\textit{social decision frames}$: finite sets of voters equipped with distinguished families of coalitions interpreted as those voting blocs evaluated to form a strict majority. A coherence criterion for qualitative majority judgments is identified and shown to give an exact characterization for representability of strict majorities by finitely additive measures.
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
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
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
The paper proposes a transparent, user‑configurable rule for selecting arguments in deliberative polls, replacing opaque learned rankers. It formalises argument selection over bipolar justification sets, introduces seven civic recommender criteria, and presents a one‑hop reversed endorsement flow rule that meets them. Experiments on 17,000 simulated runs show the rule performs comparably to random on coverage but outperforms other methods on endorsement mass and robustness under adversarial pressure.
By Muntaser Syed, Markus Zanker, Marius Silaghi
arXiv:2610.00577v1 Announce Type: cross
Abstract: In a district-based election, N voters are partitioned into k districts, and each voter votes for one of m candidates. Each district elects a winner...
By Koustav De, Debajyoti Kar, Swagato Sanyal
arXiv:2606. 08098v1 Announce Type: new Abstract: Majority voting over sampled answers is the dominant unsupervised aggregator for multi-sample LLM inference.
By Yasushi Sakai, Allen Song, Kent Larson
The paper titled "Preference Reasoning under Indeterminacy in Large Language Models" discusses how large language models (LLMs) are becoming decision‑making agents and the importance of reasoning over preferences for alignment, coordination, and collective intelligence. It highlights that real‑world preference reasoning is inherently indeterminate, with incomplete information and potentially no valid solutions. The authors formalize this challenge into epistemic indeterminacy (incomplete or expressive preferences) and structural indeterminacy (non‑existence of solutions under standard social choice concepts), and demonstrate that current LLMs fail to differentiate between determined and undetermined cases, showing miscalibrated reasoning even in verification tasks.
By Hadi Hosseini, Samarth Khanna, Xiyuan Wang
The paper introduces the Evidential-Based Higher-Order Set Argumentation Framework (EHSAF), a unified formalism that extends Dung’s abstract argumentation by incorporating evidential support, higher-order relations, and collective interactions. Two complete semantics are defined: an adjacent complete labelling semantics allowing multiple truth values for arguments in support cycles, and an extension-based complete semantics that accepts only well‑founded support chains. The authors provide a propositional encoding in three‑valued Łukasiewicz logic and extend it to continuous fuzzy logics, proving key properties and showing equivalence under support‑acyclicity.
By Shuai Tang
arXiv:2606. 30116v1 Announce Type: new Abstract: Pairwise preference data is widely used for training and evaluating language models (e.
By Eleanor Clifford, Michael Amir, Arduin Findeis, Aaron Zhao, Robert Mullins
arXiv:2608. 05015v1 Announce Type: cross Abstract: Representation theorems in decision theory establish that behavior satisfies certain axioms if and only if it can be rationalized by a well-defined objective.
By Isaiah Andrews
arXiv:2608.23446v2 Announce Type: replace
Abstract: We study the problem of formally explaining why a candidate was not selected by a given tournament rule, by identifying sub-tournaments in which th...
By Contet Cl\'ement, Umberto Grandi, J\'er\^ome Mengin