atlas

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

Effective Heuristics for Committee Scoring Rules

AAAI 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 14 citations (OpenAlex)

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 changedWhereMeasuredEffect
use proposed OWA schedule instead of 0-appending schedule in removal algorithm (ablation)Removal heuristic · CC, 2D uniform square, k=10average error vs optimal: 10% -> 3%Helped
use Banzhaf or removal heuristic instead of greedycommittee scoring rule heuristics · t-Borda, IC and 2D, k=10approximation ratio: error never exceeds 10%Helped
use Banzhaf instead of removal heuristict-Borda heuristics · IC modelapproximation ratioHelped
use Banzhaf instead of removal heuristict-Borda heuristics · 2D uniform squareapproximation ratioHurt
use removal or Banzhaf instead of simulated annealingCC rule heuristics · CC, varying committee sizeapproximation ratioMixed
use removal/Banzhaf instead of simulated annealingheuristics · t-Borda k=10running time: 1s -> 10s (removal), 24s (Banzhaf)Hurt

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