Joint utility-maximization problems for multi-agent systems often should be addressed by distributed strategy-selection formulation. Constrained discrete feasible strategy sets, these are broadly formulated as NP-hard combinatorial optimization problems. In many cases, can cast constrained submodular set function maximization problems, which also belong to the domain of A prominent example is p...