A Study of Coordinated Dynamic Market-Based Task Assignment in Massively Multi-Agent Systems

  • MyungJoo Ham
  • Gul Agha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5043)


This paper studies market-based mechanisms for coordinated dynamic task assignment in large-scale agent systems carrying out search and rescue missions. Specifically, the effect of different auction mechanisms and swapping are studied. The paper describes results from a large number of simulations.The information available to agents and their bidding strategies are used as simulation parameters. The simulations provide insight about the interaction between the strategy of individual agents and the market mechanism. Performance is evaluated using several metrics. Some of the results include: limiting information may improve performance, different utility functions may affect the performance in non-uniform ways, and swapping may help improve the efficiency of assignments in dynamic environments.


Utility Function Communication Range Movement Distance Bidding Strategy Auction Mechanism 
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.
    Ham, M., Agha, G.: Market-based coordination strategies for large-scale multi-agent systems. System and Information Sciences Notes 2(1), 126–131 (2007)Google Scholar
  2. 2.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6(1), 80–91 (1959)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Bertsekas, D.P., Castanon, D.A., Tsaknakis, H.: Reverse auction and the solution of inequality constrained assignment problems. SIAM Journal on Optimization (2), 268–297 (1993)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Ahmed, A., Patel, A., Brown, T., Ham, M., Jang, M.W., Agha, G.: Task assignment for a physical agent team via a dynamic forward/reverse auction mechanism. In: Proc. of KIMAS, pp. 311–317 (2005)Google Scholar
  5. 5.
    Brown, T.D.: Decentralized coordination with crash failures. Master’s thesis, Univ. of Illinois at Urbana-Champaign (2005)Google Scholar
  6. 6.
    Palmer, D., Kirschenbaum, M., Murton, J., Zajac, K., Kovacina, M., Vaidyanathan, R.: Decentralized cooperative auction for multiple agent task allocation using synchronized random number generators. In: Proc. of IROS, vol. 2, pp. 1963–1968 (2003)Google Scholar
  7. 7.
    Zlot, R.M., Stentz, A.T., Dias, M.B., Thayer, S.: Multi-robot exploration controlled by a market economy. In: Proc. of ICRA, vol. 3, pp. 3016–3023 (2002)Google Scholar
  8. 8.
    Gerkey, B.P., Matarić, M.J.: Sold!: Auction methods for multirobot coordination. IEEE Trans. on Robotics and Automation 18(5), 758–768 (2002)CrossRefGoogle Scholar
  9. 9.
    Guerrero, J., Oliver, G.: Multi-robot task allocation strategies using auction-like mechanisms. Art. Int. Res. and Dev. 100, 111–122 (2003)Google Scholar
  10. 10.
    Krieger, M.J.B., Billeter, J.B., Keller, L.: Ant-like task allocation and recruitment in cooperative robots. Nature 406, 992–995 (2000)CrossRefGoogle Scholar
  11. 11.
    Bertsekas, D.P., Castanon, D.A.: A forward/reverse auction algorithm for asymmetric assignment problems. Comp. Opt. and App. (3), 277–297 (1992)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • MyungJoo Ham
    • 1
  • Gul Agha
    • 1
  1. 1.Open Systems LaboratoryUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations