What does Nash Bargaining and Co-Branding Splits conclude, in numbers, about “The Co-Branding Negotiation Table: an Empirical Loop, the Bargainer and a Pre-registered Test”?

Answer: Chapter 8 gives a negotiation table for co-branding and creator splits, the distilled Co-Branding Split Bargainer and a pre-registered test needing 122 deals per group, stating which results would overturn the central claim; its negotiating advice asks only for the disclosure of true outside options and teaches no overstatement or deceptive threats. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

Scope of the numbers: Under one set of illustrative parameters, with outside options of 10 for the creator and 30 for the brand, fifty-fifty keeps only 0.8889 of the maximum Nash product. Parameters are illustrative; all calculations are generated by the book's programs; the book is general analysis, not individualised business or legal advice.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 122

alpha 0.05 two-sided, power 0.90
gapsdn per grouptotal
10123162
512122244
10154896
515190380
312337674
primary design: gap 5, sd 12 -> 122 deals per group
z values: 1.9600 and 1.2816
Show the full program
# Chapter 8. p82: sample size for the pre-registered test.
# Design: deals are classed in advance by disclosed outside options as
# creator-advantaged (dC - dB >= 10) or brand-advantaged
# (dB - dC >= 10). Fifty-fifty predicts equal mean creator shares in
# both groups; the Nash rule predicts a gap of at least 10 points,
# and the primary design is powered for half of it.
# Two-sample z approximation: n per group =
# 2 (z_{1-alpha/2} + z_{1-power})^2 sd^2 / gap^2, rounded up.
# Standard deviations and gaps are planning assumptions, not data.
import math
from statistics import NormalDist

Z = NormalDist()


def n_per_group(gap, sd, alpha=0.05, power=0.90):
    za = Z.inv_cdf(1 - alpha / 2)
    zb = Z.inv_cdf(power)
    return math.ceil(2 * (za + zb) ** 2 * sd ** 2 / gap ** 2)


if __name__ == "__main__":
    print("alpha 0.05 two-sided, power 0.90")
    print(" gap  sd   n per group  total")
    for gap, sd in ((10, 12), (5, 12), (10, 15), (5, 15), (3, 12)):
        n = n_per_group(gap, sd)
        print("{:4d} {:3d} {:12d} {:6d}".format(gap, sd, n, 2 * n))
    n = n_per_group(5, 12)
    print("primary design: gap 5, sd 12 -> {} deals per group".format(n))
    print("z values: {:.4f} and {:.4f}".format(
        Z.inv_cdf(0.975), Z.inv_cdf(0.90)))

Single source and citation

Fan, Y. (2026). The Nash Bargaining Solution and Co-Branding Revenue Splits: Threat Points from Outside Options and Allocation under Risk Attitudes (Version 1.0.0), Chapter 8: The Co-Branding Negotiation Table: an Empirical Loop, the Bargainer and a Pre-registered Test. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-320 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026320,
  author    = {Fan, Yafu},
  title     = {The Nash Bargaining Solution and Co-Branding Revenue Splits: Threat Points from Outside Options and Allocation under Risk Attitudes},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book