Mechanism design for automated negotiation, and its application to task oriented domains

Gilad Zlotkin, Jeffrey S. Rosenschein*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

Abstract

As distributed systems of computers play an increasingly important role in society, it will be necessary to consider ways in which these machines can be made to interact effectively. Especially when the interacting machines have been independently designed, it is essential that the interaction environment be conducive to the aims of their designers. These designers might, for example, wish their machines to behave efficiently, and with a minimum of overhead required by the coordination mechanism itself. The rules of interaction should satisfy these needs, and others. Formal tools and analysis can help in the appropriate design of these rules. We here consider how concepts from game theory can provide standards to be used in the design of appropriate negotiation and interaction environments. This design is highly sensitive to the domain in which the interaction is taking place. Different interaction mechanisms are suitable for different domains, if attributes like efficiency and stability are to be maintained. We present a general theory that captures the relationship between certain domains and negotiation mechanisms. The analysis makes it possible to categorize precisely the kinds of domains in which agents find themselves, and to use the category to choose appropriate negotiation mechanisms. The theory presented here both generalizes previous results, and allows agent designers to characterize new domains accurately. The analysis thus serves as a critical step in using the theory of negotiation in real-world applications. We show that in certain task oriented domains, there exist distributed consensus mechanisms with simple and stable strategies that lead to efficient outcomes, even when agents have incomplete information about their environment. We also present additional novel results, in particular that in concave domains using all-or-nothing deals, no lying by an agent can be beneficial, and that in subadditive domains, there often exist beneficial decoy lies that do not require full information regarding the other agent's goals.

Original languageAmerican English
Pages (from-to)195-244
Number of pages50
JournalArtificial Intelligence
Volume86
Issue number2
DOIs
StatePublished - Oct 1996

Bibliographical note

Funding Information:
Some of this research was done while Gilad Zlotkin was at the Computer Science Department of the Hebrew University of Jerusalem, and was supportedb y the Leibniz Center for Researchi n Computer Science. This researchh as also been partially supported by the Israeli Ministry of Science and Technology (Grant 032-8284) and by the Israel Science Foundation (Grant 032-751 7).

Fingerprint

Dive into the research topics of 'Mechanism design for automated negotiation, and its application to task oriented domains'. Together they form a unique fingerprint.

Cite this