Abstract
Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent really is motivated to follow the strategies that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes:
-
1.
OCSM-contracts in marginal cost based contracting,
-
2.
leveled commitment contracts,
-
3.
anytime coalition structure generation with worst case guarantees,
-
4.
trading off computation cost against optimization quality within each coalition,
-
5.
distributing search among insincere agents, and
-
6.
unenforced contract execution.
Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multiagent systems move into large scale open settings.
This material is based upon work supported by the National Science Foundation under CAREER Award IRI-9703122 and Grant No. IRI-9610122.
Preview
Unable to display preview. Download preview PDF.
References
Martin R Andersson and Tuomas W Sandholm. Contract types for satisficing task allocation: II experimental results. In AAAI Spring Symposium Series: Satisficing Models, pages 1–7, Stanford University, CA, March 1998.
Martin R Andersson and Tuomas W Sandholm. Leveled commitment contracting among myopic individually rational agents. In Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS), Paris, France, July 1998.
Martin R Andersson and Tuomas W Sandholm. Leveled commitment contracts with myopic and strategic agents. In Proceedings of the National Conference on Artificial Intelligence, Madison, WI, July 1998.
Mark Boddy and Thomas Dean. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67:245–285, 1994.
Alan H. Bond and Les Gasser. Readings in Distributed Artificial Intelligence. Morgan Kaufmann Publishers, San Mateo, CA, 1988.
John Q. Cheng and Michael P. Wellman. The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics, 1997.
E Durfee, V Lesser, and D Corkill. Cooperative distributed problem solving. In A Barr, P Cohen, and E Feigenbaum, editors, The Handbook of Artificial Intelligence, volume IV, pages 83–147. Addison Wesley, 1989.
Eithan Ephrati and Jeffrey S Rosenschein. The Clarke tax as a consensus mechanism among automated agents. In Proceedings of the National Conference on Artificial Intelligence, pages 173–178, Anaheim, CA, 1991.
Cheng Gu and Toru Ishida. A quantitative analysis of the contract net protocol. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), page 449, San Francisco, CA, June 1995. In the poster collection.
James P Kahan and Amnon Rapoport. Theories of Coalition Formation. Lawrence Erlbaum Associates Publishers, 1984.
Steven Ketchpel. Forming coalitions in the face of uncertain rewards. In Proceedings of the National Conference on Artificial Intelligence, pages 414–419, Seattle, WA, July 1994.
Sarit Kraus, Jonathan Wilkenfeld, and Gilad Zlotkin. Multiagent negotiation under time constraints. Artificial Intelligence, 75:297–345, 1995.
David M Kreps. A Course in Microeconomic Theory. Princeton University Press, 1990.
Andreu Mas-Colell, Michael Whinston, and Jerry R. Green. Microeconomic Theory. Oxford University Press, 1995.
H. Raiffa. The Art and Science of Negotiation. Harvard Univ. Press, Cambridge, Mass., 1982.
Jeffrey S Rosenschein and Gilad Zlotkin. Rules of Encounter. MIT Press, 1994.
Stuart Russell and Devika Subramanian. Provably bounded-optimal agents. Journal of Artificial Intelligence Research, 1:1–36, 1995.
Tuomas W Sandholm. A strategy for decreasing the total transportation costs among area-distributed transportation centers. In Nordic Operations Analysis in Cooperation (NOAS): OR in Business, Turku School of Economics, Finland, 1991.
Tuomas W Sandholm. Automatic cooperation of area-distributed dispatch centers in vehicle routing. In International Conference on Artificial Intelligence Applications in Transportation Engineering, pages 449–467, San Buenaventura, CA, 1992.
Tuomas W Sandholm. Automatic cooperation of factorially distributed dispatch centers in vehicle routing. In abstract collection of the Joint International Conference on Operational Research / Management Science (EURO / TIMS), page 51, Helsinki, Finland, 1992.
Tuomas W Sandholm. A bargaining network for intelligent agents. In Finnish Artificial Intelligence Conference (STeP-92), New Directions in Artificial Intelligence, volume 3, pages 173–181, Espoo, Finland, 1992.
Tuomas W Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In Proceedings of the National Conference on Artificial Intelligence, pages 256–262, Washington, D.C., July 1993.
Tuomas W Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multi-Agent Systems (ICMAS), pages 299–306, Keihanna Plaza, Kyoto, Japan, December 1996.
Tuomas W Sandholm. Negotiation among Self-Interested Computationally Limited Agents. PhD thesis, University of Massachusetts, Amherst, 1996. Available at http://www.cs.wustl.edu/~sandholm/dissertation.ps.
Tuomas W Sandholm. Unenforced E-commerce transactions. IEEE Internet Computing, 1(6):47–54, Nov–Dec 1997. Special issue on Electronic Commerce.
Tuomas W. Sandholm. Contract types for satisficing task allocation: I theoretical results. In AAAI Spring Symposium Series: Satisficing Models, pages 68–75, Stanford University, CA, March 1998.
Tuomas W Sandholm, Kate S Larson, Martin R Andersson, Onn Shehory, and Fernando Tohmé. Anytime coalition structure generation with worst case guarantees. In Proceedings of the National Conference on Artificial Intelligence, Madison, WI, July 1998.
Tuomas W Sandholm and Victor R Lesser. Equilibrium analysis of the possibilities of unenforced exchange in multiagent systems. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 694–701, Montreal, Canada, August 1995.
Tuomas W Sandholm and Victor R Lesser. Issues in automated negotiation and electronic commerce: Extending the contract net framework. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), pages 328–335, San Francisco, CA, June 1995. Reprinted in Readings in Agents, Huhns and Singh, eds., pp. 66–73, 1997.
Tuomas W Sandholm and Victor R Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the National Conference on Artificial Intelligence, pages 126–133, Portland, OR, August 1996.
Tuomas W Sandholm and Victor R Lesser. Coalitions among computationally bounded agents. Artificial Intelligence, 94(1):99–137, 1997. Special issue on Economic Principles of Multiagent Systems. Early version appeared at the International Joint Conference on Artificial Intelligence, pages 662–669, 1995.
Tuomas W Sandholm and Fredrik Ygge. On the gains and losses of speculation in equilibrium markets. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 632–638, Nagoya, Japan, August 1997.
Sandip Sen. Tradeoffs in Contract-Based Distributed Scheduling. PhD thesis, Univ. of Michigan, 1993.
Sandip Sen and Edmund Durfee. The role of commitment in cooperative negotiation. International Journal on Intelligent Cooperative Information Systems, 3(1):67–81, 1994.
Onn Shehory and Sarit Kraus. Task allocation via coalition formation among autonomous agents. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 655–661, Montreal, Canada, August 1995.
Onn Shehory and Sarit Kraus. A kernel-oriented model for coalition-formation in general environments: Implemetation and results. In Proceedings of the National Conference on Artificial Intelligence, pages 134–140, Portland, OR, August 1996.
Reid G. Smith. The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Transactions on Computers, C-29(12):1104–1113, December 1980.
Fernando Tohmé and Tuomas W Sandholm. Coalition formation processes with belief revision among bounded rational self-interested agents. In IJCAI Workshop on Social Interaction and Communityware, pages 43–51, Nagoya, Japan, August 1997.
Michael Wellman. A market-oriented programming environment and its application to distributed multicommodity flow problems. Journal of Artificial Intelligence Research, 1:1–23, 1993.
Shlomo Zilberstein and Stuart Russell. Optimal composition of real-time systems. Artificial Intelligence, 82(1–2):181–213, 1996.
Gilad Zlotkin and Jeffrey S Rosenschein. Coalition, cryptography and stability: Mechanisms for coalition formation in task oriented domains. In Proceedings of the National Conference on Artificial Intelligence, pages 432–437, Seattle, WA, July 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sandholm, T. (1998). Agents in electronic commerce: Component technologies for automated negotiation and coalition formation. In: Klusch, M., Weiß, G. (eds) Cooperative Information Agents II Learning, Mobility and Electronic Commerce for Information Discovery on the Internet. CIA 1998. Lecture Notes in Computer Science, vol 1435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053679
Download citation
DOI: https://doi.org/10.1007/BFb0053679
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64676-1
Online ISBN: 978-3-540-69109-9
eBook Packages: Springer Book Archive