Hiding From Centrality Measures: A Stackelberg Game Perspective-Reference-Cited by-同舟云学术

Hiding From Centrality Measures: A Stackelberg Game Perspective

Author:

Waniek Marcin¹^ORCID,Woźnica Jan²,Zhou Kai³^ORCID,Vorobeychik Yevgeniy⁴^ORCID,Michalak Tomasz P.²^ORCID,Rahwan Talal¹^ORCID

Affiliation:

1. Computer Science, Science Division, New York University Abu Dhabi, Abu Dhabi, UAE

2. University of Warsaw, Warszawa, Poland

3. Hong Kong Polytechnic University, Kowloon, Hong Kong

4. Washington University in St. Louis, St. Louis, MO, USA

Funder

Narodowe Centrum Nauki

National Science Foundation

Army Research Office

National Natural Science Foundation of China

Hong Kong RGC

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems

Link

Reference60 articles.

1. Covert networks: How hard is it to hide;dey;Proc 18th Int Conf Auton Agents MultiAgent Syst,0

2. Neuer beweis eines Satzes über permutationen;prüfer;Archiv der Mathematik und Physik,1918

3. On the construction of covert networks;waniek;Proc 16th Conf Auton Agents Multiagent Syst Int Found Auton Agents Multiagent Syst,0

5. The manipulability of centrality measures-an axiomatic approach;was;Proc 19th Int Conf Auton Agents MultiAgent Syst,0

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

3. Local Centrality Minimization with Quality Guarantees;Proceedings of the ACM Web Conference 2024;2024-05-13