arXiv Artificial Intelligence

Strengthening Full Justified Representation: Efficient Verification and Computation

1 hour ago 13.08.2026 07:00 👁 2 views
Strengthening Full Justified Representation: Efficient Verification and Computation

Quick summary

arXiv:2608.11500v1 Announce Type: cross Abstract: Full justified representation (FJR) is among the strongest known satisfiable proportionality axioms for approval-based committee elections. Recent work has shown that an FJR committee can be found in polynomial time, but verifying whether a given committee satisfies FJR remains coNP-complete. We introduce FJR+, a strict strengthening of FJR and EJR+ that can be verified and satisfied in polynomial time. We then analyze the Residual-Budget Greedy (RBG) algorithm and prove that it selects a partial committee such that every size-$k$ completion sa

Key takeaways

  • arXiv:2608.11500v1 Announce Type: cross Abstract: Full justified representation (FJR) is among the strongest known satisfiable proportionality axioms for approval-based committee elections.
  • Recent work has shown that an FJR committee can be found in polynomial time, but verifying whether a given committee satisfies FJR remains coNP-complete.
  • We introduce FJR+, a strict strengthening of FJR and EJR+ that can be verified and satisfied in polynomial time.

Why it matters

The importance of “Strengthening Full Justified Representation: Efficient Verification and Computation” will be measured by what changes in practice. User behavior, access conditions, verifiable performance and responsible-use outcomes are the signals worth following.

Kaynak sitede devamını oku: arXiv Artificial Intelligence ↗