Book contents
- Frontmatter
- Contents
- Acknowledgments
- 1 Introduction
- 2 F Networks
- 3 Networks of Real-Valued Functions
- 4 Applications to Economics
- 5 Applications to Games
- 6 Lower Bounds and Approximations
- 7 Organizations
- A Appendix to Chapter 2: Graph Theory
- B Appendix to Chapter 3: Real-Valued Functions
- C Appendix to Chapter 5: Application to Games
- Bibliography
- Index
C - Appendix to Chapter 5: Application to Games
Published online by Cambridge University Press: 04 June 2010
- Frontmatter
- Contents
- Acknowledgments
- 1 Introduction
- 2 F Networks
- 3 Networks of Real-Valued Functions
- 4 Applications to Economics
- 5 Applications to Games
- 6 Lower Bounds and Approximations
- 7 Organizations
- A Appendix to Chapter 2: Graph Theory
- B Appendix to Chapter 3: Real-Valued Functions
- C Appendix to Chapter 5: Application to Games
- Bibliography
- Index
Summary
The Nash solution of the bargaining problem whose frontier is the cubic curve with Equation (5.1.11) is the point on the frontier where [(1 + A)x − y − a] (y − b) takes its maximum value. We use the Lagrange multiplier method to find the maximum. Set the Lagrangian equal to
Then
It follows from the condition ∂Λ/∂y = 0 that
Set a − b = α. Then
However, if
then
Substitute the expression for y into Equation (5.1.11) and clear the denominator. The result is the following equation in x.
To find the optima in Example 5.2.1., we computed the partial derivative of P, the payoff function, with respect to y. The result is a quadratic in x with a single solution S(d, x) that is in the interval [0, 1] when x ∈ [0, 1] and d ∈ (0.5, 1.5). The solution S(d, x) substituted for y in P. When the resulting function of x and d is optimized, values to be in chosen in [0, 1], the result is the expression given in the second section of Chapter 5. One can then compute the y coordinate ŷ for the optimal point. The expression for is the following.
Each of the entries F1, …, F7 is an expression in d. The expressions are the following.
- Type
- Chapter
- Information
- Computation and Complexity in Economic Behavior and Organization , pp. 225 - 228Publisher: Cambridge University PressPrint publication year: 2002