Skip to main content

Negotiation with incomplete information about worth: Strict versus tolerant mechanisms

  • Conference paper
  • First Online:
Artificial Social Systems (MAAMAW 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 830))

  • 149 Accesses

Abstract

Research in Distributed Artificial Intelligence (DAI) has for years been concerned with mechanisms of negotiation. In previous work, we considered situations where agents' goals were private information [12, 14, 15]. In order to carry out the negotiation, the agents were to declare, in a -1-phase, their goals. We then analyzed what goal declaration strategies the agents might adopt to increase their utility.

In this paper, we consider an inverted situation, where the agents' goals (and therefore stand-alone costs) are common knowledge, but where the worth they attach to their goals is private information. The agents declare, in a -1-phase, their worths, which are then used as a baseline to the utility calculation (and thus affect the negotiation outcome). We are concerned with analyzing what worth declaration strategies the agents might adopt to increase their utility.

We introduce two mechanisms, one “strict,” the other “tolerant,” and analyze their affects on the stability and efficiency of negotiation outcomes. The strict mechanism turns out to be more stable, while the tolerant mechanism is more efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. H. Durfee. Coordination of Distributed Problem Solvers. Kluwer Academic Publishers, Boston, 1988.

    Google Scholar 

  2. J. C. Harsanyi. Rational Behavior and Bargaining Equilibrium in Games and Social Situations. Cambridge University Press, Cambridge, 1977.

    Google Scholar 

  3. S. Kraus and J. Wilkenfeld. Negotiations over time in a multi agent environment: Preliminary report. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 56–61, Sydney, Australia, August 1991.

    Google Scholar 

  4. T. Kreifelts and F. Martial. A negotiation framework for autonomous agents. In Proceedings of the 2nd European Workshop on Modeling Autonomous Agents and Multi-Agent Worlds, pages 169–182, Saint-Quentin en Yvelines, France, August 1990.

    Google Scholar 

  5. K. Kuwabara and V. R. Lesser. Extended protocol for multistage negotiation. In Proceedings of the Ninth Workshop on Distributed Artificial Intelligence, pages 129–161, Rosario, Washington, September 1989.

    Google Scholar 

  6. R. D. Luce and H. Raiffa. Games and Decisions. John Wiley & Sons, Inc., New York, 1957.

    Google Scholar 

  7. T. Malone, R. Fikes, and M. Howard. Enterprise: A market-like task scheduler for distributed computing environments. In B. A. Huberman, editor, The Ecology of Computation. North-Holland Publishing Company, Amsterdam, 1988.

    Google Scholar 

  8. John F. Nash. The bargaining problem. Econometrica, 28:155–162, 1950.

    Google Scholar 

  9. Reid G. Smith. A Framework for Problem Solving in a Distributed Processing Environment. PhD thesis, Stanford University, 1978.

    Google Scholar 

  10. K. P. Sycara. Resolving goal conflicts via negotiation. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 245–250, St. Paul, Minnesota, August 1988.

    Google Scholar 

  11. K.P. Sycara. Argumentation: Planning other agents' plans. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 517–523, Detroit, August 1989.

    Google Scholar 

  12. G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 912–917, Detroit, August 1989.

    Google Scholar 

  13. G. Zlotkin and J. S. Rosenschein. Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1317–1324, December 1991.

    Google Scholar 

  14. G. Zlotkin and J. S. Rosenschein. Incomplete information and deception in multiagent negotiation. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 225–231, Sydney, Australia, August 1991.

    Google Scholar 

  15. G. Zlotkin and J. S. Rosenschein. A domain theory for task oriented negotiation. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 416–422, Chambery, France, August 1993.

    Google Scholar 

  16. G. Zlotkin and J. S. Rosenschein. Negotiation among tidy agents. Computers and Artificial Intelligence, 12(1), 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Cristiano Castelfranchi Eric Werner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zlotkin, G., Rosenschein, J.S. (1994). Negotiation with incomplete information about worth: Strict versus tolerant mechanisms. In: Castelfranchi, C., Werner, E. (eds) Artificial Social Systems. MAAMAW 1992. Lecture Notes in Computer Science, vol 830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58266-5_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-58266-5_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58266-3

  • Online ISBN: 978-3-540-48589-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics