<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>On the Robustness of Preference Aggregation in Noisy Environments</article-title>
</title-group>

<author><a href="mailto:arielpro@cs.huji.ac.il"><name>Ariel D. Procaccia</name></a></author>
<aff>School of Engineering and Computer Science<br/> The Hebrew University of Jerusalem, Israel</aff>

<author><a href="mailto:jeff@cs.huji.ac.il"><name>Jeffrey S. Rosenschein</name></a></author>
<aff>School of Engineering and Computer Science <br/>The Hebrew University of Jerusalem, Israel</aff>

<author><a href="mailto:galk@cs.biu.ac.il"><name>Gal A. Kaminka</name></a></author>
<aff>Department of Computer Science <br/>Bar Ilan University, Israel</aff>
</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>In an election held in a noisy environment, agents may unintentionally
perturb the outcome by communicating faulty
preferences. We investigate this setting by introducing a
theoretical model of noisy preference aggregation and formally
defining the (worst-case) robustness of a voting rule.
We use our model to analytically bound the robustness of
various prominent rules. The results show that the robustness
of voting rules is diverse, with different rules positioned
at either end of the spectrum. These results allow selection
of voting rules that support preference aggregation in the
face of noise.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0041_81c55f20e12ed482ada39deb82af68be</hpdf>
</fpdf>
</body>
</article>

