Intranet Tools

nb. next round of REF2013 will NOT be using data from eprints.ecs, but the central university REF interface.

RSS 1.0 Feed
RSS 2.0 Feed
Atom Feed
 

Scalable Mechanism Design for the Procurement of Services with Uncertain Durations

Gerding, E., Stein, S., Larson, K., Rogers, A. and Jennings, N. R. (2010) Scalable Mechanism Design for the Procurement of Services with Uncertain Durations. In: The Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), May 10-14, 2010, Toronto, Canada. pp. 649-656.

Download

[img]
Preview
Accepted Version
PDF

172Kb

Abstract

In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This type of setting is often encountered in large and dynamic multi-agent systems, such as computational Grids or clouds. To effectively deal with this uncertainty, the consumer may dynamically and redundantly procure multiple services over time, in order to increase the probability of success, while at the same time balancing this with the additional procurement costs. However, in order to do this optimally, the consumer requires information about the providers' costs and their success probabilities over time. This information is typically held privately by the providers and they may have incentives to misreport this, so as to increase their own profits. To address this problem, we introduce a novel mechanism that incentivises self-interested providers to reveal their true costs and capabilities, and we show that this mechanism is ex-post incentive compatible, efficient and individually rational. However, for these properties to hold, it generally needs to compute the optimal solution, which can be intractable in large settings. Therefore, we show how we can generate approximate solutions while maintaining the economic properties of the mechanism. This approximation admits a polynomial-time solution that can be computed in seconds even for hundreds of providers, and we demonstrate empirically that it performs as well as the optimal in typical scenarios. In particularly challenging settings, we show that it still achieves 97% or more of the optimal.

Item Type:Conference or Workshop Item
Creator/Authors:
Enrico Gerding
Sebastian Stein
Kate Larson
Alex Rogers
Nicholas R. Jennings
Research Group:Old ECS Groups > Intelligence, Agents, Multimedia
Current ECS Groups > Agents, Interaction and Complexity
Date:May 2010
Information about this record:
Performance Indicator:EZ~04~05~04
Citations:Google Scholar: 2
Downloads (2010):131
ID Code:18463
Last Modified:23 Sep 2011 10:38
Deposited On:03 Feb 2010 15:46 by Stein, Sebastian

Tools & Metadata

Download Statistics

Last month

Last year

Members of ECS may view the download statistics dashboard for this record.

Corrections

ECS staff and postgraduates may modify this record

  Welcome from Deputy Head of School (Research) Research Prospectus Industrial Partnerships New Research Students Notes for Guidance New Research Students Notes for Guidance
The ECS EPrints Repository supports OAI 2.0 with a base URL of http://eprints.ecs.soton.ac.uk/cgi/oai2

EPrints is free software developed by the University of Southampton to facilitate Open Access to research.
EPrints