Best-reply dynamics for scoring rules

ResearchSpace Repository

Show simple item record

dc.contributor.author Reyhani, R en
dc.contributor.author Wilson, Mark en
dc.contributor.editor De Raedt, L en
dc.coverage.spatial Montpellier en
dc.date.accessioned 2013-12-04T21:51:17Z en
dc.date.issued 2012 en
dc.identifier.citation 20th European Conference on Artificial Intelligence, Montpellier, 27 Aug 2012 - 31 Aug 2012. Editors: De Raedt L. Frontiers in Artificial Intelligence and Applications. IOS Press. 242: 672-677. 2012 en
dc.identifier.isbn 978-1-61499-098-7 en
dc.identifier.issn 0922-6389 en
dc.identifier.uri http://hdl.handle.net/2292/21201 en
dc.description.abstract We consider best-reply dynamics for voting games in which all players are strategic and no coalitions are formed. We study the class of scoring rules, show convergence of a suitably restricted version for the plurality and veto rules, and failure of convergence for other rules including k-approval and Borda. In particular, for 3 candidates convergence fails for all rules other than plurality and veto. We give a unified proof for the convergence of these two rules. Our proofs in the case of plurality improve the known bound on convergence, and the other convergence results are new. en
dc.description.uri http://www.lirmm.fr/ecai2012/ en
dc.publisher IOS Press en
dc.relation.ispartof 20th European Conference on Artificial Intelligence en
dc.relation.ispartofseries Frontiers in Artificial Intelligence and Applications en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://ebooks.iospress.nl/Publication/OpenAccess en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc/3.0/deed.en_US en
dc.title Best-reply dynamics for scoring rules en
dc.type Conference Item en
dc.identifier.doi 10.3233/978-1-61499-098-7-672 en
pubs.begin-page 672 en
pubs.volume 242 en
pubs.author-url http://ebooks.iospress.nl/volume/ecai-2012 en
pubs.end-page 677 en
pubs.finish-date 2012-08-31 en
pubs.publication-status Published en
pubs.start-date 2012-08-27 en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.subtype Proceedings en
pubs.elements-id 365699 en
pubs.org-id Science en
pubs.org-id School of Computer Science en
dc.identifier.eissn 1879-8314 en
pubs.record-created-at-source-date 2012-11-29 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc/3.0/deed.en_US Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc/3.0/deed.en_US

Share

Search ResearchSpace


Advanced Search

Browse

Statistics