IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/1768.html
   My bibliography  Save this paper

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. 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.
    3. 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.
    4. Fernando Branco, 1997. "The Design of Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 28(1), pages 63-81, Spring.
    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. Marta Stryszowska, 2004. "Late and Multiple Bidding in Competing Second Price," Working Papers 2004.16, Fondazione Eni Enrico Mattei.
    3. 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.
    4. 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.
    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. Andrea Attar & Thomas Mariotti & François Salanié, 2021. "Entry-Proofness and Discriminatory Pricing under Adverse Selection," American Economic Review, American Economic Association, vol. 111(8), pages 2623-2659, August.
    7. 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.
    8. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    9. Iftekhar, M. S. & Tisdell, J. G., 2018. "Learning in repeated multiple unit combinatorial auctions: An experimental study," Working Papers 267301, University of Western Australia, School of Agricultural and Resource Economics.
    10. 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.
    11. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    12. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    13. 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.
    14. Nicolas Gruyer & Nathalie Lenoir, 2003. "Auctioning airport slots (?)," Post-Print hal-01021718, HAL.
    15. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    16. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    17. Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009. "Winning Play in Spectrum Auctions," NBER Working Papers 14765, National Bureau of Economic Research, Inc.
    18. Stoll, Sebastian & Zöttl, Gregor, 2012. "Information Disclosure in Dynamic Buyer-Determined Procurement Auctions: An Empirical Study," VfS Annual Conference 2012 (Goettingen): New Approaches and Challenges for the Labor Market of the 21st Century 62044, Verein für Socialpolitik / German Economic Association.
    19. Marco A. Haan & Linda A. Toolsema, 2011. "License Auctions When Winning Bids Are Financed Through Debt," Journal of Industrial Economics, Wiley Blackwell, vol. 59(2), pages 254-281, June.
    20. Katkar Rama & Reiley David H, 2007. "Public versus Secret Reserve Prices in eBay Auctions: Results from a Pokémon Field Experiment," The B.E. Journal of Economic Analysis & Policy, De Gruyter, vol. 6(2), pages 1-25, January.

    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 (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.