Metraipolis › archive › dc_1d3c06bd44ca
Reverse Sequential Proportional Approval Voting Rule: Proportionality and Approximation Guarantees — arXiv:2609.35331
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35331
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T21:03:25.845Z
- SHA-256 of the archived text
2ab5155adb9186f5c76e1c0238451efb52cbb8f0c75528fe39297db61b267410- Stable URL of this page
https://metraipolis.com/documento/dc_1d3c06bd44ca
How to cite
Reverse Sequential Proportional Approval Voting Rule: Proportionality and Approximation Guarantees — arXiv:2609.35331 — arXiv (en), https://arxiv.org/abs/2609.35331 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1d3c06bd44ca (Metraipolis archive dc_1d3c06bd44ca, sha256 2ab5155adb9186f5c76e1c0238451efb52cbb8f0c75528fe39297db61b267410)
BibTeX
@misc{dc1d3c06bd44ca,
title = {Reverse Sequential Proportional Approval Voting Rule: Proportionality and Approximation Guarantees — arXiv:2609.35331},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35331},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1d3c06bd44ca; sha256 2ab5155adb9186f5c76e1c0238451efb52cbb8f0c75528fe39297db61b267410},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35331. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the Reverse Sequential Proportional Approval Voting Rule (RevSeqPAV) in approval-based committee elections. Despite its historical prominence and practical use, its properties and guarantees are much less understood than those of Sequential PAV. We analyze it along two dimensions: proportional representation (measured by Extended Justified Representation, its approximations, and proportionality degree) and approximation of the maximum PAV score of instances. We first establish strong negative results for general, unrestricted election instances and then identify settings in which the rule provides meaningful fairness and optimization guarantees. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.AI). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2609.35331 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T20:29:03.316Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).