Spanning tree modulus for secure broadcast games

DOI10.1002/net.21945arXiv1904.03962OpenAlexW3020515439MaRDI QIDQ6092624

Nathan Albin, Pietro Poggi-Corradini, Unnamed Author

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.03962

zbMATH Keywords

optimizationgame theorynetwork securityspanning treesdiscrete modulusbroadcast game

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Security games on matroids
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Circle packings and combinatorial moduli
• On the spanning tree polyhedron
• The extremal length of a network
• Square tilings with prescribed combinatorics
• Blocking duality for \(p\)-modulus on networks and applications
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Game-theoretic Robustness of Many-to-one Networks
• Towards a Metric for Communication Network Vulnerability to Attacks: A Game Theoretic Approach
• Design of Network Topology in an Adversarial Environment
• Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity
• Optimal attack and reinforcement of a network
• Equilibrium points in n -person games

This page was built for publication: Spanning tree modulus for secure broadcast games