In this paper, jamming and anti-jamming in a time slotted orthogonal frequency division multiple access (OFDMA) are investigated. The users of the network cooperate to mitigate the jamming effect. Interactions among the network users and the jammer are modeled by a mixed integer non-cooperative generalized game which is a NP-hard problem. To relax the problem, a new algorithm is proposed based on channel state information (CSI) to determine the transmission channels and the partners of users in the network. To solve the proposed game, an optimization problem is solved for each player considering the best response of the other player. Another generalized game is proposed to model the cooperation among users of the network. The latter game is transformed to an equivalent Quasi Variational Inequality (QVI). Then, a new gradient based algorithm is proposed by utilizing the Karush-Kuhn-Tucker (KKT) conditions to find the solution of the equivalent QVI. Then, solving the latter game and substituting the best related response, the solution of the former generalized game is also obtained. The convergence of the proposed algorithms, and the uniqueness related to the solution of the both generalized games are proven. Finally, the simulation results confirm the effectiveness of the proposed approach.

本文研究了时隙正交频分多址（OFDMA）中的干扰和抗干扰问题。网络的用户合作以减轻干扰效果。网络用户和干扰者之间的互动是通过混合整数非合作广义博弈建模的，这是一个NP难题。为了缓解该问题，提出了一种基于信道状态信息（CSI）的新算法，用于确定网络中的传输信道和用户的伙伴。为了解决所提出的游戏，考虑到其他玩家的最佳响应，针对每个玩家解决了优化问题。提出了另一种通用游戏来对网络用户之间的合作进行建模。后者的游戏被转换为等效的准变分不等式（QVI）。然后，利用Karush-Kuhn-Tucker（KKT）条件，提出了一种基于梯度的新算法来寻找等效QVI的解。然后，通过求解后一种博弈并替换最佳相关响应，还可以获得前一种广义博弈的解。证明了所提算法的收敛性，以及与两种广义博弈的解有关的唯一性。最后，仿真结果证实了该方法的有效性。