IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/1768.html

Automated Negotiation from Declarative Contract Descriptions

Author

Listed:
  • Grosof, Benjamin
  • Reeves, Daniel
  • Wellman, Michael

Abstract

Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process by applying general knowledge about auctions and domain-specific knowledge about the contract subject along with preferences from po- tential buyers and sellers. Second, translate the determined negotiation structure into an operational specication for an auction platform. Third, map the negotiation results to a nal contract. We have implemented a prototype which supports these steps, employing a declarative specication (in Courteous Logic Programs) of (1) high-level knowledge about alternative negotiation structures, (2) general-case rules about auction parameters, (3) rules to map the auction parameters to a specic auction platform, and (4) special- case rules for subject domains. We demonstrate the exi- bility of this approach by automatically generating several alternative negotiation structures for a previous domain: travel-shopping in a trading agent competitio

Suggested Citation

  • Grosof, Benjamin & Reeves, Daniel & Wellman, Michael, 2002. "Automated Negotiation from Declarative Contract Descriptions," Working papers 4188-01, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:1768
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/1768
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    2. Fernando Branco, 1997. "The Design of Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 28(1), pages 63-81, Spring.
    3. Wurman, Peter R. & Wellman, Michael P. & Walsh, William E., 2001. "A Parametrization of the Auction Design Space," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 304-338, April.
    4. Alvin E. Roth & Axel Ockenfels, 2000. "Last Minute Bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from a Natural Experiment on the Internet," NBER Working Papers 7729, National Bureau of Economic Research, Inc.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S. Meij & L.-F. Pau, 2006. "Auctioning Bulk Mobile Messages," Computational Economics, Springer;Society for Computational Economics, vol. 27(2), pages 395-430, May.
      • Meij, S. & Pau, L-F. & van Heck, H.W.G.M., 2003. "Auctioning Bulk Mobile Messages," ERIM Report Series Research in Management ERS-2003-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Michael Ströbel & Markus Stolze, 2002. "A Matchmaking Component for the Discovery of Agreement and Negotiation Spaces in Electronic Markets," Group Decision and Negotiation, Springer, vol. 11(2), pages 165-181, March.
    3. Grosof, Benjamin & Poon, Terrence C., 2003. "SweetDeal: Representing Agent Contracts With Exceptions using XML Rules, Ontologies, and Process Descriptions," Working papers 4424-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peters, Michael & Severinov, Sergei, 2006. "Internet auctions with many traders," Journal of Economic Theory, Elsevier, vol. 130(1), pages 220-245, September.
    2. Teich, Jeffrey E. & Wallenius, Hannele & Wallenius, Jyrki & Koppius, Otto R., 2004. "Emerging multiple issue e-auctions," European Journal of Operational Research, Elsevier, vol. 159(1), pages 1-16, November.
    3. Marta Stryszowska, 2004. "Late and Multiple Bidding in Competing Second Price," Working Papers 2004.16, Fondazione Eni Enrico Mattei.
    4. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    5. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    6. Hongpeng Guo & Zhihao Lv & Junyi Hua & Hongxu Yuan & Qingyu Yu, 2021. "Design of Combined Auction Model for Emission Rights of International Forestry Carbon Sequestration and Other Pollutants Based on SMRA," Sustainability, MDPI, vol. 13(20), pages 1-18, October.
    7. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    8. Bogetoft, Peter & Nielsen, Kurt, 2003. "Yardstick Based Procurement Design In Natural Resource Management," 2003 Annual Meeting, August 16-22, 2003, Durban, South Africa 25910, International Association of Agricultural Economists.
    9. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2025. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," The Review of Economics and Statistics, MIT Press, vol. 107(1), pages 1-13, January.
    10. Awaya, Yu & Fujiwara, Naoki & Szabo, Marton, 2025. "Quality and price in scoring auctions," Journal of Mathematical Economics, Elsevier, vol. 116(C).
    11. Rasmusen Eric Bennett, 2006. "Strategic Implications of Uncertainty over One's Own Private Value in Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 6(1), pages 1-24, November.
    12. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    13. John Asker & Estelle Cantillon, 2008. "Properties of scoring auctions," RAND Journal of Economics, RAND Corporation, vol. 39(1), pages 69-85, March.
    14. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    15. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    16. Ravi Bapna & Paulo Goes & Alok Gupta, 2003. "Analysis and Design of Business-to-Consumer Online Auctions," Management Science, INFORMS, vol. 49(1), pages 85-101, January.
    17. Celentani, Marco & Ganuza, Juan-Jose, 2002. "Corruption and competition in procurement," European Economic Review, Elsevier, vol. 46(7), pages 1273-1303, July.
    18. Martin Bichler & Pasha Shabalin & Jürgen Wolf, 2013. "Do core-selecting Combinatorial Clock Auctions always lead to high efficiency? An experimental analysis of spectrum auction designs," Experimental Economics, Springer;Economic Science Association, vol. 16(4), pages 511-545, December.
    19. Damian R. Beil & Lawrence M. Wein, 2009. "A Pooling Analysis of Two Simultaneous Online Auctions," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 33-51, October.
    20. Peng Hao & Jun-Peng Guo & Eoghan O’Neill & Yong-Heng Shi, 2023. "When Will First-Price Work Well? The Impact of Anti-Corruption Rules on Photovoltaic Power Generation Procurement Auctions," Sustainability, MDPI, vol. 15(4), pages 1-24, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:1768. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None The email address of this maintainer does not seem to be valid anymore. Please ask None to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.