Using partial global plans to coordinate distributed problem solvers
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
With the emergence of global marketing, the development of sales channels becomes critical in terms of competitive advantages. In fact, the co-competition between companies evolves to be increasingly complex. A cooperation project may involve more than just two companies, and sometimes three or more companies are engaged in the decisions in association with co-competition. Meanwhile, each company may have a large number of strategic options. Therefore, this paper applies the game theory and combines it with the model designed with multiple agents to identify the optimal strategic option acceptable by every participant in the game. A renegotiation system with multiple agents is designed based on the method proposed in this paper so that companies can quickly and effectively identify an outcome acceptable by all the competitors. The agent mechanism not only enhances the efficiency of solutions for equilibrium solutions, but also resolves the problems that no solutions can be derived against the endless loops in the strategic games. It is also able to derive solutions in the most efficient way for the multiple-player, multiple-strategy not presentable on a two-dimension matrix. This approach greatly shortens the time required to compute solutions in the game and enhances negotiation efficiency, in order to generate the strategic combinations with maximum returns for all the competing companies.