메뉴 건너뛰기




Volumn 142, Issue 2, 2002, Pages 239-264

Surplus equivalence of leveled commitment contracts

Author keywords

Automated contracting; Automated negotiation; Bargaining; Bargaining under uncertainty; Breach; Breach of contract; Contracting; Game theory; Mechanism design; Multiagent systems

Indexed keywords

CONTRACTS; GAME THEORY; OUTSOURCING; PROBABILITY; SOCIAL ASPECTS;

EID: 0036888594     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00275-8     Document Type: Conference Paper
Times cited : (13)

References (27)
  • 3
    • 0000658820 scopus 로고    scopus 로고
    • Madison, WI
    • Andersson M., Sandholm T. Leveled commitment contracts with myopic and strategic agents. J. Economic Dynamics and Control (Special Issue on Agent-Based Computational Economics). 25:2001;615-640. Early version: National Conference on Artificial Intelligence (AAAI), Madison, WI, 1998, pp. 38-45.
    • (1998) Early version: National Conference on Artificial Intelligence (AAAI) , pp. 38-45
  • 5
    • 0001612540 scopus 로고
    • An equilibrium analysis of search and breach of contract, I: Steady states
    • Diamond P.A., Maskin E. An equilibrium analysis of search and breach of contract, I: Steady states. Bell J. Economics. 10:1979;282-316.
    • (1979) Bell J. Economics , vol.10 , pp. 282-316
    • Diamond, P.A.1    Maskin, E.2
  • 6
    • 0027706955 scopus 로고
    • Agents contracting tasks in non-collaborative environments
    • Washington, DC
    • Kraus S. Agents contracting tasks in non-collaborative environments. Proc. AAAI-93, Washington, DC. 1993;243-248.
    • (1993) Proc. AAAI-93 , pp. 243-248
    • Kraus, S.1
  • 10
    • 0000291018 scopus 로고
    • The bargaining problem
    • Nash J. The bargaining problem. Econometrica. 18:1950;155-162.
    • (1950) Econometrica , vol.18 , pp. 155-162
    • Nash, J.1
  • 11
    • 0002021736 scopus 로고
    • Equilibrium points in n-person games
    • Nash J. Equilibrium points in n -person games. Proc. Nat. Acad. Sci. 36:1950;48-49.
    • (1950) Proc. Nat. Acad. Sci. , vol.36 , pp. 48-49
    • Nash, J.1
  • 12
    • 0001058478 scopus 로고
    • Two-person cooperative games
    • Nash J. Two-person cooperative games. Econometrica. 21:1950;128-140.
    • (1950) Econometrica , vol.21 , pp. 128-140
    • Nash, J.1
  • 17
    • 0003019549 scopus 로고
    • Perfect equilibrium in a bargaining model
    • Rubinstein A. Perfect equilibrium in a bargaining model. Econometrica. 50:1982;97-109.
    • (1982) Econometrica , vol.50 , pp. 97-109
    • Rubinstein, A.1
  • 18
    • 0027708201 scopus 로고
    • An implementation of the contract net protocol based on marginal cost calculations
    • Washington, DC
    • Sandholm T. An implementation of the contract net protocol based on marginal cost calculations. Proc. AAAI-93, Washington, DC. 1993;256-262.
    • (1993) Proc. AAAI-93 , pp. 256-262
    • Sandholm, T.1
  • 19
    • 0033700004 scopus 로고    scopus 로고
    • eMediator: A next generation electronic commerce server
    • Computational Intelligence (Special issue on Agent Technology for Electronic Commerce), to appear. Early versions appeared in Barcelona, Spain
    • T. Sandholm, eMediator: A next generation electronic commerce server, Computational Intelligence (Special issue on Agent Technology for Electronic Commerce), to appear. Early versions appeared in Proc. Fourth International Conference on Autonomous Agents (AGENTS), Barcelona, Spain, 2000, pp. 73-96, and in AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55, and Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999.
    • (2000) Proc. Fourth International Conference on Autonomous Agents (AGENTS) , pp. 73-96
    • Sandholm, T.1
  • 20
    • 0010268526 scopus 로고    scopus 로고
    • Orlando, FL, July, and Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999
    • T. Sandholm, eMediator: A next generation electronic commerce server, Computational Intelligence (Special issue on Agent Technology for Electronic Commerce), to appear. Early versions appeared in Proc. Fourth International Conference on Autonomous Agents (AGENTS), Barcelona, Spain, 2000, pp. 73-96, and in AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55, and Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999.
    • (1999) AAAI-99 Workshop on AI in Electronic Commerce , pp. 46-55
  • 21
    • 0003101953 scopus 로고
    • Issues in automated negotiation and electronic commerce: Extending the contract net framework
    • Reprinted in: Huhns, Singh (Eds.), Readings in Agents, 1997, pp. 66-73
    • Sandholm T., Lesser V.R. Issues in automated negotiation and electronic commerce: Extending the contract net framework. Proc. First International Conference on Multi-Agent Systems (ICMAS), San Francisco, CA. 1995;328-335. Reprinted in: Huhns, Singh (Eds.), Readings in Agents, 1997, pp. 66-73.
    • (1995) Proc. First International Conference on Multi-Agent Systems (ICMAS), San Francisco, CA , pp. 328-335
    • Sandholm, T.1    Lesser, V.R.2
  • 22
    • 0347748154 scopus 로고    scopus 로고
    • Leveled commitment contracts and strategic breach
    • Sandholm T., Lesser V.R. Leveled commitment contracts and strategic breach. Games and Economic Behavior (Special issue on AI and Economics). 35:2001;212-270. Early versions appeared as Advantages of a Leveled Commitment Contracting Protocol, in: Proc. National Conference on Artificial Intelligence (AAAI), Portland, OR, 1996, pp. 126-133, and as UMass Amherst Computer Science Department Technical Report 95-72.
    • (2001) Games and Economic Behavior (Special issue on AI and Economics) , vol.35 , pp. 212-270
    • Sandholm, T.1    Lesser, V.R.2
  • 23
    • 0030372125 scopus 로고    scopus 로고
    • Early versions appeared as advantages of a leveled commitment contracting protocol
    • Portland, OR, and as UMass Amherst Computer Science Department Technical Report 95-72
    • Sandholm T., Lesser V.R. Leveled commitment contracts and strategic breach. Games and Economic Behavior (Special issue on AI and Economics). 35:2001;212-270. Early versions appeared as Advantages of a Leveled Commitment Contracting Protocol, in: Proc. National Conference on Artificial Intelligence (AAAI), Portland, OR, 1996, pp. 126-133, and as UMass Amherst Computer Science Department Technical Report 95-72.
    • (1996) Proc. National Conference on Artificial Intelligence (AAAI) , pp. 126-133
  • 24
    • 84880672871 scopus 로고    scopus 로고
    • Algorithms for optimizing leveled commitment contracts
    • Stockholm, Sweden. Extended version: Washington University, Department of Computer Science Technical Report WUCS-99-04
    • Sandholm T., Sikka S., Norden S. Algorithms for optimizing leveled commitment contracts. Proc. IJCAI-99, Stockholm, Sweden. 1999;535-540. Extended version: Washington University, Department of Computer Science Technical Report WUCS-99-04.
    • (1999) Proc. IJCAI-99 , pp. 535-540
    • Sandholm, T.1    Sikka, S.2    Norden, S.3
  • 25
    • 0032596651 scopus 로고    scopus 로고
    • Bargaining with deadlines
    • Orlando, FL
    • Sandholm T., Vulkan N. Bargaining with deadlines. Proc. AAAI-99, Orlando, FL. 1999;44-51.
    • (1999) Proc. AAAI-99 , pp. 44-51
    • Sandholm, T.1    Vulkan, N.2
  • 27
    • 0019180974 scopus 로고
    • The contract net protocol: High-level communication and control in a distributed problem solver
    • Smith R.G. The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Trans. Comput. C-29:(12):1980;1104-1113.
    • (1980) IEEE Trans. Comput. , vol.C-29 , Issue.12 , pp. 1104-1113
    • Smith, R.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.