![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Auction and Negotiation Technology This paper presents new multi-agent negotiation models for electronic commerce. These models address M-N-P negotiation Problems, i.e. negotiations between m buyers and n Sellers for buying p dependent products or services. These products or services are not necessarily provided by the same seller. We propose two new negotiation protocols as well as algorithms describing the behaviors of Seller and buyer agents. ![]() DiSC'03 © 2003 Association for Computing Machinery |