The following graph theoretic notion appeared in an [economics paper entitled: "Prize competition under limited comparability,](http://www.homepages.ucl.ac.uk/~uctprsp/framing2.pdf) by Michele Piccione and Ran Spiegler which studies models of economics were the firms are rational but the consumers are not. 

A graph is **weighted-regular** if vertices (nodes) can be assigned positive weights, such that each node has the same total weighted-expected-number of edges (links). Every regular graph is, of course, weighted regular (give all vertices weight 1). A star, tree with center vertex connected to k leaves is weighted-regular: Give the center weight 1 and every leaf weight 1/k.

(In the paper, every vertex is also contained in a loop. Therefore its weight also counts when we compute its weighted-expected-number of edges. The star is still weighted-regular: give weight 1 to the center and weight 0 to the leafs.)

Is there a characterization of weighted-regular graphs? Is this notion known? Does it have known applications or connections?