G. Zlotkin and J. Rosenschein, "Negotiation and task sharing among autonomous agents in cooperative domains," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, pp. 912--917.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in distributed artificial intelligence aims at models for communication and cooperation among intelligent automated systems. An overview is given in [8] The mechanism presented in this paper exploits research results from game theory. Research on game theoretic approaches to agent negotiation [13, 21] has focused on the definition of cooperation protocols that give no benefit to agents that misrepresent or hide information. In [17] disclosure of information is acceptable, because it will help an agent to find an optimal solution for itself. This also holds for the solution presented here. It ....

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proc. of the 11th Int. Joint Conference on Artificial Intelligence, pages 912--917, Detroit, Michigan, USA, August 1989.

.... other s intention, but the outcome would not have differed had they shared information, although they might have disagreed over who would be accosted Agents will act in order to achieve their goals and will not knowingly communicate false information which may harm other agents or can they [ZR89, ZR91] Deceit has long been recognised as a viable option, for example, within the context of the Prisoner s Dilemma [Axe84] Deals between agents [RG85, ZR90] are joint plans, methods sharing information, compromising over the work and even goal satisfaction. There must be a strictly defined ....

....able to generate arguments in order to classify and introduce a genuine level of competition into the goal modification process. Negotiation has long been seen as necessary as a vehicle for mutually beneficial co operation, but there is also a place for lying amongst otherwise friendly entities [ZR89, ZR91] Both papers introduce lying as a means to deal with incomplete information, also raising it within the context of the Prisoner s Dilemma [Axe84] A deal is a joint plan, they also mention multi plan deals [ZR90] deals are about sharing information, compromising over the work and even ....

Gilad Zlotkin and Jeffrey Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In 11th IJCAI, pages 912--917, 1989.

.... ) Our study also has practical importance for designing autonomous agents that can function in adversarial situations, such as competitive markets and battlefields. The issue of lies in communication has recently been addressed in the Distributed AI literature by Zlotkin and Rosenschein [8, 7, 9]. In their work, Zlotkin and Rosenschein analyze the use of lies in negotiation and conflict resolution in various domains. They study how pre established negotiation protocols, for particular domains, can ensure that agents will not lie. We, on the other hand, do not assume a pre arranged ....

Gilad Zlotkin and Jeffrey 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, August 1989.

....to communicate their true interests in the deal, and thus, privacy of interest is a major concern of each negotiation strategy. Game theorists have investigated negotiations schemes assuming public information, i.e. the utilities of both parties are published before the negotiation starts [ZR89]. In environments where published interests cannot be verified, the protocols allow for lies. Fairness for bilateral negotiations has been discussed in [RZ94,Rai82] Extensions of negotiation protocols for bounded rationality and incomplete information environments are proposed in [SL95b] 2.3 ....

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proc. of the 11th Int. Joint Conference on Artificial Intelligence, pages 912--917, Detroit, Michigan, USA, August 1989.

.... cooperation in such settings is to have reliable means for choosing a transaction from a number of alternatives in such a way that it compromises the conflicting interests of the participating agents [TA98] Existing cooperation mechanisms can be classified into bilateral multi step negotiations [ZR89, RZ94] and auctioning [Var95] Bilateral negotiations consider symmetric situations where two agents try to agree on a common plan. Many of the approaches to negotiation stem from research in game theory [NM47, FT91] which traditionally assumes public information among multiple agents [ZR89] ....

....[ZR89, RZ94] and auctioning [Var95] Bilateral negotiations consider symmetric situations where two agents try to agree on a common plan. Many of the approaches to negotiation stem from research in game theory [NM47, FT91] which traditionally assumes public information among multiple agents [ZR89] This does not apply to agents acting in competitive and hostile environments [ZS96] The negotiation approach presented in [SFJ97, NJFM96, JFN 96] for the domain of business process management considers privacy of information. However, it requires agents to reason about the interests and ....

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proc. of the 11th Int. Joint Conference on Artificial Intelligence, pages 912--917, Detroit, Michigan, USA, August 1989.

....based on sequential decision making in which the agent utilizes a preference model of the user. The user preference model is built by assessing the utility function that incorporates the user s risk attitude. Dealing with risk attitudes is an important feature of decision making. A few researchers [16] have taken into account risk attitudes for negotiation, but their work has mainly utilized the Zeuthen s Principle [3] in a game theoretic situation to determine who is the person more willing to make concessions. We utilize the risk attitudes in a different way, as discussed in section 3. In ....

Zlotkin, G., and Rosenschein, J. Negotiation and Task Sharing among Autonomous Agents in Cooperative Domains. In Proceedings of Eleventh International Joint Conference in Artificial Intelligence. (1989). 912-917.

....interactions are superadditive in game theory terms (Kahan Rapoport 1984) Generally speaking, superadditive domains are those in which agents always benefit by coordinating their activities. Most task re distribution domains such as the postman problem proposed by Zlotkin and Rosenschein (Zlotkin Rosenschein 1989) belong to this class, and here the postman problem was chosen as our domain problem. Briefly, in the postman problem, every agent (i.e. postman) in the post office is given a set of letters and they are required to deliver these letters to the addresses marked on the envelops. Agents first find ....

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

....to fully uncover the effect of the role of crossovers in spreading information spatially. 4. Discussion 6 4 Discussion The proposed model here belong to a class of models aiming at emergent computation. Related models spans from researches in such areas as distributed artificial intelligence [5, 6] and artificial neural networks, to network computation models [7, 8] The major challenge in such models are how one can design a local rules or strategies without a global or central evaluation function or unit for the effective collective information behavior to emerge. Our model here is an ....

G. Zlotkin and J. Rosenschein, "Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains," Proceedings of IJCAI-89, pp.912-917, 1989.

....resources. 1 1. Introduction 2 1 Introduction One of the major goals of distributed artificial intelligence is to obtain, through interactions between agents, effective and useful emergent decisions or computations fromm relatively simple actions by each agent in a given environment (e.g. [5, 13, 14, 15, 26]) Research toward this goal faces the difficult challenge of designing each agent s actions and interactions with others in an ever changing environment to obtain a desired macroscopic computation or action. These issues and challenges in distributed artificial intelligence are becoming ....

Zlotkin, G. and Rosenschein, J. S.: Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains. In the Proceedings of IJCAI-89, pp.912-917, 1989.

....a master agent has also been examined specifically[7] On the other hand, agents developing plans for consensus must negotiate to reach an agreement by which all goals are satisfied. The contract net protocol and its extensions offer agents this capability [8] Additional negotiation mechanisms [9][10] provide additional support for agent interactions at the consensus level of autonomy. Locally autonomous agents, which plan independently but act as part of a larger system, exhibit the most diverse behavior. They may be fully cooperative and act under a functionally accurate, cooperative ....

Zlotkin, G., and Rosenschein, J. S. Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 912-917. 1989.

....should be executed in a situation at hand. Other work in AI include efforts on semantics of KQML [29, 41] which is closely related to earlier work of Cohen and Levesque, but it does not include the notion of value central to our approach. While work on communication in negotiation is reported in [28, 48, 49]. Recently, Tambe [42] suggested decision theoretic communication selectivity to establish mutual belief among agents in a team. This approach is similar to ours in that the focus is on whether or not an agent should transmit a given message (fact) to others. Tambe uses a decision tree containing ....

Gilad Zlotkin and Jeffrey 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, August 1989.

....c t , and a threshold value of undeniability, u t , such that propositions having credibility and respectively undeniability higher than the threshold value can be retracted only after negotiation. Figure 11 also shows the regions defined by these thresholds in the c u space. In [21] and [25] examples of work exploring negotiation as a means to mediate among conflicting agents can be found. FIGURE 11. Negotiation regions in the c u space. undeniability u=u t c=c t c c t c c t u u t u u t Negotiate with consumers No negotiation Negotiate with producer Negotiate with producer and ....

Zlotkin, G., Rosenschein, J.S. Negotiation and task sharing among autonomous agents in cooperative domains, Proceedings of IJCAI-89, pp. 912-917, Detroit, MI, aug. 1989

....and Rosenschein [1992] On the other hand, agents developing plans for consensus must negotiate to reach an agreement by which all goals are satisfied. The contract net protocol developed by Smith [1980] offers agents this capability. The negotiation mechanisms presented by von Martial [1992] and Zlotkin and Rosenschein [1989] provide additional support for agent interactions at the consensus level of autonomy. Locally autonomous agents, which plan independently but act as part of a larger system, exhibit the most diverse behavior. They may be fully cooperative and act under a functionally accurate, cooperative ....

Zlotkin, G., and Rosenschein, J. S. 1989. Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 912-917.

....often cannot resolve conflicts, since both agents are likely to perform symmetrical actions at the same time, and since, in case a conflict solution is negotiated, there are no arguments one agent can put forward which could not be used by the other agent with the same right. Game theory [ZR89] proposes to toss a coin in these cases which exactly corresponds to applying the principle of randomness. Forklift agents can use potential field methods or weighted randomness in order to reach their destination and in order to avoid collisions. We consider these mechanisms to be basically ....

....occuring in the processes of executing plans in parallel branches. Seminal work in describing architectures and protocols for exchanging and processing distributed knowledge, goals, and plans has been done by [DS83, Ros85, CL88, CML88, DL89, DM91] Purely cooperative agents have been modeled by [ZR89, Jen92]. Actually, all of the research mentioned before describes rational, plan based interaction. So far, hardly any attention has been paid to the scope and the mechanisms which are available for behaviour based agent interaction. Havingmade explicit both behaviour based and planbased concepts in ....

[Article contains additional citation context not shown here]

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proc. of the Eleventh IJCAI, pages 912--917. Detroit, Michigan, August 1989.

....An agent based approach might view these entities as agents competing for tasks or cooperating to fulfill a set of tasks. Thus, as tasks are placed on the activity worklists, agents may competitively bid for work (Lesser Corkill 1983) or may negotiate in a cooperative manner to distribute work (Zlotkin Rosenschein 1989). There has been quite a lot of work on distributed or agent based agenda ordering and task allocation (Lui Sycara 1998; Gasser Huhns 1989) AI scheduling combines a rich representation of constraints and powerful constraint reasoning mechanisms with intelligent search techniques. In workflow ....

Zlotkin, G., and Rosenschein, J. 1989. Negotiation and task sharing among autonomous agents in cooperative domains.

....[59] Communications require time and effort on the part of the agents. We also assume that resources can be transferred between agents. This ability may help the agents form more beneficial coalitions. Agreement on cooperation may be reached even if the last assumption is not valid (e.g. [1,2,29,62]) However, the possibility of goods transferability (or alternatively, side payments) may help the agents form more beneficial coalitions. To emphasize the non super additivity property of the environment with which we deal, we assume that the addition of agents to a coalition is costly, and ....

G. Zlotkin and J. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domain. In Proc. of the 11th International Joint Conference on Artificial Intelligence, pages 912--917, Detroit, MI, 1989.

....should be executed in a situation at hand. Other work in AI include efforts on semantics of KQML [18, 29] which is closely related to earlier work of Cohen and Levesque, but it does not include the notion of value central to our approach. While work on communication in negotiation is reported in [17, 34, 35]. Communication among rational agents has also been of interest for the researchers in game theory, usually viewed a part of pre game cheap talk [6] or as threat games [20] see also discussion in [8] and references therein) These approaches, however, concentrate on the influence of pre play ....

Gilad Zlotkin and Jeffrey 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, August 1989.

....explicit linguistic actions, called performatives. The third level is concerned with the conventions that agents follow when interacting by exchanging messages. The existence of shared conventions makes it possible for agents to coordinate in complex ways, e.g. by carrying out negotiations [7, 8] about their goals and actions. Many such examples can be given in the context of the supply chain. The Customer agent acquires from the customer an order for 200 lamps with a due date for 28 Sept. 94. It sends this as a proposal to the Logistics agent. Knowing that Logistics can only answer ....

G. Zlotkin, J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of IJCAI-89, pp. 912-917, Detroit, MI, 1989.

....credibility, c t , and a threshold value of undeniability, u t , such that propositions having credibility and respectively undeniability higher than the threshold value can be retracted only after negotiation. Figure 7 shows the regions defined by these thresholds in the c u space. 23] and [25] are examples of work exploring negotiation as a means to mediate among conflicting agents. Conflict management with the credibility deniability model Conflict Management with a Credibility Deniability Model 13 of 17 FIGURE 7. Negotiation regions in the c u space. 5.5 The model Putting ....

Zlotkin, G., Rosenschein, J.S. (1989) Negotiation and task sharing among autonomous agents in cooperative domains, Proceedings of IJACI-89, pp. 912-917, Detroit, MI, aug.

....Linguistics and Artificial Intelligence [14] The third level is concerned with the conventions that agents follow when interacting by exchanging messages. The existence of shared conventions makes it possible for agents to coordinate in complex ways, e.g. by carrying out negotiations [54, 56] about their goals and actions. Many such examples can be given in the context of the supply chain. The Customer agent acquires from the customer an order for 200 lamps with a due date for 28 Sept. 94. It sends this as a proposal to the Logistics agent. Knowing that Logistics can only answer with ....

....about how to solve conflicts and avoids full automation of the process which is often plagued by arbitrary algorithmmade decisions. By placing the human user back into the loop, we take advantage from his her situated reasoning abilities that can make decision making realistically useful. [56] and [54] are examples of previous work exploring negotiation as a means to mediate among conflicting agents. Some recent approaches to conflict resolution use prioritized defaults [27] or model theoretic solutions [38] They provide semantic accounts of conflict resolution based on a single order ....

G. Zlotkin, J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of IJCAI-89, pp. 912-917, Detroit, MI, 1989.

....resolution phase in which some constraints are relaxed if all possible solutions failed in the previous phase. An overall view of the role of negotiation from a DPS perspective can be found in [21] Closer to the MAS pole are Sycara s work on the PERSUADER system [34] and game theoretic approaches [40], 41] 20] PERSUADER is an automated mediator in the domain of labour relations. In the presence of conflicts, PERSUADER tries to achieve a solution by generating persuasive arguments to modify and bring closer together the belief and preference structures of the parties involved. The mediator ....

Gilad Zlotkin and Jeffrey 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, 1989.

....general criteria for choosing between the coalition formation procedures. Giving a specific setting and using these criteria will enable the agents to decide which coalition formation procedure to prefer. We will concentrate on widely cooperative environments [4, 7] such as the postmen problem of [23]. The coalitionformation procedures that will be presented are either computation oriented or negotiation oriented. The appropriate procedure can be chosen according to the constraints of the environment and will lead to beneficial coalition formation. We begin by describing the environment with ....

....(e.g. money) The ways of reaching goals can be formalized by functions from the resources to the production or to the payoff. Each agent will have such a function of its own that tells what its way of using the resources to reach goals is. An example of such an environment is the postmen domain [23]. While Zlotkin and Rosenschein consider only bi agent environments (e.g. two postmen) we provide cooperation procedures for multi agent environments (e.g. several agents, possibly more than two) In addition, Zlotkin and Rosenschein do not consider both the resource allocation problem and ....

[Article contains additional citation context not shown here]

G. Zlotkin and J. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domain. In Proc. of the nth International Joint Conference on Artificial Intelligence, pages 912--917, Detroit, MI, 1989.

....agent paradigm. An agent based approach might view these entities as agents competing for tasks or cooperating to fulfill a set of tasks. Thus, as tasks are placed on the activity worklists, agents may competitively bid for work [50] or may negotiate in a cooperative manner to distribute work [90]. There has been quite a lot of work on distributed or agent based agenda ordering and task allocation [51, 28] 5.4 Summary In summary, AI scheduling techniques can contribute to the following outstanding issues in scheduler based WFM systems: ffl reactivity (anytime algorithm and rescheduling ....

G. Zlotkin and J. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989.

....its own sub tasks (for example, they may need to share the same resources) but their overall task is the same. Our work takes as a point of departure the work of researchers who have studied the negotiations that could take place among agents that serve the interests of truly distinct parties [59, 47, 63, 25, 30, 31]. The agents are autonomous; they have their own utility functions, and no global notion of utility plays a role in their design. The agents are individually motivated. For example, Sycara [59] presented a model of negotiation that combines case based reasoning and optimization of the ....

....and Genesereth [47] used certain game theoretic techniques to model communication and promises in multi agent interaction. There, the process of negotiation was severely restricted; the agents could only make single, simultaneous offers. This work was extended by Zlotkin and Rosenschein in [63]. Using game theoretic results (mainly of Harsanyi [21] they introduced a negotiation protocol for the case of agents who are able to share a discrete set of tasks with one another. In their model the impact of the passage of time in the negotiation is not taken into consideration, and they ....

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of IJCAI-89, pages 912--917, Detroit, Michigan, August 1989.

....Linguistics and Artificial Intelligence [1] The third level is concerned with the conventions that agents share when interacting by exchanging messages. The existence of shared conventions makes it possible for agents to coordinate [7, 17] in complex ways, e.g. by carying out negotiations [14, 18] about their goals and actions. As an example, consider the supply chain of our TOVE virtual manufacturing enterprise [4, 11] as a multi agent system. The Order Acquisition Agent interacts with the customer and acquires an order for 200 lamps with a due date for 28 sept 94. It sends this as a ....

Zlotkin, G., Rosenschein, J.S. Negotiation and task sharing among autonomous agents in cooperative domains, Proceedings of IJCAI-89, pp. 912-917, Detroit, MI, aug. 1989

....and undeniability propositions do not exist) the IA must negotiate retraction with the producer and or consumers. Figure 3 shows the regions defined by these thresholds in the a u space. Examples of work exploring negotiation as a means to mediate among conflicting agents are in [16] and [18]. FIGURE 3. Negotiation regions in the a u space. This model has three main advantages. First, it is accurate because the selection of the retracted belief is based on the the views of all involved parties at the moment the contradiction is detected. This means that the selection implicitly ....

Zlotkin, G., Rosenschein, J.S. Negotiation and task sharing among autonomous agents in cooperative domains, Proceedings of IJACI-89, pp. 912-917, Detroit, MI, aug.

....have exploited other social and natural metaphors as well. Economics, for example, has provided a rich set of ideas for DAI, including decision theoretic and gametheoretic techniques for modeling multiagent decisionmaking in cooperative and competitive situations [Rosenschein and Genesereth, 1985; Zlotkin and Rosenschein, 1989; Zlotkin and Rosenschein, 1990] A particularly useful metaphor has been viewing the decomposition and allocation of tasks among AI agents as a form of contracting. Contracting, as first embodied in the Contract Net protocol [Smith, 1980] has been a fundamental paradigm in the field, especially ....

Zlotkin, Gilad and Rosenschein, Jeffrey S. 1989. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. 912--917.

....resolution phase in which some constraints are relaxed if all possible solutions failed in the previous phase. An overall view of the role of negotiation from a DPS perspective can be found in [21] Closer to the MAS pole are Sycara s work on the PERSUADER system [34] and game theoretic approaches [40], 41] 20] PERSUADER is an automated mediator in the domain of labour relations. In the presence of conflicts, PERSUADER tries to achieve a solution by generating persuasive arguments to modify and bring closer together the belief and preference structures of the parties involved. The mediator ....

Gilad Zlotkin and Jeffrey Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), pages 912--917, 1989.

....here is also incomplete: those elements of the original description not described here may be assumed to have been dropped in the interests of simplicity. 7 In retrospect, this idea is probably the key contribution of the CNET work. Several researchers (notably Zlotkin and Rosenschein [190]) have subsequently investigated the properties of negotiation strategies using game theoretic techniques. MESSAGE TYPES TASKANN(t, e) Sender announces task with id t and e spec e BID(t) Sender bids for task with id t AWARD(i, t) Sender awards task with id t to agent i REQUEST(t) Sender ....

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 (IJCAI89) , pages 912--917, Detroit, MI, 1989.

.... such as the actor model (Hewitt, 1977) MACE (Gasser et al. 1987) 3 DVMT (Lesser Corkill, 1981) MICE (Durfee Montgomery, 1989) MCS (Doran et al. 1990) the contract network coordination approach (Smith, 1980; Davis Smith, 1983) MAS DAI planning and game theories (Rosenschein, 1985; Zlotkin Rosenschein, 1989; Rosenschein Zlotkin, 1994) These macro aspects of agents as Gasser (1991) terms them, emphasises the society of agents over individual agents, while micro issues relate specifically to the latter. In any case, such issues are well summarised in Chaib draa et al. 1992) Bond Gasser (1988) ....

Zlotkin, G. & Rosenschein, J. S. (1989), "Negotiation and Task Sharing among Autonomous Agents in Cooperative Domains", Proceedings of the 11th IJCAI, Detroit, Michigan, 912917.

....and Rosenschein [1992] On the other hand, agents developing plans for consensus must negotiate to reach an agreement by which all goals are satisfied. The contract net protocol developed by Smith [1980] offers agents this capability. The negotiation mechanisms presented by von Martial [1992] and Zlotkin and Rosenschein [1989] provide additional support for agent interactions at the consensus level of autonomy. Locally autonomous agents, which plan independently but act as part of a larger system, exhibit the most diverse behavior. They may be fully cooperative and act under a functionally accurate, cooperative ....

Zlotkin, G., and Rosenschein, J. S. 1989. Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains.

.... ) Our study also has practical importance for designing autonomous agents that can function in adversarial situations, such as competitive markets and battlefields. The issue of lies in communication has recently been addressed in the Distributed AI literature by Zlotkin and Rosenschein [8, 7, 9]. In their work, Zlotkin and Rosenschein analyze the use of lies in negotiation and conflict resolution in various domains. They study how pre established negotiation protocols, for particular domains, can ensure that agents will not lie. We, on the other hand, do not assume a pre arranged ....

Gilad Zlotkin and Jeffrey 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, August 1989.

No context found.

Gilad Zlotkin and Jeffrey 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, Michigan, August 1989. 27

No context found.

Gilad Zlotkin and Jeffrey 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, Michigan, August 1989.

....payments. The only assumptions that we made is on the negotiation protocol, which is a protocol of alternating offers which we describe in details in Section 3. However, we don t make any assumptions about the offers the agents make during the negotiation as is the case in some other work (e.g. [63]) In particular, the agents are not bounded to any previous offers that have been made. Nevertheless, the negotiation ends with no delay. 1.5 Related Work in Economics and Game Theory There are two main approaches to the development of theorems relating to the negotiation process. The first is ....

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of IJCAI-89, pages 912--917, Detroit, Michigan, August 1989.

....to have full information, to be rational, and to commit themselves to the agreements they have reached. The set of all possible agreements is assumed to exist and to include all the pairs of work sharing that will satisfy a goal. Another approach to handling negotiation in MAS has been explored in [192, 194, 193, 196, 195, 197]. Within this framework, agents converge to a single choice in a so called negotiation set. This negotiation set is the group of all agreements that exhibit the properties of positive utility for all agents, and Pareto Optimality. The disadvantage of these classic approaches to negotiation, ....

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, Michigan, August 1989.

....the product of the individual conveniences (max Q i c i ) This approach guarantees a relatively fair distribution of the mutually earned convenience, but narrows the space of feasible consensus states. A negotiation protocol for autonomous users that follows this approach may be found in [30]. In this research, however, we take the viewpoint of the system designer. We therefore follow the pure utilitarian approach, and prefer consensus group decisions that maximize the sum of the individual users utilities. In contrast to the approach that maximizes the product, we would rather have, ....

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, Michigan, August 1989.

....the payoff an agent will get by accepting a compromise. The payoff can be updated by changing the importance that the agent attaches to the issue or by changing the utility value of it. Zlotkin and Rosenschein s Research A negotiation mechanism was also used by Zlotkin and Rosenschein [ZR89a, ZR91, ZR90, ZR89b, ZR93b, ZR93a] to make agent interactions more efficient. Agents will communicate explicitly their desires, and by negotiating they can sometimes compromise to get mutually acceptable agreements. Their analysis is done by game theoretic means. The division of work among the ....

Gilad Zlotkin and Jeffrey 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, Michigan, August 1989.

....Foundation and Morgan Kaufmann Publishers. All rights reserved. Zlotkin Rosenschein Other researchers have focused on negotiation that might take place among agents that serve the interests of truly distinct parties (Rosenschein Genesereth, 1985; Sycara, 1988; Kraus Wilkenfeld, 1990; Zlotkin Rosenschein, 1989). The agents are autonomous in the sense that they have their own utility functions, and no global notion of utility (not even an implicit one) plays a role in their design. Negotiation can be used to share the work associated with carrying out a joint plan, or to resolve outright conflict arising ....

....DAI community as a whole that the operation of interacting agents would be enhanced if they were able to exchange information to reach mutually beneficial agreements. The work described in this paper follows the general direction of previous research by the authors (Rosenschein Genesereth, 1985; Zlotkin Rosenschein, 1989) in treating negotiation in the spirit of game theory. The focus of this research is to analyze the existence and properties of certain kinds of deals and protocols among agents. We are not here examining the computational issues that arise in discovering such deals, though the design of ....

[Article contains additional citation context not shown here]

Zlotkin & Rosenschein Zlotkin, G., & Rosenschein, J. S. (1989). Negotiation and task sharing among autonomous agents in cooperative domains. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 912--917 Detroit, Michigan.

.... have included the exchange of Partial Global Plans [ Durfee, 1988 ] the communication of information intended to alter other agents goals [ Sycara, 1988; Sycara, 1989 ] and the use of incremental suggestions leading to joint plans of action [ Kraus and Wilkenfeld, 1991 ] In previous work [ Zlotkin and Rosenschein, 1989; Zlotkin and Rosenschein, 1991a; Zlotkin and Rosen This research has been partially supported by the Leibniz Center for Research in Computer Science, and by the Israeli Ministry of Science and Technology (Grant 032 8284) schein, 1990; Zlotkin and Rosenschein, 1991b ] we have considered ....

....to lie when certain deal types were used in certain domains, but did have an incentive to lie with other deal type domain combinations. The examination of this relationship between the negotiation mechanism and the domain made use of two prototypical examples: the Postmen Domain (introduced in [ Zlotkin and Rosenschein, 1989 ] and the Slotted Blocks World (presented in [ Zlotkin and Rosenschein, 1991a ] It was clear that these two domains exemplified general classes of multi agent interactions (e.g. the Postmen Domain was inherently cooperative, the Slotted Blocks World not) It was, however, not clear what ....

[Article contains additional citation context not shown here]

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, Michigan, August 1989.

No context found.

G. Zlotkin and J. Rosenschein, "Negotiation and task sharing among autonomous agents in cooperative domains," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, pp. 912--917.

No context found.

G. Zlotkin and J. Rosenschein, "Negotiation and task sharing among autonomous agents in cooperative domains," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, pp. 912--917.

No context found.

G. Zlotkin and J. S. Rosenschein. Negotiation and task sharing among autonomous agents in cooperative domains. In Proc. of the 11th Int. Joint Conference on Artificial Intelligence, pages 912--917, Detroit, Michigan, USA, August 1989.

No context found.

Zlotkin, G., Rosenschein, J.S. (1989) Negotiation and task sharing among autonomous agents in cooperative domains, Proceedings of IJACI-89, pp. 912-917, Detroit, MI, aug. 1989

No context found.

Zlotkin, G. and J.S. Rosenschein. 1989. Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains. In Proc. IJCAI-89, 912-917, Detroit.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC