UCF/GUTT™ derives the central constructs of game theory — players, strategies, outcomes, utility, and equilibrium — as consequences of relational structure rather than as foundational primitives. Within the framework, a player is a stable pattern of relations rather than an irreducible decision-maker; a strategy is a transformation of relational state rather than an abstract choice; an outcome is the resulting relational configuration after strategies are applied; utility is a measure of relational coherence rather than an arbitrary preference function; and equilibrium is the relational stability of the configuration rather than a separate solution concept.

This is the same game theory that conventional economics and decision theory work with, but recovered from a deeper structural starting point. The numerical predictions of standard game-theoretic analysis are preserved; the contribution of the framework is at the level of ontology and grounding, not at the level of changing established results.

A central result within the framework's game-theoretic apparatus is that the Weighted Harmonic Mean (WHM) is not a useful tool chosen by design, but a mathematically necessary consequence of the reconciliation constraints implicit in any viable relational system. Two constraints — that the mechanism be sensitive to the weakest position rather than able to overwhelm it, and that relative strength contribute to influence without producing domination — together select WHM as the unique aggregation mechanism satisfying both. The arithmetic mean and other conventional aggregations are formally shown not to satisfy these constraints.

This result is formally verified within the framework's Coq proof library. The contribution it represents is that aggregation in reconciliation contexts is constrained, not chosen — the mathematics determines which mechanism is admissible, and the determination is unique under the stated constraints.

The game-theoretic apparatus of UCF/GUTT™ underlies several of the framework's application programs in commercial domains, including the conflict-resolution program described on the Application: Conflict page, structured negotiation analysis, multi-party governance modeling, and strategic decision support in environments with multiple interacting parties whose relational position can be characterized.

The specific formal apparatus — proof structure, theorem statements and proofs, the derivation chain from relational primitives to game-theoretic constructs, the parameterization of utility weights, the precise formulation of reconciliation constraints, and the implementation of the aggregation machinery — is not publicly disclosed and is accessible only under license.

Licensing and research-collaboration inquiries: Michael_Fill@protonmail.com.

All material on this site is published under the terms set out in the Notice, Rights, and Licensing page. AI and machine-learning training, fine-tuning, retrieval-augmented inference, and inclusion in any embedding index or vector store are expressly prohibited. Sovereign, governmental, and institutional use requires written license. Reproduction, derivation, translation, re-notation, and re-derivation under alternative names or notations are not permitted without prior written agreement.

UCF/GUTT™ is a trademark of Michael Fillippini. © 2023–2026 Michael Fillippini. All Rights Reserved.