IDEAS home Printed from https://ideas.repec.org/a/kap/netnom/v1y1999i1p1-9.html
   My bibliography  Save this article

Applying game theory to automated negotiation

Author

Listed:
  • Ken Binmore
  • Nir Vulkan

Abstract

With existing technology, it is already possible for personal agents to schedule meetings for their users, to write the small print of an agreement, and for agents to search the Internet for the cheapest price. But serious negotiation cranks the difficulty of the problem up several notches. In this paper, we review what game theory has to offer in the light of experience gained in programming automated agents within the ADEPT (Advance Decision Environment for Process Tasks) project, which is currently being used by British Telecom for some purposes. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • Ken Binmore & Nir Vulkan, 1999. "Applying game theory to automated negotiation," Netnomics, Springer, vol. 1(1), pages 1-9, October.
    • Handle: RePEc:kap:netnom:v:1:y:1999:i:1:p:1-9
    DOI: 10.1023/A:1011489402739
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1011489402739
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1011489402739?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Großklags, Jens & Schmidt, Carsten & Siegel, Jonathan, 2000. "Dumb software agents on an experimental asset market," SFB 373 Discussion Papers 2000,96, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
    2. D.D.B. Bragt, van & J. A. La Poutr & E. H. Gerding, 2000. "Equilibrium Selection In Evolutionary Bargaining Models," Computing in Economics and Finance 2000 323, Society for Computational Economics.
    3. David van Bragt & Han La Poutré, 2001. "Evolving Automata Play the Alternating-Offers Game," CeNDEF Workshop Papers, January 2001 2B.3, Universiteit van Amsterdam, Center for Nonlinear Dynamics in Economics and Finance.
    4. van Bragt, David & van Kemenade, Cees & la Poutre, Han, 2001. "The Influence of Evolutionary Selection Schemes on the Iterated Prisoner's Dilemma," Computational Economics, Springer;Society for Computational Economics, vol. 17(2-3), pages 253-263, June.
    5. Enrico Gerding & David van Bragt & Han La Poutré, 2003. "Multi-Issue Negotiation Processes by Evolutionary Simulation, Validation and Social Extensions," Computational Economics, Springer;Society for Computational Economics, vol. 22(1), pages 39-63, August.
    6. V. Kumar & Ashutosh Dixit & Rajshekar (Raj) G. Javalgi & Mayukh Dass, 2016. "Research framework, strategies, and applications of intelligent agent technologies (IATs) in marketing," Journal of the Academy of Marketing Science, Springer, vol. 44(1), pages 24-45, January.
    7. Usha Kiruthika & Thamarai Selvi Somasundaram & S. Kanaga Suba Raja, 2020. "Lifecycle Model of a Negotiation Agent: A Survey of Automated Negotiation Techniques," Group Decision and Negotiation, Springer, vol. 29(6), pages 1239-1262, December.
    8. Ivan Marsa-Maestre & Miguel A. Lopez-Carmona & Juan A. Carral & Guillermo Ibanez, 2013. "A Recursive Protocol for Negotiating Contracts Under Non-monotonic Preference Structures," Group Decision and Negotiation, Springer, vol. 22(1), pages 1-43, January.
    9. Fabian Lang & Andreas Fink, 2015. "Learning from the Metaheuristics: Protocols for Automated Negotiations," Group Decision and Negotiation, Springer, vol. 24(2), pages 299-332, March.
    10. Stan van Hoesel & Rudolf Müller, 2001. "Optimization in electronic markets: examples in combinatorial auctions," Netnomics, Springer, vol. 3(1), pages 23-33, June.

    More about this item

    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:kap:netnom:v:1:y:1999:i:1:p:1-9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.