arXiv (All)
open access
Nearly Group-Separable Elections
We study the problem of computing how close a given election is to being group-separable, measuring proximity by swaps of adjacent candidates in the votes. We also consider several other domains, including caterpillar group-separable, balanced group-separable, single-peaked, and single-crossing ones
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Outer Diversity of Condorcet Domains#1155655
- Recovering Collective Structure in Congressional Voting: A Fused Latent Factor and Network Approach#976918
- Existence of the Core in Approval-Based Committee Elections#999588
- The Complexity of Membership, Uniqueness, and Counting for Optimal Proportional Approval Voting Committees#986509
- Resolvable 3-star designs#955113
Record · ID 1118247
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive