Gross substitutes (indivisible items)

In economics, gross substitutes (GS) is a class of utility functions on indivisible goods. An agent is said to have a GS valuation if, whenever the prices of some items increase and the prices of other items remain constant, the agent's demand for the items whose price remain constant weakly increases.

Bundle	Alice's valuation (GS)	Bob's valuation (not GS)
$\emptyset$	$0	$0
apple	$5	$5
bread	$7	$7
apple+bread	$9	$15

An example is shown on the right. The table shows the valuations (in dollars) of Alice and Bob to the four possible subsets of the set of two items: {apple,bread}. Alice's valuation is GS, but Bob's valuation is not GS. To see this, suppose that initially both apple and bread are priced at $6. Bob's optimal bundle is apple+bread, since it gives him a net value of $3. Now, the price of bread increases to $10. Now, Bob's optimal bundle is the empty bundle, since all other bundles give him negative net value. So Bob's demand to apple has decreased, although only the price of bread has increased.

The GS condition was introduced by Kelso and Crawford in 1982^[1] and was greatly publicized by Gul and Stacchetti.^[2] Since then it has found many applications, mainly in auction theory and competitive equilibrium theory.

Definitions

The GS condition has many equivalent definitions.

Gross Substitutes (GS)

The original GS definition^[1] is based on a price vector and a demand set.

A price vector $p$ is a vector containing a price for each item.
Given a utility function $u$ and a price vector $p$ , a set $X$ is called a demand if it maximizes the net utility of the agent: $u(X)-p\cdot X$ .
The demand set $D(u,p)$ is the set of all demands.

The GS property means that when the price of some items increases, the demand for other items does not decrease. Formally, for any two price vectors $q$ and $p$ such that $q\geq p$ , and any $X\in D(u,p)$ , there is a $Y\in D(u,q)$ such that $Y\supseteq \{x\in X|p_{x}=q_{x}\}$ (Y contains all items in X whose price remained constant).

Single Improvement (SI)

The SI condition^[2] says that a non-optimal set can be improved by adding, removing or substituting a single item. Formally, for any price vector $p$ and bundle $X\notin D(u,p)$ , there exists a bundle $Y$ such that $u(Y)-p\cdot Y>u(X)-p\cdot X$ , $|X\setminus Y|\leq 1$ and $|Y\setminus X|\leq 1$ .

No Complementaries (NC)

The NC condition^[2] says that every subset of a demanded bundle has a substitute. Formally: for any price vector $p$ and demanded bundles $X,Y\in D(u,p)$ , and for every subset $X'\subseteq X$ , there is a subset $Y'\subseteq Y$ such that: $X\setminus X'\cup Y'\in D(u,p)$

If the valuation function is monotone, then GS implies SI and SI implies NC and NC implies GS,^[2]^:117–120 so these three conditions are equivalent.

M# Concave (MX)

The MX condition^[3] comes from convex analysis. It says that for all sets $X,Y$ and for every item $x\in X$ , at least one of the following must be true:

$u(X)+u(Y)\leq u(X\setminus \{x\})+u(Y\cup \{x\})$ , or -
there exists an item $y\in Y$ such that $u(X)+u(Y)\leq u(X\setminus \{x\}\cup \{y\})+u(Y\setminus \{y\}\cup \{x\})$ .

The M#-concavity property is also called M#-exchange property.^[4] It has the following interpretation. Suppose Alice and Bob both have utility function $u$ , and are endowed with bundles $X$ and $Y$ respectively. For every item that Alice hands Bob, Bob can hand at most one item to Alice, such that their total utility after the exchange is preserved or increased.

SI implies MX and MX implies SI,^[3] so they are equivalent.

Strong No Complementaries (SNC)

The SNC condition^[2] says that, for all sets $X$ and $Y$ and for every subset $X'\subseteq X$ , there is a subset $Y'\subseteq Y$ such that:

u(X)+u(Y)\leq u(X\setminus X'\cup Y')+u(Y\setminus Y'\cup X')

The SNC property is also called M#-multiple-exchange property.^[4] It has the following interpretation.^[2] Suppose Alice and Bob both have utility function $u$ , and are endowed with bundles $X$ and $Y$ respectively. For every subset $X'$ that Alice hands Bob, there is an equivalent subset $Y'$ that Bob can handle Alice, such that their total utility after the exchange is preserved or increased. Note that it is very similar to the MC condition - the only difference is that in MC, Alice hands Bob exactly one item and Bob returns Alice at most one item.

Note: to check whether u has SNC, it is sufficient to consider the cases in which $X'\subseteq X\setminus Y$ . And it is sufficient to check the non-trivial subsets, i.e., the cases in which $X'\neq \emptyset$ and $X'\neq X\setminus Y$ . And for these cases, we only need to search among bundles $Y'\subseteq Y\setminus X$ .

Kazuo Murota proved^[4] that MX implies SNC.

It is obvious that SNC implies NC.^[2] Proof: Fix an SNC utility function $u$ and a price-vector $p$ . Let $A,B$ be two bundles in the demand-set $D(u,p)$ . This means that they have the same net-utility, E.g., $U_{p}:=u_{p}(A)=u_{p}(B)$ , and all other bundles have a net-utility of at most $U_{p}$ . By the SNC condition, for every $A'\subset A$ , there exists $B'\subseteq B$ such that $u_{p}(A\setminus A'\cup B)+u_{p}(B\setminus B'\cup A)\geq u_{p}(A)+u_{p}(B)=2\cdot U_{p}$ . But $u_{p}(A\setminus A'\cup B)$ and $u_{p}(B\setminus B'\cup A)$ are both at most $U_{p}$ . Hence, both must be exactly $U_{p}$ . Hence, both are also in $D(u,p)$ .

We already said that NC implies GS which implies SI, and that^[3] SI implies MX. This closes the loop and shows that all these properties are equivalent (there is also a direct proof^[4] that SNC implies MX).

Downward Demand Flow (DDF)

The DDF condition^[5] is related to changes in the price-vector. If we order the items by an ascending order of their price-increase, then the demand of a GS agents flows only downwards – from items whose price increase more to items whose price increased less, or from items whose price increased to items whose price decreased, or from items whose price decreased less to items whose price decreased more.

Formally, let $p,q$ be two price-vectors and let $\Delta :=q-p$ be the price-increase vector. If an item $x$ is demanded under $p$ and not demanded under $q$ , then there is another item $y$ with $\Delta _{y}<\Delta _{x}$ that is not demanded under $p$ and is demanded under $q$ .

It is easy to see that DDF implies GS (GS is a special case of DDF in which $\Delta$ has only zero or positive values).^[5] prove that MX implies DDF, so these conditions are all equivalent.

Preservation

The GS condition is preserved under price-changes. I.e, a utility function $u$ has GS, if-and-only-if for every price-vector $p$ , the net-utility function $u-p$ also has GS. This is easiest to see through the MC or SNC conditions, since it is evident that these conditions are invariant to price.

Properties

Submodularity

Submodular which is not GS
Bundle	Value ($)
$\emptyset$	0
x	40
y	40
z	66
x,y	80
x,z	75
y,z	75
x,y,z	80

Every GS valuation is a submodular set function.^[2]

The converse is not necessarily true.^[6] This is shown by the example on the right. The utility is submodular since it satisfies the decreasing-marginal-utility property: the marginal-utility of an item is 40–66 when added to an empty set, 9--40 when added to a single item and 0--5 when added to a pair of items. But it violates the equivalent conditions of the GS family:

MX is violated by the sets {x,y} and {z}. Suppose Alice holds {x,y} and Bob holds {z}, so their common utility is 146. Alice gives x to Bob. Then, whether Bob returns z or returns nothing, their common utility drops to 115.
NC is violated with prices $p_{x}=p_{y}=10$ and $p_{z}=6$ , since there are two demanded bundles: {x,y} and {z} (both have net utility 60). But, if y is taken from the first set, there is nothing from the second set that can substitute it ({x} has net utility 30 and {x,z} has net utility 59 - none of them is a demand).
GS is violated with prices $p_{x}=p_{y}=p_{z}=10$ , since the demanded bundle is then {x,y}, but when $p_{x}$ increases to e.g. 200 (such that x is no longer demanded), the new demanded bundle is {z}. The increase in $p_{x}$ decreased the demand for item y.
SI is violated with prices $p_{x}=p_{y}=p_{z}=10$ , since the bundle {z} is not optimal but the only way to improve it is to change it to {x,y}, which requires to add two items.

Submodularity does imply GS in the special case in which there is a single item-type, so that the value of a bundle depends only on the number of items in the bundle. This is easiest to see using the SNC characrerization, which in this case translates to:

for all integers

k_{x},k_{y}

and for every

k_{x}'\leq k_{x}

, there is an integer

k_{y}'\leq k_{y}

such that:

u(k_{x})+u(k_{y})\leq u(k_{x}-k_{x}'+k_{y}')+u(k_{y}-k_{y}'+k_{x}')

Indeed, if $k_{x}'\leq k_{y}$ then we can take $k_{y}'=k_{x}'$ which makes the two sides identical; if $k_{x}'>k_{y}$ we can take $k_{y}'=k_{y}$ which makes the inequality:

u(k_{x})+u(k_{y})\leq u(k_{y}+k_{x}-k_{x}')+u(k_{x}')

which is equivalent to:

u(k_{x}'+[k_{x}-k_{x}'])-u(k_{x}')\leq u(k_{y}+[k_{x}-k_{x}'])-u(k_{y})

This follows from submodularity because $k_{x}'>k_{y}$ .

References

1 2 Kelso, A. S.; Crawford, V. P. (1982). "Job Matching, Coalition Formation, and Gross Substitutes". Econometrica. 50 (6): 1483. JSTOR 1913392. doi:10.2307/1913392.
1 2 3 4 5 6 7 8 Gul, F.; Stacchetti, E. (1999). "Walrasian Equilibrium with Gross Substitutes". Journal of Economic Theory. 87: 95. doi:10.1006/jeth.1999.2531.
1 2 3 Fujishige, Satoru; Yang, Zaifu (2003). "A Note on Kelso and Crawford's Gross Substitutes Condition". Mathematics of Operations Research. 28 (3): 463. doi:10.1287/moor.28.3.463.16393.
1 2 3 4 Kazuo Murota (2016). "Multiple Exchange Property for M#-concave Functions and Valuated Matroids". arXiv:1608.07021 .
1 2 Segal-Halevi, Erel; Hassidim, Avinatan; Aumann, Yonatan (2016). "Demand-flow of agents with gross-substitute valuations". Operations Research Letters. 44 (6): 757. arXiv:1607.01989 . doi:10.1016/j.orl.2016.09.012.
↑ Ben-Zwi, Oren; Lavi, Ron; Newman, Ilan (2013). "Ascending auctions and Walrasian equilibrium". arXiv:1301.1153  [cs.GT].

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