No article text was recorded for this version.
winner determination complexity
Version 2 of 2256 papers363 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives
- Blog: Fine-Grained Complexity and Algorithms for the Schulze Voting Method
- Blog: Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule
- Blog: Fully Proportional Representation as Resource Allocation: Approximability Results
- Blog: Goal-Based Collective Decisions: Axiomatics and Computational Complexity
- Blog: The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality
- Blog: Voting: A View through the Algorithmic Lens
- Blog: Computational Aspects of Multi-Winner Approval Voting
- Blog: The Complexity of Election Problems with Group-Separable Preferences
- Blog: Committee Scoring Rules: A Call to Arms
- Blog: Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
- Blog: Fine-Grained Complexity and Algorithms for the Schulze Voting Method
- Blog: The Complexity of Fully Proportional Representation for Single-Crossing Electorates
- Blog: Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
- Blog: Achieving fully proportional representation: Approximability results
- Blog: DiRe Committee : Diversity and Representation Constraints in Multiwinner Elections
- Blog: Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives
- Blog: Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
- Blog: Vote Elicitation: Complexity and Strategy-Proofness
- Blog: Phragmén's Voting Methods and Justified Representation
- Blog: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type
- Blog: The complexity of fully proportional representation for single-crossing electorates
- Blog: Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
- Blog: Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking
- Blog: The Complexity of Fully Proportional Representation for Single-Crossing Electorates
- Blog: SVVAMP: Simulator of Various Voting Algorithms in Manipulating Populations
- Blog: Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
- Blog: The Degree of (Extended) Justified Representation and Its Optimization
- Blog: Multistage Committee Election
- Blog: Axiomatic Characterization of Committee Scoring Rules
- Blog: Collective Decision Making under Incomplete Knowledge: Possible and Necessary Solutions
- Blog: Policy Aggregation
- Blog: Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space
- Blog: Computing the Schulze Method for Large-Scale Preference Data Sets
- Blog: ReplayCAD: Generative Diffusion Replay for Continual Anomaly Detection
- Blog: Policy Aggregation
- Blog: Ties in Multiwinner Approval Voting
- Blog: Policy Aggregation
- Blog: Participatory Budgeting Project Strength via Candidate Control
- Blog: What Do We Elect Committees For? A Voting Committee Model for Multi-Winner Rules
- Blog: Structure in Dichotomous Preferences
- Blog: On the Complexity of mCP-nets
- Blog: Multiwinner Approval Rules as Apportionment Methods
- Blog: Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking
- Blog: 10101 Executive Summary - Computational Foundations of Social Choice
- Blog: Committees providing EJR can be computed efficiently
- Blog: Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences
- Blog: Querying Partially Labelled Data to Improve a K-nn Classifier
- Blog: The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality
- Blog: Proportional Representation as Resource Allocation: Approximability Results
- Blog: Proportionality in Practice: Quantifying Proportionality in Ordinal Elections
- Blog: Achieving fully proportional representation: Approximability results
- Blog: Proportional Representation as Resource Allocation: Approximability Results
- Blog: Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
- Blog: On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
- Blog: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type
- Blog: Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)
- Blog: Flexible Representative Democracy: An Introduction with Binary Issues
- Blog: More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
- Blog: Six Candidates Suffice to Win a Voter Majority
Showing 60 of 256 papers.
History & citation
Current · Permanent link
- Recognition of Structured Preference Domains merged into this direction (71% overlap)
- greedy representation approximation split from this direction (50% overlap)
- excellence-diversity trade-off split from this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_winner_determination_complexity_7ff80d4b,
title = {winner determination complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/winner-determination-complexity/rdr_7ff80d4b08e64e67b2cd6d5088c63bd4},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_winner_determination_complexity_7ff80d4b_v2,
title = {winner determination complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/winner-determination-complexity/rdr_7ff80d4b08e64e67b2cd6d5088c63bd4/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}