We propose and analyze a broad family of games played by resource-constrained
players, which are characterized by the following central features: 1) each
user has a multi-dimensional action space, subject to a single sum resource
constraint; 2) each user's utility in a particular dimension depends on an
additive coupling between the user's action in the same dimension and the
actions of the other users; and 3) each user's total utility is the sum of the
utilities obtained in each dimension.
For a finite multigraph G, let \Lambda(G) denote the lattice of integer flows
of G -- this is a finitely generated free abelian group with an integer-valued
positive definite bilinear form. Bacher, de la Harpe, and Nagnibeda show that
if G and H are 2-isomorphic graphs then \Lambda(G) and \Lambda(H) are
isometric, and remark that they were unable to find a pair of nonisomorphic
3-connected graphs for which the corresponding lattices are isometric. We
explain this by examining the lattice \Lambda(M) of integer flows of any
regular matroid M.