The University of Southampton
University of Southampton Institutional Repository

On the convergence of iterative voting: how restrictive should restricted dynamics be?

On the convergence of iterative voting: how restrictive should restricted dynamics be?
On the convergence of iterative voting: how restrictive should restricted dynamics be?
We study convergence properties of iterative voting procedures. Such procedures are defined by a voting rule and a (restricted) iterative process, where at each step one agent can modify his vote towards a better outcome for himself. It is already known that if the iteration dynamics (the manner in which voters are allowed to modify their votes) are unrestricted, then the voting process may not converge. For most common voting rules this may be observed even under the best response dynamics limitation. It is therefore important to investigate whether and which natural restrictions on the dynamics of iterative voting procedures can guarantee convergence. To this end, we provide two general conditions on the dynamics based on iterative myopic improvements, each of which is sufficient for convergence. We then identify several classes of voting rules (including Positional Scoring Rules, Maximin, Copeland and Bucklin), along with their corresponding iterative processes, for which at least one of these conditions hold.
993-999
Obraztsova, Svetlana
5a201770-908c-44a8-8e22-62cb16d92bf6
Markakis, Evangelos
038fe0e3-230b-45a7-a214-bf3f99f637a0
Polukarov, Maria
bd2f0623-9e8a-465f-8b29-851387a64740
Rabinovich, Zinovi
573422bf-523d-466b-a047-7a92917102e7
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Obraztsova, Svetlana
5a201770-908c-44a8-8e22-62cb16d92bf6
Markakis, Evangelos
038fe0e3-230b-45a7-a214-bf3f99f637a0
Polukarov, Maria
bd2f0623-9e8a-465f-8b29-851387a64740
Rabinovich, Zinovi
573422bf-523d-466b-a047-7a92917102e7
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Obraztsova, Svetlana, Markakis, Evangelos, Polukarov, Maria, Rabinovich, Zinovi and Jennings, Nicholas R. (2015) On the convergence of iterative voting: how restrictive should restricted dynamics be? AAAI 2015: Twenty-Ninth AAAI Conference on Artificial Intelligence, United States. 25 - 30 Jan 2015. pp. 993-999 .

Record type: Conference or Workshop Item (Paper)

Abstract

We study convergence properties of iterative voting procedures. Such procedures are defined by a voting rule and a (restricted) iterative process, where at each step one agent can modify his vote towards a better outcome for himself. It is already known that if the iteration dynamics (the manner in which voters are allowed to modify their votes) are unrestricted, then the voting process may not converge. For most common voting rules this may be observed even under the best response dynamics limitation. It is therefore important to investigate whether and which natural restrictions on the dynamics of iterative voting procedures can guarantee convergence. To this end, we provide two general conditions on the dynamics based on iterative myopic improvements, each of which is sufficient for convergence. We then identify several classes of voting rules (including Positional Scoring Rules, Maximin, Copeland and Bucklin), along with their corresponding iterative processes, for which at least one of these conditions hold.

Text
aaai15-restricted-dynamics.pdf - Accepted Manuscript
Download (243kB)

More information

e-pub ahead of print date: January 2015
Published date: 2015
Venue - Dates: AAAI 2015: Twenty-Ninth AAAI Conference on Artificial Intelligence, United States, 2015-01-25 - 2015-01-30
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 372156
URI: http://eprints.soton.ac.uk/id/eprint/372156
PURE UUID: 5343d87f-cad4-4bc6-90d2-1a7ee9473ef5

Catalogue record

Date deposited: 03 Dec 2014 12:12
Last modified: 16 Dec 2019 20:22

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×