Direct answer

Search competition is a repeated allocation problem: work invested in one query, page or format has an opportunity cost elsewhere, while competitors can respond and outcomes remain uncertain.

Game-theory research offers useful intuition about incentives, change costs and instability, but its controlled models do not reveal Google’s ranking function, prove a Nash equilibrium or guarantee an outcome.

Practical steps

  1. Define a portfolio of user tasks and the evidence each existing page already serves.
  2. Estimate value, relevance, effort, change cost, overlap and volatility as explicit assumptions—not external facts.
  3. Compare balanced, value-led and stability-led allocations while enforcing a non-negotiable user-value and editorial-quality gate.
  4. Observe real outcomes over comparable periods, record competitor responses and revise without chasing every ranking movement.

Example

A team with 100 effort units may choose 45 for a high-value gap, 35 for preserving a strong but volatile page and 20 for discovery work. The allocation is a scenario, not a prediction; if a proposed change weakens the page, its allocation becomes zero.

Common mistakes

  • Copying a winning competitor’s wording or structure as if it were a stable best response.
  • Treating one query in isolation while the same page and team serve several tasks.
  • Calling an allocation formula a Google factor, Nash equilibrium or ranking forecast.

Limitations

  • Competitor intent, ranking mechanisms and future actions are only partly observable.
  • The planning weights are user-owned assumptions and require calibration against first-party evidence.

Search is a living system

  1. Evidence
  2. Diagnose
  3. Experiment
  4. Measure
  5. Improve

Game theory for organic growth

Use incentives, alternatives and response dynamics to frame decisions. Formal games do not reveal Google's ranking function or guarantee an equilibrium.

Ethical information design

Sequence truthful evidence around the receiver's decision, expose uncertainty and disqualifiers, and never turn Bayesian persuasion into a manipulation score.

Competitive positioning

Compare real alternatives on a shared basis. Competition can increase or reduce disclosure depending on conditions; it does not automatically produce truth.

Rational attention and friction

Review stakes, familiarity, uncertainty, reversibility and information cost as context. A controlled buyer–seller task does not yield a universal attention score.

Choice architecture

Categorize and progressively disclose when useful, but test the environment. A meta-analysis found a near-zero mean choice-overload effect with substantial heterogeneity.

Credibility evidence

Show identity, authorship, sources, policies, dates, security and accessible usability. Historical perceived-credibility evidence is not a conversion or ranking study.

Controlled experimentation

Define an OEC, guardrails, power, assignment, ramp and stop rules before reading results. A borderline p-value alone never names a winner.

Influence and distribution

Model a real graph with explicit diffusion parameters and uncertainty. Greedy approximation under submodular models is not a virality forecast.

Search satisfaction beyond clicks

Similar quick reformulations can support a friction hypothesis in session logs. A click is not success, silence is not satisfaction, and GSC aggregates are not sessions.

Metric interpretation failures

Check SRM, ratio metrics, telemetry, power, multiplicity, segments, outliers, novelty, funnel completeness, Simpson risk and Twyman's Law before acting.

Who this is for

  • Define a portfolio of user tasks and the evidence each existing page already serves.
  • Estimate value, relevance, effort, change cost, overlap and volatility as explicit assumptions—not external facts.
  • Compare balanced, value-led and stability-led allocations while enforcing a non-negotiable user-value and editorial-quality gate.
  • Observe real outcomes over comparable periods, record competitor responses and revise without chasing every ranking movement.

Who this is not for

  • Buying or exchanging ranking links.
  • Hiding different content for crawlers and users.
  • Calling a short-term visibility change proof that a prohibited tactic is safe.

Free Tools

Primary sources

Continue learning

WhatsApp