Surplus equivalence of leveled commitment contracts

Abstract 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 strategically in Nash equilibrium. Such contracts differ based on whether agents have to declare their decommitting decisions sequentially or simultaneously, and whether or not agents have to pay the penalties if both decommit. For a given contract, these mechanisms lead to different decommitting thresholds, probabilities, and expected social welfare. However, this paper shows that each of these mechanisms leads to the same social welfare when the contract price and penalties are optimized for each mechanism separately. Our derivations allow agents to construct optimal leveled commitment contracts. We show that such integrative bargaining does not hinder distributive bargaining: the surplus can be divided arbitrarily (as long as each agent benefits), e.g., equally, without compromising optimality. Nonuniqueness questions are answered. We also show that surplus equivalence ceases to hold if agents are not risk neutral.

[1]  Richard A. Posner,et al.  Economic Analysis of Law , 1974 .

[2]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[3]  Tuomas Sandholm,et al.  Bargaining with Deadlines , 1999, AAAI/IAAI.

[4]  Tuomas Sandholm eMediator: A Next Generation Electronic Commerce Server , 2002, Comput. Intell..

[5]  Martin Andersson,et al.  Leveled commitment contracting among myopic individually rational agents , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[6]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[7]  Martin Andersson,et al.  Leveled Commitment Contracts with Myopic and Strategic Agents , 1998, AAAI/IAAI.

[8]  Eric Maskin,et al.  An Equilibrium Analysis of Search and Breach of Contract , 1978 .

[9]  Sarit Kraus,et al.  Multiagent Negotiation under Time Constraints , 1995, Artif. Intell..

[10]  A. Rubinstein Perfect Equilibrium in a Bargaining Model , 1982 .

[11]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[12]  Sarit Kraus,et al.  Agents Contracting Tasks in Non-Collaborative Environments , 1993, AAAI.

[13]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Victor R. Lesser,et al.  Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework , 1997, ICMAS.

[15]  E. Maskin,et al.  An Equilibrium Analysis of Search and Breach of Contract, I: Steady States , 1979 .

[16]  J. Nash Two-Person Cooperative Games , 1953 .

[17]  Eduardo Alonso Fernández,et al.  Rules of encounter: designing conventions for automated negotiation among computers , 1995 .

[18]  Louis Kaplow,et al.  Economic Analysis of Law , 2004 .

[19]  J. Nash THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[20]  Victor R. Lesser,et al.  Leveled Commitment Contracts and Strategic Breach , 2001, Games Econ. Behav..

[21]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[22]  Tuomas Sandholm,et al.  Algorithms for Optimizing Leveled Commitment Contracts , 1999, IJCAI.

[23]  A. Muthoo Bargaining Theory with Applications , 1999 .

[24]  A. Rubinstein,et al.  Bargaining and Markets. , 1991 .

[25]  Sandip Sen Predicting tradeoffs in contract-based distributed scheduling , 1993 .

[26]  Victor R. Lesser,et al.  Advantages of a Leveled Commitment Contracting Protocol , 1996, AAAI/IAAI, Vol. 1.