Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capa...Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capability to deviate the allocation of interests from the equilibrium point. If some firm tries to withdraw from cooperation or threaten to use other particular strategy, the negotiations are likely to achieve the distribution by the threat game; The calculating method of the choice of the optimal bargaining base point and the corresponding optimal pay-off vector are given.展开更多
Haigh's algorithm is a fundamental method for searching ESSs of linear ESS-models. In this paper ESSs are characterized by submatrices of the pay-oof matrix. Then Haigh's algorithm has been improved in the fo...Haigh's algorithm is a fundamental method for searching ESSs of linear ESS-models. In this paper ESSs are characterized by submatrices of the pay-oof matrix. Then Haigh's algorithm has been improved in the following aspects: 1) Some ESSs may be overlooked when Haigh's algorithm is used for searching ESSs. The improved algorithm eliminates this shortage. 2) The improved algorithm is especially favourable to computers. It is valid when the pay-off matrix is stable.展开更多
文摘Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capability to deviate the allocation of interests from the equilibrium point. If some firm tries to withdraw from cooperation or threaten to use other particular strategy, the negotiations are likely to achieve the distribution by the threat game; The calculating method of the choice of the optimal bargaining base point and the corresponding optimal pay-off vector are given.
文摘Haigh's algorithm is a fundamental method for searching ESSs of linear ESS-models. In this paper ESSs are characterized by submatrices of the pay-oof matrix. Then Haigh's algorithm has been improved in the following aspects: 1) Some ESSs may be overlooked when Haigh's algorithm is used for searching ESSs. The improved algorithm eliminates this shortage. 2) The improved algorithm is especially favourable to computers. It is valid when the pay-off matrix is stable.
