Towards a quantitative concession-based classification method of negotiation strategies

In order to successfully reach an agreement in a negotiation, both parties rely on each other to make concessions. The willingness to concede also depends in large part on the opponent. A concession by the opponent may be reciprocated, but the negotiation process may also be frustrated if the opponent does not concede at all.This process of concession making is a central theme in many of the classic and current automated negotiation strategies. In this paper, we present a quantitative classification method of negotiation strategies that measures the willingness of an agent to concede against different types of opponents. The method is then applied to classify some well-known negotiating strategies, including the agents of ANAC 2010. It is shown that the technique makes it easy to identify the main characteristics of negotiation agents, and can be used to group negotiation strategies into categories with common negotiation characteristics. We also observe, among other things, that different kinds of opponents call for a different approach in making concession

A Rule-driven Approach for Defining the Behavior of Negotiating Software Agents

One problem with existing agent-mediated negotiation systems is that they rely on ad hoc, static, non-adaptive, and hardcoded schemes to represent the behaviour of agents. This limitation is probably due to the complexity of the negotiation task itself. Indeed, while negotiating, software (human) agents face tough decisions. These decisions are based not only on the information made available by the negotiation server, but on the behaviour of the other participants in the negotiation process as well. The information and the behaviour in question are constantly changing and highly uncertain. In the first part of the paper, we propose a rule-driven approach to represent, manage and explore negotiation strategies and coordination information. For that, we divide the behaviour of negotiating agents into protocols, strategies and coordination. Among the many advantages of the proposed solution, we can cite the high level of abstraction, the closeness to human understanding, the versatility, and the possibility to modify the agents' behaviour during the negotiation process. To validate our solution, we ran many agent tournaments, and used the rule-driven approach to implement bidding strategies that are common in the English and Dutch auctions. We also implemented simple coordination schemes across several auctions. The ongoing validation work is detailed and discussed in the second part of the paper. Un des inconvénients qu'on retrouve fréquemment dans les systèmes de négociation par agents est qu'ils reposent sur des schémas ad-hoc, non adaptatifs et figés dans le code pour représenter le comportement des agents. Cette limitation est probablement due à la complexité de l'activité de négociation elle-même. En effet, au cours de la négociation, les agents logiciels (humains) ont des décisions difficiles à prendre. Ces décisions ne sont pas seulement basées sur l'information disponible sur le serveur de négociation, mais aussi sur le comportement des autres participants durant le processus de négociation. L'information et le comportement en question changent constamment et sont très incertains. Dans la première partie de l'article, nous proposons une approche à base de règles pour représenter, gérer et explorer les stratégies de négociation ainsi que l'information de coordination. Parmi les nombreux avantages de la solution proposée, on peut citer le haut niveau d'abstraction, la proximité avec la compréhension humaine, la souplesse d'utilisation et la possibilité de modifier le comportement des agents durant le processus de négociation. Pour valider notre solution, nous avons effectué plusieurs tournois entre agents et utilisé l'approche à base de règles pour implémenter des stratégies simples applicables à l'enchère anglaise et à l'enchère hollandaise. Nous avons aussi implémenté des schémas simples de coordination impliquant plusieurs enchères. Le travail de validation, en cours, est détaillé et discuté dans la seconde partie de l'article.e-negotiation, online auction, software agent, negotiation strategy, coordination, rule-based system, rule engine, Négociation électronique, enchères en ligne, agents logiciels, stratégie de négociation, coordination, système à base de règles, moteur de règles

It's My Turn ... Please, After You: An Experimental Study of Cooperation and Social Conventions

We introduce a class of two-player cooperation games where each player faces a binary decision, enter or exit. These games have a unique Nash equilibrium of entry. However, entry imposes a large enough negative externality on the other player such that the unique social optimum involves the player with the higher value to entry entering and the other player exiting. When the game is repeated and players' values to entry are private, cooperation admits the form of either taking turns entering or using a cutoff strategy and entering only for high private values of entry. Even with conditions that provide opportunities for unnoticed or non-punishable 'cheating', our empirical analysis including a simple strategy inference technique reveals that the Nash-equilibrium strategy is never the modal choice. In fact, most subjects employ the socially optimal symmetric cutoff strategy. These games capture the nature of cooperation in many economic and social situations such as bidding rings in auctions, competition for market share, labor supply decisions in the face of excess supply, queuing in line and courtship.cooperation, incomplete information, random payoffs, strategy inference, experimental economics.

Simultaneous Decision-Making in Competitive and Cooperative Environments

MWe experimentally investigate simultaneous decision-making in two contrasting environments: a competitive environment (a contest) and a cooperative environment (a voluntary contribution mechanism). We find that the cooperative nature of the voluntary contribution mechanism spills over to the contest, decreasing sub-optimal overbidding in the contest. However, contributions to the public good are not affected by simultaneous participation in the contest. There is a significant negative correlation between decisions made in competitive and cooperative environments, i.e. more cooperative subjects tend to be less competitive and vice versa. This correlation can be rationalized by heterogeneous social preferences towards inequality but not by bounded rationality theory.cooperation, competition, public goods, contests, experiments, behavioral spillover

Cooperation in the Prisoner's Dilemma Game Based on the Second-Best Decision

In the research addressing the prisoner's dilemma game, the effectiveness and accountableness of the method allowing for the emergence of cooperation is generally discussed. The most well-known solutions for this question are memory based iteration, the tag used to distinguish between defector and cooperator, the spatial structure of the game and the either direct or indirect reciprocity. We have also challenged to approach the topic from a different point of view namely that temperate acquisitiveness in decision making could be possible to achieve cooperation. It was already shown in our previous research that the exclusion of the best decision had a remarkable effect on the emergence of an almost cooperative state. In this paper, we advance the decision of our former research to become more explainable by introducing the second-best decision. If that decision is adopted, players also reach an extremely high level cooperative state in the prisoner's dilemma game and also in that of extended strategy expression. The cooperation of this extended game is facilitated only if the product of two parameters is under the criticality. In addition, the applicability of our model to the problem in the real world is discussed.Cooperation, Altruism, Agent-Based Simulation, Evolutionary Game Theory

Transforming Energy Networks via Peer to Peer Energy Trading: Potential of Game Theoretic Approaches

Peer-to-peer (P2P) energy trading has emerged as a next-generation energy management mechanism for the smart grid that enables each prosumer of the network to participate in energy trading with one another and the grid. This poses a significant challenge in terms of modeling the decision-making process of each participant with conflicting interest and motivating prosumers to participate in energy trading and to cooperate, if necessary, for achieving different energy management goals. Therefore, such decision-making process needs to be built on solid mathematical and signal processing tools that can ensure an efficient operation of the smart grid. This paper provides an overview of the use of game theoretic approaches for P2P energy trading as a feasible and effective means of energy management. As such, we discuss various games and auction theoretic approaches by following a systematic classification to provide information on the importance of game theory for smart energy research. Then, the paper focuses on the P2P energy trading describing its key features and giving an introduction to an existing P2P testbed. Further, the paper zooms into the detail of some specific game and auction theoretic models that have recently been used in P2P energy trading and discusses some important finding of these schemes.Comment: 38 pages, single column, double spac

Price Competition and Market Concentration: An experimental Study

The classical price competition model (named after Bertrand), prescribes that in equilibrium prices are equal to marginal costs. Moreover, prices do not depend on the number of competitors. Since this outcome is not in line with real-life observations, it is known as the Bertrand Paradox". Many theoretical problems with the original model have been considered as an explanation of the paradox in the literature. In this paper we experimentally investigate a model which is immune to the theoretical critique of the original model. We find, nevertheless, that the outcome does depend on the number of competitors: the Bertrand solution does not predict well when the number of competitors is two, but after some opportunities for learning are provided it tends to predict well when the number of competitors is three or four. A bounded rationality explanation of this is suggested.Bertrand Model; Price Competition; Boundered Rationality; noise-bidding