作者: Sarit Kraus , Onn Shehory , Gilad Taase
关键词: Service provider 、 Complete information 、 Protocol (object-oriented programming) 、 Task (project management) 、 Computer science 、 Heuristics 、 Computer security 、 Stochastic game 、 Request for proposal 、 Common knowledge 、 Distributed computing
摘要: Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case Request For Proposal (RFP) domain, some requester business agent issues an RFP - a complex task comprised of sub-tasks several service provider need address this RFP. In such environments value may common knowledge, however costs that incurs for performing specific sub-task unknown other agents. Additionally, time addressing RFPs limited. These constraints make it hard apply traditional coalition mechanisms, since those assume complete information, lesser significance there.To problem, we have developed protocol enables negotiate form coalitions, provide them with simple heuristics choosing partners. The coalitions face incomplete information. overall payoff using our very close experimentally measured optimal value, as extensive experimental evaluation shows.