arXiv (All)
open access
The Complexity of Justified Representation with Additive Utilities
We study the computational complexity of satisfying proportional representation -- in particular proportional, extended, and fully justified representation (PJR, EJR, and FJR) -- in participatory budgeting and committee elections with additive utilities. First, we give a complete picture of the comp
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
- Full Justified Representation under Hare and Droop Quotas in Polynomial Time#1118676
- Towards stratified sampling for redistricting plans#1012908
- The Effects of Pair Budget Goal Difficulty and Pair Identity on Decision-Making and Performance#939146
- Multi-Winner Elections: Justified Representation, Strategyproofness, and Risk-Avoiding Truthfulness#615340
- Multi-Winner Elections: Justified Representation, Strategyproofness, and Risk-Avoiding Truthfulness#614373
Record · ID 822438
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