Computational grids （CGs） aim to offer pervasive access to a diverse collection of geographically distributed resources owned by different serf-interested agents or organizations. These agents may manipulate the res...Computational grids （CGs） aim to offer pervasive access to a diverse collection of geographically distributed resources owned by different serf-interested agents or organizations. These agents may manipulate the resource allocation algorithm in their own benefit, and their selfish behavior may lead to severe performance degradation and poor efficiency. In this paper, game theory is introduced to solve the problem of barging for resource collection in heterogeneous distributed systems. By using the Cournot model that is an important model in static and complete information games, the algorithm is optimized in order to maximize the benefit. It can be seen that the approach is more suitable to the real situation and has practical use. Validity of the solutions is shown.展开更多
In this paper,we investigate the obnoxious facility location game with weighted agents.First,we design a randomized group strategy-proof mechanism with approximation ratio 3Wmax 2Wmin when the weighted agents are loca...In this paper,we investigate the obnoxious facility location game with weighted agents.First,we design a randomized group strategy-proof mechanism with approximation ratio 3Wmax 2Wmin when the weighted agents are located on a line;then,on the cycle metric,we also discuss the strategy-proofness and the approximation ratios of a class of group strategy-proof deterministic mechanisms.展开更多
基金Project supported by the Science Foundation of Shanghai Municipal Commission of Science and Technology(Grant No.00JC14052)
文摘Computational grids （CGs） aim to offer pervasive access to a diverse collection of geographically distributed resources owned by different serf-interested agents or organizations. These agents may manipulate the resource allocation algorithm in their own benefit, and their selfish behavior may lead to severe performance degradation and poor efficiency. In this paper, game theory is introduced to solve the problem of barging for resource collection in heterogeneous distributed systems. By using the Cournot model that is an important model in static and complete information games, the algorithm is optimized in order to maximize the benefit. It can be seen that the approach is more suitable to the real situation and has practical use. Validity of the solutions is shown.
基金the National Natural Science Foundation of China(No.61365013)the Natural Science Foundation of Jiangxi Province(Nos.20142BAB211020 and 20142BAB211004).
文摘In this paper,we investigate the obnoxious facility location game with weighted agents.First,we design a randomized group strategy-proof mechanism with approximation ratio 3Wmax 2Wmin when the weighted agents are located on a line;then,on the cycle metric,we also discuss the strategy-proofness and the approximation ratios of a class of group strategy-proof deterministic mechanisms.
