Research map / Learning theory and algorithms / Submodular and game algorithms
Proportional Decisions in Perpetual Voting
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Perpetual Consensus, which distributes a decision's cost equally among approving voters | Perpetual voting · Perpetual voting | upper quota for closed groups (UQC) | Helped |
| Use Perpetual Consensus instead of a rule required to satisfy lower quota | Perpetual voting · Perpetual voting | lower quota for closed groups (LQC) | Hurt |
| Use Perpetual Phragmén's load-balancing procedure | Perpetual voting · Perpetual voting | lower quota for closed groups (LQC) | Helped |
| Use Perpetual Phragmén's load-balancing procedure | Perpetual voting · Perpetual voting | upper quota for closed groups (UQC) | Hurt |
| Use Perpetual Phragmén's load-balancing procedure | Perpetual voting · Perpetual voting | perpetual priceability | Helped |
| Use a win-based WAM rather than a rule that satisfies lower quota | Perpetual voting · Perpetual voting | lower quota for closed groups (LQC) | Hurt |
| Use a win-based WAM rather than a rule that satisfies upper quota | Perpetual voting · Perpetual voting | upper quota for closed groups (UQC) | Hurt |
| Use a loss-based WAM | Perpetual voting · Simple decision sequences | simple proportionality | Hurt |
| Use a win-based or loss-based WAM | Perpetual voting · Perpetual voting | bounded dry spells | Hurt |
| Use a win-based WAM with a sequence satisfying the stated characterization | Win-based WAMs · Simple decision sequences | simple proportionality | Helped |
| Require both perpetual priceability and UQC | Perpetual voting rules · Perpetual voting | simultaneous satisfaction of priceability and UQC | Hurt |
| Use Perpetual Phragmén's load-balancing procedure | Perpetual voting · Perpetual voting | dry spell guarantee: 2n − 1 | Helped |
Closest papers by meaning
- Proportional Aggregation of Preferences for Sequential Decision Making (AAAI 2024 · similarity 0.91)
- Verifying Proportionality in Temporal Voting (AAAI 2025 · similarity 0.89)
- Welfare Maximization in Perpetual Voting (Student Abstract) (AAAI 2024 · similarity 0.89)
- Optimal Bounds for Dissatisfaction in Perpetual Voting (AAAI 2025 · similarity 0.88)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.87)
- Participation Incentives in Approval-Based Committee Elections (AAAI 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.