Finance:Fractionally subadditive valuation
A set function is called fractionally subadditive, or XOS (not to be confused with OXS), 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, [math]\displaystyle{ M := \{1,\ldots,m\} }[/math].
There is a function [math]\displaystyle{ v }[/math] which assigns a number to each subset of [math]\displaystyle{ M }[/math].
The function [math]\displaystyle{ v }[/math] is called fractionally subadditive (or XOS) if there exists a collection of set functions, [math]\displaystyle{ \{a_1,\ldots,a_l\} }[/math], such that:[3]
- Each [math]\displaystyle{ a_j }[/math] is additive, i.e., it assigns to each subset [math]\displaystyle{ X\subseteq M }[/math], the sum of the values of the items in [math]\displaystyle{ X }[/math].
- The function [math]\displaystyle{ v }[/math] is the pointwise maximum of the functions [math]\displaystyle{ a_j }[/math]. I.e, for every subset [math]\displaystyle{ X\subseteq M }[/math]:
- [math]\displaystyle{ v(X) = \max_{j=1}^l a_j(X) }[/math]
Equivalent Definition
The name fractionally subadditive comes from the following equivalent definition: a set function [math]\displaystyle{ v }[/math] is fractionally subadditive if, for any [math]\displaystyle{ S\subseteq M }[/math] and any collection [math]\displaystyle{ \{\alpha_i, T_i\}_{i=1}^k }[/math] with [math]\displaystyle{ \alpha_i \gt 0 }[/math] and [math]\displaystyle{ T_i\subseteq M }[/math] such that [math]\displaystyle{ \sum_{T_i \ni j} \alpha_i \ge 1 }[/math] for all [math]\displaystyle{ j\in S }[/math], we have [math]\displaystyle{ v(S) \le \sum_{i=1}^k \alpha_i v(T_i) }[/math].
Relation to other utility functions
Every submodular set function is XOS, and every XOS function is a subadditive set function.[1]
See also: Utility functions on indivisible goods.
References
- ↑ 1.0 1.1 Nisan, Noam (2000). "Proceedings of the 2nd ACM conference on Electronic commerce - EC '00". pp. 1. doi:10.1145/352871.352872. ISBN 1581132727.
- ↑ Feige, Uriel (2009). "On Maximizing Welfare when Utility Functions Are Subadditive". SIAM Journal on Computing 39: 122–142. 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.
 |  |
