Advertisement

Multi-agent Travel Planning through Coalition and Negotiation in an Auction

  • Ming-Chih Hsu
  • Paul Hsueh-Min Chang
  • Yi-Ming Wang
  • Von-Won Soo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2891)

Abstract

In a travel scenario the travel agent often faces a situation: the users only provide their preferences on visiting destinations, while the visiting orders and the arrangements of transportations are left to the decision of the travel agent. Therefore the travel agent must find suitable (both efficient and economic) tracks for the users given their visiting destinations, different transportation services, constraints of users such as time, budget, and preferences. Although the service route map of each transportation company can be derived beforehand, the negotiable price information is often private. It is not feasible for a user or a travel planning agent to determine the total expense by simply summing up the list prices of all transportation track segments, and hence the selection of the most efficient track is also not possible. One way to find out the best route is to provide a mechanism for the transportation companies to form coalition and negotiate on the prices based on their own utilities and profit concerns. In this paper we propose a mechanism to solve the best tourist track problem. The mechanism includes a heuristic shortest path finding algorithm for a track graph and a track winner determination auction, called Z-auction, for track competition. We show how the travel planning problem can be solved through the multi-agent coalition and negotiation in the Z-auction under the multi-agent problem solving environment.

Keywords

Directed Acyclic Graph Hamiltonian Path Travel Agent Transportation Company English Auction 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Clemons, E., Hahn, I., Hitt, L.: Price dispersion and differentiation in on-line travel: An empirical investigation (2001)Google Scholar
  3. 3.
    http://www.mapquest.com (Our system uses the maps drawn by this website)
  4. 4.
    Manber, U.: Introduction to Algorithms. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  5. 5.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  6. 6.
    Walsh, W.E., Wellman, M.P., Wurman, P.R., MacKie-Mason, J.K.: Auction protocols for decentralized scheduling. In: Proceedings of the Eighteenth International Conference on Distributed Computing Systems (ICDCS 1998), Amsterdam, the Netherlands (1998)Google Scholar
  7. 7.
    Sandholm, T.W.: An implementation of the Contract Net Protocol based on marginalcost calculations. In: Proc. of 11th National Conference on Artificial Intelligence (AAAI 1993), July 1993, pp. 256–262 (1993)Google Scholar
  8. 8.
    Soo, V.-W., Liang, S.-H.: Recommendation a trip plan by negotiation. In: Klusch, M., Zambonelli, F. (eds.) CIA 2001. LNCS (LNAI), vol. 2182, p. 32. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ming-Chih Hsu
    • 1
  • Paul Hsueh-Min Chang
    • 1
  • Yi-Ming Wang
    • 1
  • Von-Won Soo
    • 1
  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsingChuTaiwan, R.O.C

Personalised recommendations