dc.contributor.author |
Hadjibeyli, B |
en |
dc.contributor.author |
Wilson, MC |
en |
dc.coverage.spatial |
Paris, France |
en |
dc.date.accessioned |
2014-01-03T04:05:21Z |
en |
dc.date.issued |
2014 |
en |
dc.identifier.citation |
AAMAS 2014, Paris, France, 05 May 2014 - 09 May 2014. AAMAS 2014 Proceedings. 8 pages. 2014 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/21330 |
en |
dc.description.abstract |
The concept of distance rationalizability of voting rules has been explored in recent years by several authors, particularly Elkind, Faliszewski and Slinko. We study in detail the commonly occurring case of anonymous and homogeneous rules, which allows for a more succinct representation. We first translate the theory to this compressed representation and unify and extend previous work. The new framework allows a geometric interpretation in terms of finite-dimensional Banach spaces that is new to the distance rationalizability framework and that suggests several conjectures about Voronoi theory in these spaces. We present both positive and negative results, focusing on the case of l¹. |
en |
dc.description.uri |
http://aamas2014.lip6.fr/ |
en |
dc.relation.ispartof |
AAMAS 2014 |
en |
dc.relation.ispartofseries |
AAMAS 2014 Proceedings |
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://www.aamas-conference.org/Proceedings/aamas2013/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Distance rationalization of anonymous and homogeneous voting rules |
en |
dc.type |
Conference Item |
en |
pubs.declined |
2016-08-17T16:37:18.188+1200 |
en |
pubs.declined |
2016-08-18T19:46:52.39+1200 |
en |
pubs.declined |
2016-08-19T16:28:54.400+1200 |
en |
pubs.declined |
2016-08-21T21:07:18.42+1200 |
en |
pubs.declined |
2016-08-22T16:35:37.468+1200 |
en |
pubs.declined |
2016-08-23T16:29:31.678+1200 |
en |
pubs.declined |
2016-08-24T18:10:24.862+1200 |
en |
pubs.declined |
2016-08-25T16:40:13.91+1200 |
en |
pubs.declined |
2016-08-26T17:08:16.153+1200 |
en |
pubs.declined |
2016-08-27T17:01:21.193+1200 |
en |
pubs.declined |
2016-08-28T17:05:52.187+1200 |
en |
pubs.declined |
2016-08-29T16:31:00.953+1200 |
en |
pubs.declined |
2016-08-30T16:24:49.33+1200 |
en |
pubs.declined |
2016-08-31T16:27:02.731+1200 |
en |
pubs.declined |
2016-09-01T16:38:06.281+1200 |
en |
pubs.declined |
2016-09-02T16:40:53.58+1200 |
en |
pubs.declined |
2016-09-03T18:24:48.283+1200 |
en |
pubs.declined |
2016-09-04T19:03:12.603+1200 |
en |
pubs.declined |
2016-09-05T19:34:46.422+1200 |
en |
pubs.declined |
2016-09-06T22:25:14.634+1200 |
en |
pubs.declined |
2016-12-05T18:49:43.339+1300 |
en |
pubs.declined |
2016-12-17T18:56:32.568+1300 |
en |
pubs.declined |
2017-02-05T17:07:49.957+1300 |
en |
pubs.declined |
2017-06-25T18:58:43.321+1200 |
en |
pubs.declined |
2017-09-03T20:45:17.810+1200 |
en |
pubs.declined |
2017-09-24T17:23:50.429+1300 |
en |
pubs.declined |
2017-11-26T19:34:48.576+1300 |
en |
pubs.declined |
2018-02-11T19:25:04.289+1300 |
en |
pubs.declined |
2018-04-01T17:24:15.308+1200 |
en |
pubs.declined |
2018-06-24T17:03:59.136+1200 |
en |
pubs.declined |
2018-10-07T17:03:09.289+1300 |
en |
pubs.declined |
2018-10-28T17:10:29.788+1300 |
en |
pubs.declined |
2019-04-14T18:25:49.587+1200 |
en |
pubs.finish-date |
2014-05-09 |
en |
pubs.publication-status |
Submitted |
en |
pubs.start-date |
2014-05-05 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Proceedings |
en |
pubs.elements-id |
408673 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.arxiv-id |
1610.01900 |
en |
pubs.record-created-at-source-date |
2013-11-12 |
en |