Characterization of rankings generated by pseudo-Boolean functions

In this paper we pursue the study of pseudo-Boolean functions as ranking generators. The objective of the work is to find new insights between the relation of the degree m of a pseudo-Boolean function and the rankings that can be generated by these insights. Based on a characterization theorem for pseudo-Boolean functions of degree m, several observations are made. First, we verify that pseudo-Boolean functions of degree m更多