<?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>Infinitesimal Nash Transfers for Resource Allocation in Strong Social Alliances</article-title>
</title-group>

<author><a href="mailto:pmatt@imperial.ac.uk"><name>PaulAmaury Matt</name></a></author>
<aff>Department of Computing, Imperial College London, South Kensington Campus, London, SW7 2AZ, UK</aff>

<author><a href="mailto:ft@imperial.ac.uk"><name>Francesca Toni</name></a></author>
<aff>Department of Computing, Imperial College London, South Kensington Campus, London, SW7 2AZ, UK</aff>

</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>We introduce a distributed and tractable mechanism for the allocation of continuously divisible resources to agents, that locally maximises the (Nash) product of their individual welfare. The mechanism involves specific m-resources-at-a-time multilateral deals over bits of resources, termed <italic>infinitesimal Nash transfers</italic>. It provides an effective way of building "strong social alliances", where in a <italic>social alliance</italic> agents fully cooperate for the global interest of society, and a <italic>strong</italic> social alliance has near-optimal utilitarian and egalitarian social welfare, as understood in social choice and welfare economics. The mechanism is scalable, can be distributed amongst agents and can be used to support, e.g., fair trade.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0128_971d89290d3a9f7adf6bf39b0f2726c1</hpdf>
</fpdf>
</body>
</article>

