33,721 research outputs found

    SOLACE: A framework for electronic negotiations

    Get PDF
    Copyright @ 2011 Walter de Gruyter GmbHMost existing frameworks for electronic negotiations today are tied to specific negotiation systems for which they were developed, preventing them from being applied to other negotiation scenarios. Thus, the evaluation of electronic negotiation systems is difficult as each one is based on a different framework. Additionally, each developer has to design a new framework for any system to be developed, leading to a ‘reinvention of the wheel’. This paper presents SOLACE—a generic framework for multi-issue negotiations, which can be applied to a variety of negotiation scenarios. In contrast with other frameworks for electronic negotiations, SOLACE supports hybrid systems in which the negotiation participants can be humans, agents or a combination of the two. By recognizing the importance of strategies in negotiations and incorporating a time attribute in negotiation proposals, SOLACE enhances existing approaches and provides a foundation for the flexible electronic negotiation systems of the future

    Acceptance conditions in automated negotiation

    No full text
    In every negotiation with a deadline, one of the negotiating parties has to accept an offer to avoid a break off. A break off is usually an undesirable outcome for both parties, therefore it is important that a negotiator employs a proficient mechanism to decide under which conditions to accept. When designing such conditions one is faced with the acceptance dilemma: accepting the current offer may be suboptimal, as better offers may still be presented. On the other hand, accepting too late may prevent an agreement from being reached, resulting in a break off with no gain for either party. Motivated by the challenges of bilateral negotiations between automated agents and by the results and insights of the automated negotiating agents competition (ANAC), we classify and compare state-of-the-art generic acceptance conditions. We focus on decoupled acceptance conditions, i.e. conditions that do not depend on the bidding strategy that is used. We performed extensive experiments to compare the performance of acceptance conditions in combination with a broad range of bidding strategies and negotiation domains. Furthermore we propose new acceptance conditions and we demonstrate that they outperform the other conditions that we study. In particular, it is shown that they outperform the standard acceptance condition of comparing the current offer with the offer the agent is ready to send out. We also provide insight in to why some conditions work better than others and investigate correlations between the properties of the negotiation environment and the efficacy of acceptance condition

    The first automated negotiating agents competition (ANAC 2010)

    No full text
    Motivated by the challenges of bilateral negotiations between people and automated agents we organized the first automated negotiating agents competition (ANAC 2010). The purpose of the competition is to facilitate the research in the area bilateral multi-issue closed negotiation. The competition was based on the Genius environment, which is a General Environment for Negotiation with Intelligent multi-purpose Usage Simulation. The first competition was held in conjunction with the Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-10) and was comprised of seven teams. This paper presents an overview of the competition, as well as general and contrasting approaches towards negotiation strategies that were adopted by the participants of the competition. Based on analysis in post--tournament experiments, the paper also attempts to provide some insights with regard to effective approaches towards the design of negotiation strategies

    An Evolutionary Learning Approach for Adaptive Negotiation Agents

    Get PDF
    Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially complex negotiation spaces, tough deadlines, very limited information about the opponents, and volatile negotiator preferences. Accordingly, practical negotiation systems should be empowered by effective learning mechanisms to acquire dynamic domain knowledge from the possibly changing negotiation contexts. This paper illustrates our adaptive negotiation agents which are underpinned by robust evolutionary learning mechanisms to deal with complex and dynamic negotiation contexts. Our experimental results show that GA-based adaptive negotiation agents outperform a theoretically optimal negotiation mechanism which guarantees Pareto optimal. Our research work opens the door to the development of practical negotiation systems for real-world applications

    Automated Negotiation for Provisioning Virtual Private Networks Using FIPA-Compliant Agents

    No full text
    This paper describes the design and implementation of negotiating agents for the task of provisioning virtual private networks. The agents and their interactions comply with the FIPA specification and they are implemented using the FIPA-OS agent framework. Particular attention is focused on the design and implementation of the negotiation algorithms

    Efficient Methods for Automated Multi-Issue Negotiation: Negotiating over a Two-Part Tariff

    No full text
    In this article, we consider the novel approach of a seller and customer negotiating bilaterally about a two-part tariff, using autonomous software agents. An advantage of this approach is that win-win opportunities can be generated while keeping the problem of preference elicitation as simple as possible. We develop bargaining strategies that software agents can use to conduct the actual bilateral negotiation on behalf of their owners. We present a decomposition of bargaining strategies into concession strategies and Pareto-efficient-search methods: Concession and Pareto-search strategies focus on the conceding and win-win aspect of bargaining, respectively. An important technical contribution of this article lies in the development of two Pareto-search methods. Computer experiments show, for various concession strategies, that the respective use of these two Pareto-search methods by the two negotiators results in very efficient bargaining outcomes while negotiators concede the amount specified by their concession strategy

    Now or never: negotiating efficiently with unknown counterparts

    Get PDF
    We define a new protocol rule, Now or Never (NoN), for bilateral negotiation processes which allows self-motivated competitive agents to efficiently carry out multi-variable negotiations with remote untrusted parties, where privacy is a major concern and agents know nothing about their opponent. By building on the geometric concepts of convexity and convex hull, NoN ensures a continuous progress of the negotiation, thus neutralising malicious or inefficient opponents. In par- ticular, NoN allows an agent to derive in a finite number of steps, and independently of the behaviour of the opponent, that there is no hope to find an agreement. To be able to make such an inference, the interested agent may rely on herself only, still keeping the highest freedom in the choice of her strategy. We also propose an actual NoN-compliant strategy for an automated agent and evaluate the computational feasibility of the overall approach on instances of practical size

    An Agent-Based Simulation for Water Sharing Between Different Users

    Get PDF
    Water sharing has become a serious problem in France. One of the objectives of 1992 and 2000 directives proposed by the European Union was to reduce both the frequency and the extent of water conflicts through the establishment of multilateral negotiations, where different public and private interests can be represented in a structured institutional environment. In France, many negotiations take place at local level between farmers, water supplies, public services and environmental lists to allocate water resources between users. We suggest that Agent-Based Modelling (ABM) using a multi-agent approach could help negotiations between different players by showing the consequences of water allocation rules and taking in consideration the players' respective attitudes and their ability to change their behaviour.Multiagent-based simulation, user and agent modelling, conflict resolution and negotiation, irrigation application, Resource /Energy Economics and Policy,
    • 

    corecore