Nash Product

Published by Mario Oettler on

Last Updated on 28. April 2023 by Martin Schuster

Another solution concept is the maximization of the Nash product N.

N = (x1-d1)*(x2-d2)

di: Disagreement points

Graphically, this is the area under the pay-off points.

Numerical Example 1

Let’s assume we want to split 1 EUR. If the negotiation participants cannot come to an agreement, they receive 0 (di = 0).

The Nash product is:

N = (x1-0)*(x2-0)

It is maximal for x1 = x2 = ½

Now, we solve the equation with Lagrange.

N = a*b

N: Nash product

Side condition:

a+b = 1

1-a-b = 0

L = a*b+u(1-a-b)

dL/du = 1-a-b = 0

dL/da = b-u = 0

dL/db = a-u = 0

a = b = ½

Numerical Example 2

Player A receives a payment of 0.4 in case of a failed negotiation. This means the disagreement point for A is 0.4.

N = (x1-0.4) * (x2-0)

N = (x1-0.4) * (1-x1-0)

x1 = 0.7

Negotiation Power

a is now a parameter for negotiation skills

N = (x1-d1)a*(x2-d2)(1-a)

  • a = 0.5: both participants have the same power
  • a > 0.5: participant 1 has more negotiation power than participant 2
  • a < 0.5 participant 1 has less negotiation power than participant 2
Categories:

https://blockchain-academy.hs-mittweida.de/wp-content/uploads/2021/04/logo_bcam_rgb_gross.png

Welcome

Blockchain Academy

Continue with credential

No account yet?

Powered by Hidy

Register with Hidy


Register
Sign in

We need the following credential to register:

please select:

To create a new account, we need the following data from you:

We would appreciate the following additional information from you for the creation of your account:

Welcome

Blockchain Academy

Continue with credential

Already have an account?

Powered by Hidy

Sign in with Hidy


Register
Sign in

We need the following credential to log in:

please select: