What does Link Authority, Retrieval Truncation and Direct Answers conclude, in numbers, about “Competing for k Positions: Position Auctions, Homogenisation and the Commons”?
Answer: Chapter 5 borrows position auctions and ratio contests to show that ten competitors burn 0.900 of a position's value, and that systems which reward duplication homogenise content.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not personalised legal, financial or business advice and makes no promise about citation rankings in any system. Chapter 1 computes PageRank and HITS with power iteration and a random surfer: in an illustrative knowledge base with damping factor 0.85, the mother page receives 0.3240, or 2.59 times the uniform share.
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: 0.900
| owners | effort each | total effort | share of V burnt | iterated |
|---|---|---|---|---|
| 2 | 25.000 | 50.000 | 0.500 | 50.000 |
| 3 | 22.222 | 66.667 | 0.667 | 66.667 |
| 5 | 16.000 | 80.000 | 0.800 | 80.000 |
| 10 | 9.000 | 90.000 | 0.900 | 90.000 |
| 20 | 4.750 | 95.000 | 0.950 | 95.000 |
| owners' joint surplus at n = 10: 10.0 of 100 |
Show the full program
# Chapter 5. p53: how much of a slot's value an optimization race burns.
# n owners compete for one answer slot worth V = 100 (illustrative units
# of attention). Owner i spends effort e_i at unit cost 1 and wins with
# chance e_i / (sum of all efforts), a ratio contest. Symmetric equilibrium:
# e* = V (n - 1) / n^2, so total effort = V (n - 1) / n. Checked by
# iterating exact best responses e_i = sqrt(V E) - E, E = rivals' total.
import math
V = 100.0
def best_response(others):
return max(0.0, math.sqrt(V * others) - others)
def iterate(n, rounds=400):
e = [1.0 + i for i in range(n)]
for _ in range(rounds):
for i in range(n):
rest = math.fsum(e[j] for j in range(n) if j != i)
e[i] = best_response(rest)
return e
if __name__ == "__main__":
print("owners effort each total effort share of V burnt"
" iterated")
for n in (2, 3, 5, 10, 20):
each = V * (n - 1) / n ** 2
total = each * n
it = math.fsum(iterate(n))
print("{:6d} {:11.3f} {:12.3f} {:16.3f} {:8.3f}".format(
n, each, total, total / V, it))
print("owners' joint surplus at n = 10: {:.1f} of {:.0f}".format(
V - V * 9 / 10, V))Single source and citation
Fan, Y. (2026). Hyperlink Authority Propagation in Machine-Readable Knowledge Bases, Retrieval-Truncation Games in Generative Answering and High-SNR Snippet Extraction (Version 1.0.0), Chapter 5: Competing for k Positions: Position Auctions, Homogenisation and the Commons. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-176 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026176,
author = {Fan, Yafu},
title = {Hyperlink Authority Propagation in Machine-Readable Knowledge Bases, Retrieval-Truncation Games in Generative Answering and High-SNR Snippet Extraction},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Power Iteration and the Damping Factor: How Hyperlink Authority Flows Through a Knowledge Base
- Chapter 2 · The Mother Page: How Internal-Link Topology Concentrates Authority
- Chapter 3 · BM25 and Length Normalisation: the Term-Frequency Ledger of Stuffing, Padding and Direct Answers
- Chapter 4 · Top-k Truncation: the Probability that a Passage Enters the Context
- Chapter 6 · Signal-to-Noise and Softmax Reranking: the Selection Gain of Direct-Answer Snippets
- Chapter 7 · The Classics Examined: Zheng Qiao's Classification and Bush's Associative Trails
- Chapter 8 · Practice and Falsification: the Copy Checker, a Publisher's Checklist and a Pre-Registered Test