Defending Against Man-In-The-Middle Attack in Repeated Games
Authors: Shuxin Li, Xiaohong Li, Jianye Hao, Bo An, Zhiyong Feng, Kangjie Chen, Chengwei Zhang
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Simulation results show that the algorithms are able to converge to Nash equilibrium strategy efficiently. |
| Researcher Affiliation | Academia | 1 School of Computer Science and Technology, Tianjin University, China 2 School of Computer Software, Tianjin University, China 3 School of Computer Science and Engineering, Nanyang Technological University, Singapore 4 Tianjin International Engineering Institute, Tianjin University, China |
| Pseudocode | Yes | Algorithm 1 The learning algorithm of port i |
| Open Source Code | No | The paper does not provide any specific links or explicit statements about the release of source code for the described methodology. |
| Open Datasets | No | The paper defines simulation parameters and distributions (e.g., values for v and c, power law distribution for information value) rather than utilizing or providing access to a pre-existing public dataset. |
| Dataset Splits | No | The paper does not specify dataset split percentages, sample counts, or refer to predefined splits for training, validation, or testing in the traditional machine learning sense. |
| Hardware Specification | No | The paper does not provide specific hardware details such as CPU/GPU models, processor types, or memory specifications used for running the experiments. |
| Software Dependencies | No | The paper does not list specific software dependencies with version numbers (e.g., libraries, frameworks, or solvers) used for the implementation. |
| Experiment Setup | Yes | In the following experiments, all the results are averaged over 100 runs. For the sake of exposition, we start with a simple case of two users and one attacker who can only attack a single user. In this case, we consider the following two situations. 1) We assume that the profiles of two users are the same. The values of v and c are defined as follows: v1 = v2 = 2, c1 = c2 = 1. ... 2) Next, we consider the case of two different users. Let v1 = 1, v2 = 2, c1 = 1 and c2 = 2. ... Next, we consider a general case in which there are eight users and one attacker who can attack two users at the same time. |