{'fraction_non_alphanumeric': 0.012928248222365869, 'fraction_numerical': 0.0, 'mean_word_length': 5.142857142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Degree Measure as Utility Function over Positions in Networks

In this paper, we connect the social network theory on centrality measures to the economic theory of preferences and utility. Using the fact that networks form a special class of cooperative TU-games, we provide a foundation for the degree measure as a von Neumann-Morgenstern expected utility function reflecting preferences over being in different positions in different networks. The famous degree measure assigns to every position in a weighted network the sum of the weights of all links with its neighbours. A crucial property of a preference relation over network positions is neutrality to ordinary risk. If a preference relation over network positions satisfies this property and some regularity properties, then it must be represented by a utility function that is a multiple of the degree centrality measure. We show this in three steps. First, we characterize the degree measure as a centrality measure for weighted networks using four natural axioms. Second, we relate these network centrality axioms to properties of preference relations over positions in networks. Third, we show that the expected utility function is equal to a multiple of the degree measure if and only if it represents a regular preference relation that is neutral to ordinary risk. Similarly, we characterize a class of affine combinations of the outdegree and indegree measure in weighted directed networks and deliver its interpretation as a von Neumann-Morgenstern expected utility function.