<?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>Some Results on Approximating the Minimax Solution in Approval Voting</article-title>
</title-group>

<author><a href="mailto:legrand@cse.wustl.edu"><name>Rob LeGrand</name></a></author>
<aff>Washington University, St. Louis, Missouri, U.S.A.</aff>

<author><a href="mailto:vangelis@cwi.nl"><name>Evangelos Markakis</name></a></author>
<aff>Center for Mathematics and Computer Science (CWI), Amsterdam, Netherlands</aff>

<author><a href="mailto:mehtaa@us.ibm.com"><name>Aranyak Mehta</name></a></author>
<aff>IBM Almaden Research Center, San Jose, California, U.S.A.</aff>

</article-meta></front>
<body>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0283_cab550d44024d436219a93f97bb7f519</hpdf>
</fpdf>
</body>
</article>
