Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Co-evolutionary Auction Mechanism Design: A Preliminary Report
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Envy-free auctions for digital goods
Proceedings of the 4th ACM conference on Electronic commerce
Multi-Issue Negotiation Processes by Evolutionary Simulation, Validationand Social Extensions
Computational Economics
An overview of cooperative and competitive multiagent learning
LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
| Hi-index | 0.00 |
Negotiations are an important way of reaching agreements between selfish autonomous agents. In this paper we focus on one-to-many bargaining within the context of agent-mediated electronic commerce. We consider an approach where a seller agent negotiates over multiple interdependent attributes with many buyer agents in a bilateral fashion. In this setting, "fairness," which corresponds to the notion of envy-freeness in auctions, may be an important business constraint. For the case of virtually unlimited supply (such as information goods), we present a number of one-to-many bargaining strategies for the seller agent, which take into account the fairness constraint, and consider multiple attributes simultaneously. We compare the performance of the bargaining strategies using an evolutionary simulation, especially for the case of impatient buyers. Several of the developed strategies are able to extract almost all the surplus; they utilize the fact that the setting is one-to-many, even though bargaining is bilateral.