AI Paper Atlas

Research map / Graph learning / Knowledge and temporal graphs

Poll-Confident Voters in Iterative Voting

Anaëlle Wilczynski

AAAI 2019 · Graph learning › Knowledge and temporal graphs · approach: Social and behavior graphs

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 global dynamics (polls repeated after each local convergence) instead of local dynamics with one pollpoll-confident dynamics · Random Erdos-Renyi graphs, 100 voters, 10 candidates, impartial cultureCondorcet efficiencyImproved
increase graph densitypoll-confident dynamics · Random Erdos-Renyi graphs, 100 voters, 10 candidatesCondorcet efficiencyImproved
set unanimous pivotal threshold p to 1 or 10 instead of 5 or heterogeneous thresholdspoll-confident dynamics · Random graphs, 10,000 instancesfrequency of convergenceImproved
use mid-range graph density around 0.25 rather than sparse or dense graphspoll-confident dynamics · Random graphs, 10,000 instancesfrequency of convergenceHurt
use scale-free or homophily networks instead of random graphspoll-confident dynamics · Convergence and quality experimentsconvergence and Condorcet efficiencyNo clear effect
add poll manipulation by Algorithm 2 (specter candidate heuristic)local dynamics · Sparsest graphs, targets Condorcet/Borda/truthful/top tie-break, p=1 or 5election frequency of target candidateImproved
add poll manipulation at every global step (Algorithm 2)global dynamics · Target election frequency, p=1 or 5election frequency of target candidateImproved
add poll manipulation by Algorithm 3 on empty, acyclic or transitive spanning subgraphslocal and global dynamics · Random graphs, p=1 or 5average rank of final winner in polling institute preferences (lower better)Improved
increase graph density under poll manipulationAlgorithms 2 and 3 · Random graphsbenefit of manipulationHurt
compute manipulation with thresholds that differ from the real onespolling institute heuristics · Unreported experimentsmanipulation outcomeNo clear effect

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