Research map / Graph learning / Knowledge and temporal graphs
Poll-Confident Voters in Iterative Voting
Anaëlle Wilczynski
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use global dynamics (polls repeated after each local convergence) instead of local dynamics with one poll | poll-confident dynamics · Random Erdos-Renyi graphs, 100 voters, 10 candidates, impartial culture | Condorcet efficiency | Improved |
| increase graph density | poll-confident dynamics · Random Erdos-Renyi graphs, 100 voters, 10 candidates | Condorcet efficiency | Improved |
| set unanimous pivotal threshold p to 1 or 10 instead of 5 or heterogeneous thresholds | poll-confident dynamics · Random graphs, 10,000 instances | frequency of convergence | Improved |
| use mid-range graph density around 0.25 rather than sparse or dense graphs | poll-confident dynamics · Random graphs, 10,000 instances | frequency of convergence | Hurt |
| use scale-free or homophily networks instead of random graphs | poll-confident dynamics · Convergence and quality experiments | convergence and Condorcet efficiency | No 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 5 | election frequency of target candidate | Improved |
| add poll manipulation at every global step (Algorithm 2) | global dynamics · Target election frequency, p=1 or 5 | election frequency of target candidate | Improved |
| add poll manipulation by Algorithm 3 on empty, acyclic or transitive spanning subgraphs | local and global dynamics · Random graphs, p=1 or 5 | average rank of final winner in polling institute preferences (lower better) | Improved |
| increase graph density under poll manipulation | Algorithms 2 and 3 · Random graphs | benefit of manipulation | Hurt |
| compute manipulation with thresholds that differ from the real ones | polling institute heuristics · Unreported experiments | manipulation outcome | No clear effect |
Closest papers by meaning
- Iterative Calculus of Voting under Plurality (AAAI 2022 · similarity 0.87)
- Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences (NeurIPS 2021 · similarity 0.86)
- Efficient and Thrifty Voting by Any Means Necessary (NeurIPS 2019 · similarity 0.86)
- Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract) (AAAI 2025 · similarity 0.85)
- Weak Strategyproofness in Randomized Social Choice (AAAI 2025 · similarity 0.84)
- Replicating Electoral Success (AAAI 2025 · similarity 0.84)
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.
