Spanning tree modulus for secure broadcast games. Issue 3 (21st April 2020)

• Record Type: Journal Article
• Authors: Albin, Nathan; Kottegoda, Kapila; Poggi‐Corradini, Pietro
• Is Part Of: Networks. Volume 76:Issue 3(2020)
• Page Start: 350
• Page End: 365
• Publication Date: 2020-04-21
• Subjects: broadcast game -- discrete modulus -- game theory -- network security -- optimization -- spanning trees; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21945
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: The theory of p ‐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, p ‐modulus has an interesting probabilistic interpretation. In particular, the 2‐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 fairly 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.