Spanning tree modulus for secure broadcast games
From MaRDI portal
Abstract: The theory of -modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, -modulus has an interesting probabilistic interpretation. In particular, the -modulus problem in this case has been shown to be equivalent to the problem of finding a probability distribution on spanning trees that utilizes the edges of the graph as evenly as possible. In the present work, we use this fact to produce a game-theoretic interpretation of modulus by employing modulus to solve a secure broadcast game.
Cites work
- Blocking duality for \(p\)-modulus on networks and applications
- Circle packings and combinatorial moduli
- Design of network topology in an adversarial environment
- Equilibrium points in n -person games
- Game-theoretic robustness of many-to-one networks
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- Modulus on graphs as a generalization of standard graph theoretic quantities
- On the spanning tree polyhedron
- Optimal attack and reinforcement of a network
- Quantifying network topology robustness under budget constraints: general model and computational complexity
- Security games on matroids
- Square tilings with prescribed combinatorics
- The extremal length of a network
- Towards a metric for communication network vulnerability to attacks: a game theoretic approach
Cited in
(5)
This page was built for publication: Spanning tree modulus for secure broadcast games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092624)
