Optimal negotiation strategies for agents with incomplete information

68Citations
Citations of this article
54Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper analyzes the process of automated negotiation between two competitive agents that have firm deadlines and incomplete information about their opponent. Generally speaking, the outcome of a negotiation depends on many parameters - including the agents' preferences, their reservation limits, their attitude toward time and the strategies they use. Although in most realistic situations it is not possible for agents to have complete information about each of these parameters for its opponent, it is not uncommon for agents to have partial information about some of them. Under such uncertainty, our aim is to determine how an agent can exploit its available information to select an optimal strategy. Here, in particular, the optimal strategies are determined considering all possible ways in which time can effect negotiation. Moreover, we list the conditions for convergence when both agents use their respective optimal strategies and study the effect of time on negotiation outcome. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Fatima, S. S., Wooldridge, M., & Jennings, N. R. (2002). Optimal negotiation strategies for agents with incomplete information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2333 LNAI, pp. 377–392). Springer Verlag. https://doi.org/10.1007/3-540-45448-9_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free