• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2854-2874
• /
• 2015

This paper presents a game theoretic approach to analyze the public goods (PGs) allocation in peer-to-peer (p2p) networks. In order to reduce the free-riders and promote the cooperation among peers, we propose an incentive mechanism with cooperation-based game theory. In this paper, we regarded the contributed resources by cooperators as public goods (PGs). We also build the PGs allocation in P2P networks to be the optimization problem, and the optimal solution of PGs allocation satisfies the Bowen-Lindahl-Samuelson equilibrium. Firstly, based on the subscriber mechanism, we analyze the feasibility and prove the validity, which can achieve Nash equilibrium. However, this strategy cannot meet to Bowen-Lindahl-Samuelson equilibrium as the free-riders do not pay with their private goods for consuming the PGs. Secondly, based on the Walker mechanism, we analyze the feasibility and prove the validity for the same allocation problem, which meets to Bowen-Lindahl-Samuelson equilibrium and achieves Pareto efficiency within cooperative game. Simulations show that the proposed walker mechanism can significantly improve the network performance of throughout, and effectively alleviate free-riding problem in P2P networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5260-5275
• /
• 2019

In the process of constructing the traditional offensive and defensive game theory model, these are some shortages for considering the dynamic change of security risk problem. By analysing the critical indicators of the incomplete information game theory model, incomplete information attack and defense game theory model and the mathematical engineering method for solving Bayes-Nash equilibrium, the risk-averse income function for information assets is summarized as the problem of maximising the return of the equilibrium point. To obtain the functional relationship between the optimal strategy combination of the offense and defense and the information asset security probability and risk probability. At the same time, the offensive and defensive examples are used to visually analyse and demonstrate the incomplete information game and the Harsanyi conversion method. First, the incomplete information game and the Harsanyi conversion problem is discussed through the attack and defense examples and using the game tree. Then the strategy expression of incomplete information static game and the engineering mathematics method of Bayes-Nash equilibrium are given. After that, it focuses on the offensive and defensive game problem of unsafe information network based on risk aversion. The problem of attack and defense is obtained by the issue of maximizing utility, and then the Bayes-Nash equilibrium of offense and defense game is carried out around the security risk of assets. Finally, the application model in network security penetration and defense is analyzed by designing a simulation example of attack and defense penetration. The analysis results show that the constructed income function model is feasible and practical.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.467-478
• /
• 2016

In this paper, we propose an Ishikawa-type extra-gradient iterative algorithm for finding a solution of split feasibility, fixed point problems and equilibrium problems of quasi-nonexpansive mappings. It is proven that under suitable conditions, the sequences generated by the proposed iterative algorithms converge weakly to a solution of the split feasibility, fixed point problems and equilibrium problems. An example is given to illustrate the main result of this paper.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.161-173
• /
• 2009

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.

• Communications of the Korean Mathematical Society
• /
• v.27 no.3
• /
• pp.505-512
• /
• 2012

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mappings and nonspreading mappings and the set of solution of an equilibrium problem on the setting of real Hilbert spaces.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.303-314
• /
• 2013

In this paper, we introduce an iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem and the set of common fixed points of a finite family of asymptotically ${\kappa}$-strict pseudo-contractions in Hilbert spaces. Weak and strong convergence theorems are established for the iterative scheme.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.599-605
• /
• 2010

In this paper, we introduce an iterative method for finding a common element of the set of solutions of an equilibrium problem, the set of common fixed points of an asymptotically strictly pseudocontractive mapping in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the two sets.

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.765-777
• /
• 2016

In this paper, we propose a new modied Ishikawa iteration for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of 2-generalized hybrid mappings in a Hilbert space. Our results generalize and improve some existing results in the literature. A numerical example is given to illustrate the usability of our results.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.2
• /
• pp.337-363
• /
• 2023

In this paper, we propose a new subgradient extragradient algorithm for finding a solution of monotone bilevel equilibrium problem in reflexive Banach spaces. The strong convergence of the algorithm is established under monotone assumptions of the cost bifunctions with Bregman Lipschitz-type continuous condition. Finally, a numerical experiments is reported to illustrate the efficiency of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.577-585
• /
• 2022

In this work, we introduced and study vector equilibrium problems for trifunction in measurable space (for short, VEPMS). The existence of solutions of (VEPMS) are obtained by employing Aumann theorem and Fan KKM lemma. As an application, we prove an existence result for vector variational inequality problem for measurable space. Our results in this paper are new which can be considered as significant extension of previously known results in the literature.