Sandholm, T.W., Lesser, V.R.: Advantages of a leveled commitment contracting protocol. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), Portland, OR, USA (1996) 126--133  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the cost of defaulting. We analyze the performance of this algorithm in situations where single and multiple agents are learning. 2. RELATED WORK Several recent approaches to modeling the intention reconciliation problem use a market oriented or contract based framework. Sandholm and Lesser [9] introduce the concept of leveled commitment contracts in which agents pay the rest of the group a predetermined penalty for defaulting on a group related task. Sen and Biswas [10] introduce a setup in which there is no direct market mediation, but instead agents choose which others to work with ....

T. Sandholm and V. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of AAAI, 1996.

....policies change the way agents evaluate trade offs. They provide a mechanism for constraining individuals so that the good of the team plays a role in their decision making. Social commitment policies may include immediate penalties for defaulting like the ones proposed by Sandholm et al. [32, 1, 33, 34], as well as longer term policies based on the agent s behavior over time. Section 4 describes two examples of the latter type of policy that were studied in the work reported in this paper. Social factors may also function in another way. If agents get part of their utility from the team, they ....

.... have begun to adapt these frameworks to multi agent systems, a number of important research challenges need to be addressed before these frameworks will be able to handle problem domains with collaborating but self interested agents [6] It is also worth noting that while Sandholm et al. [32, 1, 33, 34] apply a formal approach to scenarios involving two or three agents in their related work on leveled commitment contracts (see Section 7) they too employ simulations when considering larger groups of agents like the ones we have studied with SPIRE. A SPIRE simulation requires that a number of ....

[Article contains additional citation context not shown here]

Sandholm, T.W. and Lesser, V.R. 1996. Advantages of a leveled commitment contracting protocol. In: Proc. of AAAI-96, pp. 126-133.

....and Applied Algorithmics . This research has been performed within the framework of the project Distributed Engine for Advanced Logistics (DEAL) funded by the E.E.T. program in the Netherlands. 1. INTRODUCTION A levelled commitment protocol for negotiations between agents is presented in [20, 22, 1, 21]. In this protocol, agents have the opportunity to unilaterally decoremit from contracts. That is, they can forego a previous contract for another (superior) offer. Sandholm et al. have shown formally that by incorporating this decommitment option the degree of Pareto efficiency of the reached ....

....for future implementations. 4. The Decornrnitrnent Option 5 case. This, in general, increases the competition between the trucks of different companies. 4. THE DECOMMITMENT OPTION Contracts are typically binding in traditional multi agent negotiation protocols with self interested agents. In [20, 22, 1], a more general protocol with continuous levels of commitment (based upon a monetary penalty method) is proposed and analyzed. The key ingredient of this protocol, the option to break an agreement in favor of a better deal, is maintained in our negotiation model. In the experiments, an agent with ....

T. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, OR, 1996.

....and Applied Algorithmics . This research has been performed within the framework of the project Distributed Engine for Advanced Logistics (DEAL) funded by the E.E.T. program in the Netherlands. 1. Introduction A levelled commitment protocol for negotiations between agents is presented in [ 20, 22, 1, 21 ] . In this protocol, agents have the opportunity to unilaterally decommit from contracts. That is, they can forego a previous contract for another (superior) o er. Sandholm et al. have shown formally that by incorporating this decommitment option the degree of Pareto eciency of the reached ....

....for future implementations. 4. The Decommitment Option 5 case. This, in general, increases the competition between the trucks of di erent companies. 4. The Decommitment Option Contracts are typically binding in traditional multi agent negotiation protocols with self interested agents. In [ 20, 22, 1 ] , a more general protocol with continuous levels of commitment (based upon a monetary penalty method) is proposed and analyzed. The key ingredient of this protocol, the option to break an agreement in favor of a better deal, is maintained in our negotiation model. In the experiments, an agent ....

T. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the Thirteenth National Conference on Arti cial Intelligence, Portland, OR, 1996.

....(MAS) to handle the routing and assigning of cargo transportation tasks dynamically in a robust, distributed manner. Current examples are [ Parkes and Ungar, 2001 ] and [ Fischer et al. 1996 ] where tasks are assigned via auctions with some global knowledge. In [ Sandholm and Lesser, 1995; Sandholm and Lesser, 1996; Andersson and Sandholm, 2001 ] a leveled commitment protocol is introduced and applied. Agents can unilaterally decommit from deals. This allows agents to react to better deals that occur stochastically. It is shown through formal analysis of multiple contracting settings that this level ....

....auction is made public. The dominant strategy is the bidding of the actual expected pro t (valuation) Vickrey, 1961 ] under the assumption of sucient competition between the trucks of the companies. In this auction setup, in the long run, the agent cannot pro t by using a di erent strategy [ Sandholm, 1996 ] Furthermore, in our model, opportunities for speculation as in [ Rosenschein and Zlotkin, 1994; McMillan, 1994; Watson, 2002 ] are restricted. As a cost in the bidding is occurred if the bid is won when there are competitors, the trucks within one company only enter an auction if they are ....

[Article contains additional citation context not shown here]

T.W. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the Thirteenth National Conference on Arti cial Intelligence, Portland, OR, 1996.

....of s depends on the number of rounds, the distribution of private values and his derogation rate (an upper bound for s is specified in [1] 5. 3 Leveled Commitment Contracting If the task execution contracts are not binding and can be breached by paying a penalty (leveled commitment contracting [16, 17, 2]) the unavoidable loss an agent produces by underbidding the cheapest competitor can be reduced by breaking the negative contract. Due to the fact that the only reason for closing that deal is to figure out the private value of another agent, the agent has no incentive to really accomplish the ....

T.W. Sandholm and V.R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 126--133, 1996.

....about the other agent. Conventions describe circumstances under which an agent should reconsider its commitments. Reconsideration is necessary in dynamic environments where the reason or possibility to achieve a goal may disappear. For example, Sandholm s multi leveled commitment protocol[SL95a] uses a marginal cost penalty convention to allow agents to break commitments. The subclass of social conventions specify how agents should to behave with respect to the other agents when a commitment is changed. Commitments can give agents structured behaviour, i.e. they can use and rely help ....

....will break the contract if event E happens, and can take appropriate precautions. But using contingency dependent contracts quickly become cumbersome, both due to the size of the contracts, and to the diculty to predict all future contingencies. Instead of contingencies, Sandholm and Lesser, in [SL95a] extended the protocol to a leveled commitment protocol with a decommitment penalty, that allowed either agent to unilaterally decommit. The penalties are calculated in advance, so the agent only has to perform local computations to decide whether to decommit or not. In the categorization in ....

Tuomas Sandholm and Victor Lesser. Advantages of a leveled commitment contracting protocol. extended version. Technical report, University of Massachusetts at Amherst, Computer Science,

....of s depends on the number of rounds, the distribution of private values and his derogation rate (an upper bound for s is specified in [1] 5. 3 Leveled Commitment Contracting If the task execution contracts are not binding and can be breached by paying a penalty (leveled commitment contracting [15, 16, 3]) the unavoidable loss an agent produces by underbidding the cheapest competitor can be reduced by breaking the negative contract. Due to the fact that the only reason for closing that deal is to figure out the private value of another agent, the agent has no incentive to really accomplish the ....

T.W. Sandholm and V.R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 126--133, 1996.

....design of a control architecture. Furthermore, some negotiation schemes can drastically increase communication requirements. 2.4. Optimization Techniques Many research efforts have focused on developing optimization techniques applicable to distributed multiagent systems. Sandholm and Lesser [57], Sandholm et al. 62] and Excelente toledo et al. 25] have proposed methods of allowing breaching of contracts as an optimization mechanism in economy based approaches. Sandholm and Suri [59] examine the use of combinatorial auction schemes for optimizing negotiation. Many groups have ....

Sandholm, T., and Lesser, V., "Advantages Of A Leveled Commitment Contracting Protocol", Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 126-133, 1996.

....the drawback is that the speci c conditions under which commitments can be broken must be enumerated in advance. In dynamic and unpredictable environments this can be extremely dicult (and sometimes impossible) To provide yet greater exibility, levelled commitment contracts were introduced [11]. In such contracts, either party can decommit, for whatever reason, as long as they pay the xed decommitment penalty that is speci ed in the contract. This type of commitment avoids the problem of having to a priori enumerate speci c environmental or agent states and allows agents to decommit ....

....with optimal reasoning within the context of a given coordination mechanism, rather than actually reasoning about which mechanism to employ in a particular situation. In terms of work on commitment, our model is most closely related to that of Sandholm and Lesser s levelled commitment contracts [11] (a discussion of how our model relates to that of other work on commitment is given in section 1) Our approach builds upon Sandholm s basic intuition that agents should be able to unilaterally decommit from a contract, for whatever reason they deem appropriate, subject to the payment of a ....

T. W. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the Thirteenth National Conference on Articial Intelligence (AAAI-96), pages 126-133, Portland, Oregon, August 1996.

No context found.

T. Sandholm and V. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 126--133, 1996.

No context found.

Sandholm, T. and Lesser, V. 1996. Advantages of a Leveled Commitment Contracting Protocol. Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 126-133, Portland, OR, .

No context found.

T. W. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the National Conference on Artificial Intelligence, Portland, OR, Aug. 1996. Extended version appeared as University of Massachusetts at Amherst, Computer Science Department technical report 95-72.

No context found.

Sandholm, T.W., Lesser, V.R.: Advantages of a leveled commitment contracting protocol. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), Portland, OR, USA (1996) 126--133

No context found.

T. W. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proc. of the 13th Conference on Artificial Intelligence (AAAI'96), pages 126--133, OR, USA, 1996.

No context found.

Sandholm, T. and V. Lesser, "Advantages of a Leveled Commitment Contracting Protocol," Thirteenth National Conference on Artificial Intelligence (AAAI-96), Portland, OR (1996).

No context found.

Tuomas Sandholm and Victor Lesser. Advantages of a Leveled Commitment Contracting Protocol. Extended version. Technical report, University of Massachusetts at Amherst, Computer Science, 1995.

No context found.

Sandholm, T. and Lesser, V. 1996. Advantages of a leveled commitment contracting protocol Thirteenth National Conference on Artificial Intelligence (AAAI-96), Portland, OR, pp. 126-- 133.

No context found.

Tuomas W Sandholm and Victor R Lesser. Advantages of a leveled commitment contracting protocol. In Proc. 14th National Conference on Artificial Intelligence (AAAI-96), pages 126--133, July 1996.

No context found.

T. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI), pages 126-- 133, 1996.

No context found.

T.W. Sandholm and V.R. Lesser, "Advantages of a leveled commitment contracting protocol," in Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), vol. 1, Portland, OR, USA, 1996, AAAI Press, pp. 126--133.

No context found.

T.W. Sandholm and V.R. Lesser. Advantages of a leveled commitment contracting protocol. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 126--133, 1996.

No context found.

Sandholm, T.W., Lesser, V.R.: Advantages of a leveled commitment contracting protocol. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), Portland, OR, USA (1996) 126--133

No context found.

Sandholm, T.W. and Lesser, V.R. 1996. Advantages of a leveled commitment contracting protocol. In: Proc. of AAAI-96, pp. 126-133.

No context found.

Sandholm, T. W., and Lesser, V. R. 1996. Advantages of a leveled commitment contracting protocol. In Proc. 14th National Conference on Arti#cial Intelligence #AAAI-96#, 126#133.

First 50 documents  Next 50

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