Average-Case Analysis of Iterative Voting

Joshua Kavner, Lirong Xia
2/13/2024
cs.GTcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Iterative voting is a natural model of repeated strategic decision-making in social choice theory when agents have the opportunity to update their votes prior to finalizing the group decision. Prior work has analyzed the efficacy of iterative plurality on the welfare of the chosen outcome at equilibrium, relative to the truthful vote profile, via an adaptation of the price of anarchy. However, prior analyses have only studied the worst- and average-case performances when agents' preferences are distributed by the impartial culture. This work extends average-case analysis comprehensively across three alternatives and distinguishes under which of agents' preference distributions iterative plurality improves or degrades asymptotic welfare.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kavner2024averagecase,
  title  = {Average-Case Analysis of Iterative Voting},
  author = {Joshua Kavner and Lirong Xia},
  year   = {2024},
  eprint = {2402.08144},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.08144v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.08144.svg)](https://codeofpaper.com/paper/2402.08144)

Discussion