Sciweavers

Share
CIA
2000
Springer

Auction-Based Agent Negotiation via Programmable Tuple Spaces

10 years 1 months ago
Auction-Based Agent Negotiation via Programmable Tuple Spaces
Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and services. The aim of this paper is to show how auction mechanisms on the Internet can be easily implemented by using programmable tuple spaces. Tuple spaces are shared repositories of information that follow the Linda model; the addition of programmability permits to adapt the tuple space behaviour to the application-specific requirements via reactions. In the implementation of auctions, programmable reactivity is exploited to uncouple the actual auction mechanisms from the selling and bidding policies of the participant agents. Keyword: Internet, Auctions, Coordination, Tuple Spaces.
Giacomo Cabri, Letizia Leonardi, Franco Zambonelli
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where CIA
Authors Giacomo Cabri, Letizia Leonardi, Franco Zambonelli
Comments (0)
books