atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Refined Characterizations of Approval-Based Committee Scoring Rules

AAAI 2024 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Gives full axiomatic characterizations of Thiele rules and ballot size weighted approval voting (BSWAV) rules for standard approval-based committee choice, using consistency plus other axioms, and derives characterizations of AV, PAV, and SAV.

Problem

Prior characterizations of approval-based committee (ABC) scoring rules hold only for committee ranking rules, and the choice-setting result has an incomplete proof and requires an extra technical axiom excluding AV and SAV. The paper addresses full characterization of ABC scoring rules in the stand

Approach

Characterize two subclasses of ABC scoring rules (Thiele rules and BSWAV rules) in the standard choice model using consistency for variable electorates, adding independence of losers (Thiele) or choice set convexity (BSWAV); then obtain AV, PAV, and SAV characterizations via party-list profile axioms.

Key results

Surprising findings

Limitations

Experimental setup

Baselines: AV PAV SAV CCAV Phragmén's rule

Builds on: Thiele rules ABC scoring rules characterization (ranking setting) consistency axiom from single-winner scoring rule characterization

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy