IEEE/CAA Journal of Automatica Sinica
Citation: | J. Chen, K. Y. Luo, C. B. Tang, Z. Zhang, and X. Li, “Optimizing polynomial-time solutions to a network weighted vertex cover game,” IEEE/CAA J. Autom. Sinica, vol. 10, no. 2, pp. 512–523, Feb. 2023. doi: 10.1109/JAS.2022.105521 |
[1] |
E. Xu, Z. Ding, and S. Dasgupta, “Target tracking and mobile sensor navigation in wireless sensor networks,” IEEE Trans. Mobile Computing, vol. 12, no. 1, pp. 177–186, Jan. 2013. doi: 10.1109/TMC.2011.262
|
[2] |
N. Nguyen and B. Liu, “The mobile sensor deployment problem and the target coverage problem in mobile wireless sensor networks are NP-Hard,” IEEE Systems Journal, vol. 13, no. 2, pp. 1312–1315, Jun. 2019. doi: 10.1109/JSYST.2018.2828879
|
[3] |
Y. Yang, L. Liao, H. Yang, and S. Li, “An optimal control strategy for multi-UAVs target tracking and cooperative competition,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 12, pp. 1931–1947, Dec. 2021.
|
[4] |
N. Xiao, X. Wang, L. Xie, T. Wongpiromsarn, E. Frazzoli, and D. Rus, “Road pricing design based on game theory and multi-agent consensus,” IEEE/CAA J. Autom. Sinica, vol. 1, no. 1, pp. 31–39, Jan. 2014. doi: 10.1109/JAS.2014.7004617
|
[5] |
D. Cheng, T. Xu, F. He, and H. Qi, “On dynamics and Nash equilibriums of networked games,” IEEE/CAA J. Autom. Sinica, vol. 1, no. 1, pp. 10–18, Jan. 2014. doi: 10.1109/JAS.2014.7004614
|
[6] |
X. Liu, X. Zhang, and V. Venkatasubramanian, “Distributed voltage security monitoring in large power systems using synchrophasors,” IEEE Trans. Smart Grid, vol. 7, no. 2, pp. 982–991, Mar. 2016. doi: 10.1109/TSG.2015.2410219
|
[7] |
X. Wang, Z. Zhao, D. Xu, Z. Zhang, Q. Hao, and M. Liu, “An M-cache-based security monitoring and fault recovery architecture for embedded processor,” IEEE Trans. Very Large Scale Integration (VLSI)Systems, vol. 28, no. 11, pp. 2314–2327, Nov. 2020. doi: 10.1109/TVLSI.2020.3021533
|
[8] |
F. Li, R. Xie, Z. Wang, L. Guo, J. Ye, P. Ma, and W. Song,, “Online distributed IoT security monitoring with multidimensional streaming big data,” IEEE Internet of Things J., vol. 7, no. 5, pp. 4387–4394, May 2020. doi: 10.1109/JIOT.2019.2962788
|
[9] |
X. Song and Y. Li, “Data gathering in wireless sensor networks via regular low density parity check matrix,” IEEE/CAA J. Autom. Sinica, vol. 5, no. 1, pp. 83–91, Jan. 2018. doi: 10.1109/JAS.2017.7510448
|
[10] |
M. Usman, M. A. Jan, X. He, and J. Chen, “A mobile multimedia data collection scheme for secured wireless multimedia sensor networks,” IEEE Trans. Network Science and Engineering, vol. 7, no. 1, pp. 274–284, Jan. 2020. doi: 10.1109/TNSE.2018.2863680
|
[11] |
J. A. Ansere, G. Han, L. Liu, Y. Peng, and M. Kamal, “Optimal resource allocation in energy-efficient internet-of-things networks with imperfect CSI,” IEEE Internet of Things J., vol. 7, no. 6, pp. 5401–5411, Jun. 2020. doi: 10.1109/JIOT.2020.2979169
|
[12] |
H. Wu, X. Liu, L. Fu, and X. Wang, “Energy-efficient and robust tensor-encoder for wireless camera networks in Internet of Things,” IEEE Trans. Network Science and Engineering, vol. 6, no. 4, pp. 646–656, Oct. 2019. doi: 10.1109/TNSE.2018.2865511
|
[13] |
M. Dai, J. Li, Z. Su, W. Chen, Q. Xu, and S. Fu, “A privacy preservation based scheme for task assignment in Internet of Things,” IEEE Trans. Network Science and Engineering, vol. 7, no. 4, pp. 2323–2335, Oct. 2020. doi: 10.1109/TNSE.2020.2970767
|
[14] |
S. Taoka and T. Watanabe, “Performance comparison of approximation algorithms for the minimum weight vertex cover problem,” in Proc. IEEE Int. Symp. Circuits and Systems, Seoul, Korea (South), 2012. pp. 632−635,
|
[15] |
J. Zhou, Z. Cao, X. Dong, N. Xiong, and A. Vasilakosd, “4S: A secure and privacy-preserving key management scheme for cloud-assisted wireless body area network in m-healthcare social networks,” Information Sciences, vol. 314, pp. 255–276, 2015. doi: 10.1016/j.ins.2014.09.003
|
[16] |
A. Gondeau, Z. Aouabed, M. Hijri, P. R. Peres-Neto, and V. Makarenkov, “Object weighting: A new clustering approach to deal with outliers and cluster overlap in computational biology,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 18, no. 2, pp. 633−643, 1 2021.
|
[17] |
D. Coppersmith and U. Vishkin, “Solving NP-hard problems in almost trees: Vertex cover,” Discrete Applied Mathematics, vol. 10, no. 1, pp. 27–45, 1985. doi: 10.1016/0166-218X(85)90057-5
|
[18] |
E. Halperin, “Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs,” SIAM J. Computing, vol. 31, no. 5, pp. 1608–1623, 2002. doi: 10.1137/S0097539700381097
|
[19] |
G. Karakostas, “A better approximation ratio for the vertex cover problem,” in Int. Colloquium on Automata, Languages, and Programming. Berlin, Heidelberg: Springer, pp. 1043−1050, 2005.
|
[20] |
F. Yang, N. Wu, Y. Qiao, and R. Su, “Polynomial approach to optimal one-wafer cyclic scheduling of treelike hybrid multi-cluster tools via Petri nets,” IEEE/CAA J. Autom. Sinica, vol. 5, no. 1, pp. 270–280, Jan. 2018. doi: 10.1109/JAS.2017.7510772
|
[21] |
M. Weigt and A. K. Hartmann, “Typical solution time for a vertex covering algorithm on finite-connectivity random graphs,” Physical Review Letters, vol. 86, no. 8, p. 1658, 2001. doi: 10.1103/PhysRevLett.86.1658
|
[22] |
W. Chang, T. Ren, and M. Feng, “Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space,” IEEE Trans. NanoBioscience, vol. 14, no. 1, pp. 121–128, Jan. 2015. doi: 10.1109/TNB.2014.2375356
|
[23] |
S. Khuri and T. Bäck, “An evolutionary heuristic for the minimum vertex cover problem,” in Proc. KI-94 Workshop Genetic Algorithms Within Framework Evolutionary Computation, Saarbrcken, Germany, 1994, pp. 86−90.
|
[24] |
R. Bar-Yehuda and S. Even, “A linear-time approximation algorithm for the weighted vertex cover problem,” J. Algorithms, vol. 2, no. 2, pp. 198–203, 1981. doi: 10.1016/0196-6774(81)90020-1
|
[25] |
R. Niedermeier and P. Rossmanith, “On efficient fixed-parameter algorithms for weighted vertex cover,” J. Algorithms, vol. 47, no. 2, pp. 63–77, 2003. doi: 10.1016/S0196-6774(03)00005-1
|
[26] |
L. E. Blume, “The statistical mechanics of strategic interaction,” Games and Economic Behavior, vol. 5, no. 3, pp. 387–424, 1993. doi: 10.1006/game.1993.1023
|
[27] |
M. A. Nowak and R. M. May, “Evolutionary games and spatial chaos,” Nature, vol. 359, no. 6398, pp. 826–829, 1992. doi: 10.1038/359826a0
|
[28] |
R. B. Myerson, Game Theory: Analysis of Conflict. Cambridge, USA: Harvard University Press, 1991.
|
[29] |
J. F. Nash, “Equilibrium points in n-person games,” Proc. the National Academy of Sciences, vol. 36, no. 1, pp. 48–49, 1950. doi: 10.1073/pnas.36.1.48
|
[30] |
Z. Hu, X. Li, J. Wang, C. Xia, Z. Wang, and M. Perc, “Adaptive reputation promotes trust in social networks,” IEEE Trans. Network Science and Engineering, vol. 8, no. 4, pp. 3087–3098, Dec. 2021. doi: 10.1109/TNSE.2021.3103771
|
[31] |
Y. Zhu, J. Zhang, J. Han, and Z. Chen, “Evolutionary game dynamics based on local intervention in multi-agent systems,” IEEE Trans. Circuits and Systems II: Express Briefs, vol. 68, no. 4, pp. 1293–1297, Apr. 2021.
|
[32] |
R. Gopalakrishnan, J. R. Marden, and A. Wierman, “An architectural view of game theoretic control,” ACM SIGMETRICS Performance Evaluation Review, vol. 38, no. 3, pp. 31–36, 2011. doi: 10.1145/1925019.1925026
|
[33] |
Y. Yang and X. Li, “Towards a snowdrift game optimization to vertex cover of networks,” IEEE Trans. Cybernetics, vol. 43, no. 3, pp. 948–956, Jun. 2013. doi: 10.1109/TSMCB.2012.2218805
|
[34] |
J. Chen and X. Li, “Toward the minimum vertex cover of complex networks using distributed potential games,” Science China: Information Science, 2021, DOI: 10.1007/s11432-021-3291-3.
|
[35] |
C. Tang, A. Li, and X. Li, “Asymmetric game: A silver bullet to weighted vertex cover of networks,” IEEE Trans. Cybernetics, vol. 48, no. 10, pp. 2994–3005, Oct. 2018. doi: 10.1109/TCYB.2017.2754919
|
[36] |
C. Sun, W. Sun, X. Wang, and Q. Zhou, “Potential game theoretic learning for the minimal weighted vertex cover in distributed networking systems,” IEEE Trans. Cybernetics, vol. 49, no. 5, pp. 1968–1978, May 2019. doi: 10.1109/TCYB.2018.2817631
|
[37] |
P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci, vol. 5, no. 1, pp. 17–60, 1960.
|
[38] |
G. Szabó and G. Fath, “Evolutionary games on graphs,” Physics Reports, vol. 446, no. 4–6, pp. 97–216, 2007. doi: 10.1016/j.physrep.2007.04.004
|
[39] |
D. J. Watts and S. H. Strogatz, “Collective dynamics of small world networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. doi: 10.1038/30918
|
[40] |
A. L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. doi: 10.1126/science.286.5439.509
|