Sum of superadditive functions

In summary, we can show that the sum of two superadditive (supermodular) functions, g(x,y) and h(x,y), is also superadditive. This is proven by setting f(x,y) = g(x,y) + h(x,y) and using the property of supermodular functions to show that f(x1,y1) + f(x2,y2) >= f(x1,y2) + f(x2,y1). Therefore, the sum of two supermodular functions is supermodular.
  • #1
jetoso
73
0

Homework Statement


Show that the sum of two superadditive (supermodular) functions is superadditive.


Homework Equations


Let X and Y be partially ordered sets and g(x,y) a real-valued function on XxY. g is supermodular (superadditive) if for x1>=x2 in X and y1>=y2 in Y,
g(x1,y1) + g(x2,y2) >= g(x1,y2) + g(x2,y1)


The Attempt at a Solution


Let g(x,y) and h(x,y) be supermodular functions on XxY. Then the following inequalities hold:
g(x1,y1) + g(x2,y2) >= g(x1,y2) + g(x2,y1)
h(x1,y1) + h(x2,y2) >= h(x1,y2) + h(x2,y1)

Let f(x,y) = g(x,y) + h(x,y), then
[g(x1,y1) + h(x1,y1)] + [g(x2,y2) + h(x2,y2)] >= [g(x1,y2) + h(x1,y2)] + [g(x2,y1) + h(x2,y1)]
implies:
f(x1,y1) + f(x2,y2) >= f(x1,y2) + f(x2,y1)

Thus, the sum of two supermodular functions is supermodular.
 
Physics news on Phys.org
  • #2
It's better to write it out with the f's:
[tex]f(x_1,y_1)+f(x_2,y_2)=\left(g(x_1,y_1)+h(x_1,y_1)\right)+\left(g(x_2,y_2)+h(x_2,y_2)\right) ... \geq f(x_1,y_2)+f(x_2,y_1)[/tex]
 
  • #3
Thank you

Thank you so much.
 

FAQ: Sum of superadditive functions

What is the definition of a superadditive function?

A superadditive function is a mathematical function that satisfies the property that the sum of the function evaluated at two inputs is greater than or equal to the function evaluated at the sum of the two inputs. In other words, f(x+y) ≥ f(x) + f(y).

How is a superadditive function different from an additive function?

An additive function satisfies the property that the sum of the function evaluated at two inputs is equal to the function evaluated at the sum of the two inputs. In contrast, a superadditive function has the property that the sum of the function evaluated at two inputs is greater than or equal to the function evaluated at the sum of the two inputs. This means that a superadditive function can have a larger output when evaluated at the sum of two inputs compared to the sum of the outputs when evaluated at the individual inputs.

Can a function be both superadditive and subadditive?

No, a function cannot be both superadditive and subadditive. A subadditive function has the property that the sum of the function evaluated at two inputs is less than or equal to the function evaluated at the sum of the two inputs. This is the opposite of a superadditive function. A function can only satisfy one of these properties, not both.

What are some common examples of superadditive functions?

Some common examples of superadditive functions include the maximum function, which returns the larger of two inputs, and the sum function, which adds two inputs together. Any function that increases or grows faster than the sum of its individual inputs can also be considered a superadditive function.

What practical applications does the concept of sum of superadditive functions have?

The concept of sum of superadditive functions is widely used in economics and game theory to model strategic interactions between entities. It can also be applied in optimization problems, such as finding the most efficient way to allocate resources, and in computer science to design algorithms that can efficiently solve complex problems.

Similar threads

Replies
10
Views
822
Replies
16
Views
2K
Replies
4
Views
2K
Replies
14
Views
2K
Replies
1
Views
2K
Replies
3
Views
2K
Replies
1
Views
4K
Back
Top