A Game Theoretic Resource Allocation Model Based on Extended Second Price Sealed Auction in Grid Computing

Sun, Weifeng; Xia, Qiufen; Xu, Zichuan; Li, Mingchu; Qin, Zhenquan

doi:10.4304/jcp.7.1.65-75

Cited by 15 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experiment employs GridSim [14] simulation toolkit to simulate experiment about the grid resource discovery algorithm BC-DIS and grid resource discovery algorithm based on flooding [15]. Use the JDK and JCreator as a programming environment.…”

Section: The Experimental Evaluationmentioning

confidence: 99%

Grid Resource Discovery Algorithm Based on Distance

Zhang

He²,

Zhang³

2014

JSW

View full text Add to dashboard Cite

Resource discovery in a Grid environment is a critical problem and also a fundamental task which provides searching and locating necessary resources for given processes. Based on the domain and resource routing nodes, a grid resource discovery model of multilayer overlay network is given in this paper. And on this basis, using a linear combination of the block distance and chessboard distance instead of Euclidean distance, grid resource discovery algorithm based on distance is proposed. Experiment shows that the algorithm has low cost, fast response and can obtain better success rate of lookup, as well as the effectiveness of the resource discovery algorithm.

show abstract

Section: The Experimental Evaluationmentioning

confidence: 99%

Grid Resource Discovery Algorithm Based on Distance

Zhang

He²,

Zhang³

2014

JSW

View full text Add to dashboard Cite

show abstract

“…The algorithm was based on a class of games called Bayesian Stackelberg. Sun Weifeng et al [14] proposed a game theoretic resource allocation model in grid computing. The model guaranteed higher tasks' victorious probabilities in grid resources scheduling situations.…”

Section: Related Workmentioning

confidence: 99%

Using Game Theory to Analyze Strategic Choices of Service Providers and Service Requesters

Sun¹,

Huang²,

Ke³

2014

JSW

View full text Add to dashboard Cite

With the rapid development and popularization of Web services, online privacy has become a rising concern. In order to prevent service providers from abusing private information of service requesters, service providers are required to publish their privacy policies. If a service provider's privacy policy is not consistent with a service requester's privacy preference, the provider and the requester can negotiate. Whether the negotiation is successful or not depends on the strategic choices of the provider and the requester. This paper analyzes strategic choices of service providers and service requesters in negotiations by game theory. We propose a game theoretic model for negotiations between providers and requesters, discussing providers' and requesters' strategic choices in one-time negotiation and repeated negotiation. In addition, a case study is given to demonstrate how to use our game theoretic model to analyze the strategic choices of providers and requesters in negotiations.

show abstract

“…In network environment, resource between nodes or service interaction often exhibits a game behavior [16][17][18][19][20][21][22][23]. Automated trust negotiation is a dynamic game process of incomplete information for both parties to exchange certificate or resource, select the appropriate negotiation strategy and be mutually authorized.…”

Section: A Characteristics Of Game For Interactionmentioning

confidence: 99%

Automated Trust Negotiation Model based on Dynamic Game of Incomplete Information

Chen¹,

Shu-ping²,

Xu³

et al. 2013

JSW

View full text Add to dashboard Cite

This paper proposes an automated trust negotiation model based on dynamic game of incomplete information. Through the trust evaluation on the early stage of the consultation process and different processes for trust at the later stage, this paper introduces the thought of dynamic game and establishes an evaluation model based on trust relationship analysis. First of all, through the analysis and comparison, this paper combines the automatic negotiation process and the thought of game, and discusses the trust evaluation factors for the early stage of the negotiation. And then this paper quantifies the privacy value and the trust degree, provides a method of establishing automated process for trust negotiation based on the dynamic game, and finally gives the example analysis and discussion for this model.

show abstract

A Game Theoretic Resource Allocation Model Based on Extended Second Price Sealed Auction in Grid Computing

Cited by 15 publications

References 19 publications

Grid Resource Discovery Algorithm Based on Distance

Grid Resource Discovery Algorithm Based on Distance

Using Game Theory to Analyze Strategic Choices of Service Providers and Service Requesters

Automated Trust Negotiation Model based on Dynamic Game of Incomplete Information

Contact Info

Product

Resources

About