Leveled Commitment Contracts with Myopic and Strategic Agents
نویسندگان
چکیده
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents to e$ciently deal with future events. This de"ciency can be tackled by using a leveled commitment contracting protocol which allows the agents to decommit from contracts by paying a monetary penalty to the contracting partner. The e$ciency of such protocols depends heavily on how the penalties are decided. In this paper, di!erent leveled commitment protocols and their parameterizations are experimentally compared in sequences of multiple contracts. In the di!erent experiments, the age nts are of di!erent types: self-interested or social welfare maximizing, and they can carry out game-theoretic lookahead or be myopic. Several meeting technologies, ways of setting the contract price, and ways of setting and increasing the penalties are compared. Surprisingly, selfinterested myopic agents reach a higher social welfare quicker than cooperative myopic agents when decommitment penalties are low. The social welfare in settings with agents that perform lookahead does not vary as much with the decommitment penalty as the social welfare in settings that consist of myopic agents. In all of the settings, the best way to set the decommitment penalties is to choose low penalties, but ones that are greater than zero. This indicates that leveled commitment contracting protocols outperform 0165-1889/01/$ see front matter ( 2001 Elsevier Science B.V. All rights reserved. PII: S 0 1 6 5 1 8 8 9 ( 0 0 ) 0 0 0 3 9 7 1An early version of this paper appeared at the National Conference on Arti"cial Intelligence (AAAI) (Andersson and Sandholm, 1998b). both full commitment protocols and commitment free protocols.1 ( 2001 Elsevier Science B.V. All rights reserved. JEL classixcation: L140; D830; C780; C630
منابع مشابه
Leveled Commitment Contracting among Myopic Individually Rational Agents
In automated negotiation systems consisting of selfinterested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents to act e ciently upon future events. A leveled commitment protocol allows the agents to decommit from contracts by paying a monetary penalty to the contracting partner. The e ciency of such protocols depends heavily o...
متن کاملLeveled Commitment Contracts and Strategic Breach
Ž . In automated negotiation systems for self-interested agents, contracts have traditionally been binding. They do not accommodate future events. Contingency contracts address this, but are often impractical. As an alternative, we propose le eled commitment contracts. The level of commitment is set by breach penalties. To be freed from the contract, an agent simply pays the penalty to the othe...
متن کاملRevenue Equivalence of Leveled Commitment Contracts Revenue Equivalence of Leveled Commitment Contracts
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty|were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts diier based on whether agents have to declare ...
متن کاملAlgorithms for Optimizing Leveled Commitment Contracts Algorithms for Optimizing Leveled Commitment Contracts
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty | were recently shown to improve Pareto ef-ciency even if agents rationally decommit in Nash equilibrium using innated thresholds on how good their outside ooers must be bef...
متن کاملAdvantages of a Leveled Commitment
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Such contracts do not allow agents to eeciently accommodate future events. Game theory has proposed contingency contracts to solve this problem. Among computational agents, contingency contracts are often impractical due to large numbers of interdependent and unanticipated future ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998