Abstract
In this paper we analyse the domain of transportation scheduling in shipping companies from the perspective of decision theory. After giving a brief description of the application and the simulation system Mars based on the multiagent paradigm, the transportation domain is characterised according to [11]. The paper comes up with the result that it is useful to split up the class of task-oriented domains into two subclasses: cooperative and competitive task-oriented domains. The paper shows that properties like subadditivity only hold only for very specific subproblems in the transportation domain. We prove that lying may be beneficial in the transportation domain. We argue that, based on this result, it is highly desirable to have negotiation strategies for agents in the transportation domain which are robust against lying. The last section describes such a negotiation strategy.
The work presented in this paper has been supported by the German Ministry of Research and Technology under grant ITW9104
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Bachem, W. Hochstättler, and M. Malich. Simulated Trading: A New Approach For Solving Vehicle Routing Problems. Technical Report 92.125, Mathematisches Institut der Universität zu Köln, Dezember 1992.
M. Boddy and T. L. Dean. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67:245–285, 1994.
K. Fischer, N. Kuhn, H. J. Müller, J. P. Müller, and M. Pischel. Sophisticated and distributed: The transportation domain. In Proceedings of MAAMAW-93, Neuchatel, CH, August 1993. Fifth European Workshop on Modelling Autonomous Agents in a Multi-Agent World.
K. Fischer, J. P. Müller, and M. Pischel. A model for cooperative transportation scheduling. In Proceedings of the 1st International Conference on Multiagent Systems (ICMAS'95), San Francisco, June 1995.
K. Fischer, J. P. Müller, and M. Pischel. Cooperative transportation scheduling: an application domain for DAI. Journal of Applied Artificial Intelligence. Special issue on Intelligent Agents, 10(1), 1996.
P. Haddawy and S. Hanks. Utility models for goal-directed decision-theoretic planners, 1994. Submitted to Artificial Intelligence journal.
J. S. Rosenschein and G. Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation among Computers. MIT Press, 1994.
T. W. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 256–263, 1993.
T. W. Sandholm and V. R. Lesser. Coalition formation among bounded rational agents. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 662–669, 1995.
M.P. Wellman. A general-equilibrium approach to distributed transportation planning. In Proceedings of AAAI-92, pages 282–290, 1992.
G. Zlotkin and J. S. Rosenschein. A domain theory for task-oriented negotiation. In Proc. of the 13th International Joint Conference on Artificial Intelligence, volume 1, Chambéry, France, 28.8.–3.9. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, K., Müller, J.P. (1996). A decision-theoretic model for cooperative transportation scheduling. In: Van de Velde, W., Perram, J.W. (eds) Agents Breaking Away. MAAMAW 1996. Lecture Notes in Computer Science, vol 1038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031855
Download citation
DOI: https://doi.org/10.1007/BFb0031855
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60852-3
Online ISBN: 978-3-540-49621-2
eBook Packages: Springer Book Archive