Mechanism Design for Task Procurement with Flexible Quality of Service

  • Enrico H. Gerding
  • Kate Larson
  • Alex Rogers
  • Nicholas R. Jennings
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5907)


In this paper, we consider the problem where an agent wishes to complete a single computational task, but lacks the required resources. Instead, it must contract self-interested service providers, who are able to flexibly manipulate the quality of service they deliver, in order to maximise their own utility. We extend an existing model to allow for multiple such service providers to be contracted for the same task, and derive optimal task procurement mechanisms in the setting where the agent has full knowledge of the cost functions of these service providers (considering both simultaneous and sequential procurement). We then extend these results to the incomplete information setting where the agent must elicit cost information from the service providers, and we characterise a family of incentive-compatible and individually-rational mechanisms. We show empirically that sequential procurement always generates greater utility for the agent compared to simultaneous procurement, and that over a range of settings, contracting multiple providers is preferable to contracting just one.


Cost Function Service Provider Multiagent System Sequential Procurement Uniform Price 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Foster, I., Jennings, N.R., Kesselman, C.: Brain Meets Brawn: Why Grid and Agents Need Each Other. In: Proc. of the 3rd Int. Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 8–15 (2004)Google Scholar
  2. 2.
    Dash, R.K., Ramchurn, S.D., Jennings, N.R.: Trust-based mechanism design. In: Proc. of the 3rd Int. Conference on Autonomous Agents and Multi-Agent Systems, pp. 748–755 (2004)Google Scholar
  3. 3.
    Porter, R., Ronen, A., Shoham, Y., Tennenholtz, M.: Fault tolerant mechanism design. Artificial Intelligence 172(15), 1783–1799 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Matsubara, S.: Trade of a problem-solving task. In: AAMAS 2003: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 257–264. ACM, New York (2003)CrossRefGoogle Scholar
  5. 5.
    Miller, N., Resnick, P., Zeckhauser, R.: Eliciting informative feedback: The peer-prediction method. Management Science 51(9), 1359 (2005)CrossRefGoogle Scholar
  6. 6.
    Papakonstantinou, A., Rogers, A., Gerding, E.H., Jennings, N.R.: A truthful two-stage mechanism for eliciting probabilistic estimates with unknown costs. In: Proc. of the 18th European Conference on Artificial Intelligence, Patras, Greece, pp. 448–452 (2008)Google Scholar
  7. 7.
    Stein, S., Jennings, N.R., Payne, T.: Flexible service provisioning with advance agreements. In: Proc. of the 7th Int. Conference on Autonomous Agents and Multi-Agent Systems, pp. 249–256 (2008)Google Scholar
  8. 8.
    Jehiel, P., Moldovanu, B.: Efficient Design with Interdependent Valuations. Econometrica 69(5), 1237–1259 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641–654 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Press, W.H., Flannery, B., Teukolsky, S.A., Vetterling, W.T., et al.: Numerical recipes. Cambridge University Press, New York (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Enrico H. Gerding
    • 1
  • Kate Larson
    • 2
  • Alex Rogers
    • 1
  • Nicholas R. Jennings
    • 1
  1. 1.University of SouthamptonSouthamptonUK
  2. 2.University of WaterlooWaterlooCanada

Personalised recommendations