Approximations of pseudo-Boolean functions; applications to game theory

Approximations of pseudo-Boolean functions; applications to game theory

0.00 Avg rating0 Votes
Article ID: iaor19921441
Country: Germany
Volume: 36
Start Page Number: 3
End Page Number: 21
Publication Date: Feb 1992
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

This paper studies the approximation of pseudo-Boolean functions by linear functions and more generally by functions of (at most) a specified degree. Here a pseudo-Boolean function means a real valued function defined in {0,1}n, and its degree is that of the unique multilinear polynomial that expresses it; linear functions are those of degree at most one. The approximation consists in choosing among all linear functions the one which is closest to a given function, where distance is measured by the Euclidean metric on R2n. A characterization of the best linear approximation is obtained in terms of the average value of the function and its first derivatives. This leads to an explicit formula for computing the approximation from the polynomial expression of the given function. These results are later generalized to handle approximations of higher degrees, and further results are obtained regarding the interaction of approximations of different degrees. For the linear case, a certain constrained version of the approximation problem is also studied. Special attention is given to some important properties of pseudo-Boolean functions and the extent to which they are preserved in the approximation. A separate section points out the relevance of linear approximations to game theory and shows that the well known Banzhaf power index and Shapley value are obatined as best linear approximations of the game (each in a suitably defined sense).

Reviews

Required fields are marked *. Your email address will not be published.