4th MARA Get-Together: Workshop on Multiagent Resource Allocation
Paris, 17-18 June 2010
Multiagent Resource Allocation (MARA), the allocation of resources within a system of autonomous
agents that not only have preferences over alternative allocations of resources but also
actively participate in computing an allocation, is an exciting area of research at the
interface of computer science and economics.
On 17-18 June 2010, the
(LAMSADE) Lab. at the
will host the 4th MARA Get-Together, an informal workshop on
Multiagent Resource Allocation.
The meeting is aimed at bringing together researchers working on different aspects of MARA.
Topics of interest include languages for modelling agent preferences in resource allocation applications;
the study of algorithms for resource allocation (including combinatorial auctions and distributed negotiation schemes);
complexity issues; simulation and experiments; and connections to work in social choice theory and fair division.
The workshop is made possible through financial support from the European
COST Action IC0602 on Algorithmic Decision Theory
and continues the tradition of the AgentLink Technical Forum Group on Multiagent Resource Allocation
previous meetings in Ljubljana, Budapest, and the 3rd MARA
Get-Together in Amsterdam. In 2006, the group has published the
(Informatica, 30:3-31, 2006). The workshop will also be the
occasion to present some of the works conducted with support of the
GDR-RO project "Compléxité et Résolution Exacte ou approchée de
Problèmes de Partage Equitable" (CREPES).
List of talks
The programme will consist of tutorials, invited talks, and there will be plenty of room for discussion.
We also plan to have a rump session, giving participants the opportunity to very briefly
introduce some of their ongoing work and latest ideas in an informal manner.
So far the following people have kindly agreed to give a talk at the
workshop (more to come!):
- Stephane Airiau (ILLC, Univ. Amsterdam)
Multiagent Resource Allocation with Sharable Items: Simple Protocols
and Nash Equilibria
- Sylvain Bouveret (ONERA, Toulouse)
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
- Madalina Croitoru (LIRMM, Univ. Montpellier)
Graph based representations for Combinatorial Auctions
- Ulle Endriss (ILLC, Univ. Amsterdam)
- Paul Harrenstein (Univ. Munich)
A Qualitative Vickrey Auction
- Panagiotis Kanellopoulos (Univ. of Patras)
The efficiency of fair division
- Patrice Perny (LIP6, Univ. Paris-6)
LP Solvable Models for Multiagent Fair Allocation Problems
- Jorg Rothe (Univ. Dusseldorf)
Complexity of Social Welfare Optimization in Multiagent Resource Allocation
- Corinne Touati (INRIA, Grenoble)
Distributed Learning of Nash Equilibria in Resource Allocation
Problems: Continuous versus Discrete Algorithms
Download the programme here
- Thursday, 17th (9:30am--5:30pm)
- Friday, 18th (9:30am--3:30pm)
Anyone interested is very welcome to participate in the workshop.
There will be no registration fee, but for planning purposes we will have to know who's coming.
If you wish to attend, please send an email to Nicolas Maudet (email@example.com) no later than 04 June 2010. Please contact the organiser if you are interested.
The workshop will take place at University Paris-Dauphine, in rooms
A405 (Thursday) and A709 (Friday).
Please direct any questions or comments to the organiser,