Fractionally subadditive

A set function is called fractionally subadditive (or XOS) if it is the maximum of several additive set functions. This valuation class was defined, and termed XOS, by Noam Nisan, in the context of combinatorial auctions.^[1] The term fractionally-subadditive was given by Uriel Feige.^[2]

Definition

There is a finite base set of items, $M:=\{1,\ldots ,m\}$ .

There is a function $v$ which assigns a number to each subset of $M$ .

The function $v$ is called fractionally-subadditive (or XOS) if there exists a collection of set functions, $\{a_{1},\ldots ,a_{l}\}$ , such that:^[3]

Each $a_{j}$ is additive, i.e., it assigns to each subset $X\subseteq M$ , the sum of the values of the items in $X$ .
The function $v$ is the pointwise maximum of the functions $a_{j}$ . I.e, for every subset $X\subseteq M$ :

v(X)=\max _{j=1}^{l}a_{j}(X)

Relation to other utility functions

Every submodular set function is XOS, and every XOS function is a subadditive set function.^[1]

References

1 2 Nisan, Noam (2000). "Bidding and allocation in combinatorial auctions". Proceedings of the 2nd ACM conference on Electronic commerce - EC '00. p. 1. ISBN 1581132727. doi:10.1145/352871.352872.
↑ Feige, Uriel (2009). "On Maximizing Welfare when Utility Functions Are Subadditive". SIAM Journal on Computing. 39: 122. doi:10.1137/070680977.
↑ Christodoulou, George; Kovács, Annamária; Schapira, Michael (2016). "Bayesian Combinatorial Auctions". Journal of the ACM. 63 (2): 1. doi:10.1145/2835172.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.