Research map / Learning theory and algorithms / Submodular and game algorithms
Hiding in Multilayer Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use centrality measures based on the entire multilayer topology instead of evaluating each layer separately | Strategic hiding in multilayer networks · Multilayer networks | robustness to strategic manipulation | Helped |
| Use degree centrality for global hiding rather than closeness or betweenness centrality | Multilayer Global Hiding · Multilayer networks | computational complexity: P vs NP-complete | Helped |
| Use the greedy algorithm for degree-based local hiding | Maximum Multilayer Local Hiding · Multilayer networks | approximation ratio: 2-approximation | Helped |
Closest papers by meaning
- Multi-Winner Contests for Strategic Diffusion in Social Networks (AAAI 2019 · similarity 0.86)
- Coverage Centrality Maximization in Undirected Networks (AAAI 2019 · similarity 0.85)
- Axiomatic Characterization of Game-Theoretic Network Centralities (AAAI 2017 · similarity 0.85)
- Demystifying Uneven Vulnerability of Link Stealing Attacks against Graph Neural Networks (ICML 2023 · similarity 0.84)
- Eliminating Majority Illusion Is Easy (AAAI 2025 · similarity 0.84)
- Link Prediction in Multilayer Networks via Cross-Network Embedding (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.