Computational Market Economics
The formal mathematical foundation of the research ecosystem — transforming institutional claims into testable structures that support formal proof.
R* = argmax V(R) K < n S ⊂ U Formalization layer between CMA and NDA
Formal Mathematical Foundation Layer
Computational Market Economics serves as the formalization engine of the research ecosystem. It transforms the institutional transition described in Computational Market Access into precise mathematical primitives, structural assumptions, and formal propositions.
The formal structures defined here become the axiomatic assumptions that Network-Dependent Allocation proves as formal theorems and impossibility results.
Framework Context
This page presents an emerging theoretical framework exploring allocation under inferential scarcity. Some sections are mathematically formalized. Others are theoretical, experimental, or speculative constructs requiring empirical validation.
The framework should be interpreted as computational-economic research rather than investment, governance, or policy prediction.
Institutional Framing: For the institutional framing of this transition—the structural analysis of why visibility is no longer sufficient and why participation becomes infrastructure—see Computational Market Access.
Role in Research Stack
Mathematical formalization layer connecting institutional framing to formal proof
Computational Market Economics serves as the mathematical foundation layer of the research ecosystem. It formalizes the institutional transition described in Computational Market Access into precise mathematical primitives, structural assumptions, and formal propositions that naturally lead to the impossibility results in Network-Dependent Allocation.
Research Dependency Graph
CMA: Institutional
CME: Formalization
NDA: Proofs
Each layer provides the foundation for the next. CME formalizes CMA's institutional claims into mathematical structures that NDA then proves impossible or structurally constrained.
Formalization Layer
CME transforms the institutional transition described in CMA into formal mathematical primitives: K < n as capacity constraint, S ⊂ U as subset selection, C(x) as representation cost, P(selection|representation) as inclusion probability. These formal structures become the assumptions that NDA proves structurally unstable.
Core Primitives
FormalizedFormal definitions of computational-economic concepts
Formal Primitives: The following concepts are formalized as mathematical primitives. Each includes notation, formal definition, economic meaning, and structural implication. Primitives marked as theoretical or experimental require empirical validation.
Inferential Scarcity
FormalizedIS = 1 - |R|/|A|Formal Definition
The ratio of excluded to available artifacts under capacity constraint K, where |R| ≤ K < |A|.
Economic Meaning
Computational reasoning capacity becomes the binding constraint on allocative participation.
Structural Implication
Creates permanent exclusion pressure independent of market mechanisms.
Relationship to Allocation
Determines the upper bound on consideration set size.
→ Formal Proof Layer
Explored formally in NDACapacity Constraint K
Formalized|R| ≤ K < |A|Formal Definition
The maximum number of artifacts that can be computationally evaluated in a single selection cycle.
Economic Meaning
Bounded reasoning capacity limits the scope of allocative consideration.
Structural Implication
Makes subset optimization necessary rather than optional.
Relationship to Allocation
Creates the exclusion boundary that precedes ranking.
→ Formal Proof Layer
Explored formally in NDAComputational Admissibility
Theoreticaladm(x) = C(x) ≤ τFormal Definition
An artifact x is computationally admissible if its representation cost C(x) is below threshold τ.
Economic Meaning
Technical eligibility for allocative processing determines participation.
Structural Implication
Exclusion occurs at representation level, not preference level.
Relationship to Allocation
Filters the available set A into the admissible set A*.
Consideration Set Construction
FormalizedR ⊆ A*, |R| ≤ KFormal Definition
The subset of admissible artifacts selected for deep evaluation under capacity constraints.
Economic Meaning
The effective market — only artifacts in R can participate in allocation.
Structural Implication
Markets are always incomplete by computational necessity.
Relationship to Allocation
Precedes pricing, competition, and transaction.
Representation Capital
ExperimentalRC = ΔP(inclusion|representation)Formal Definition
The allocative advantage conferred by representation quality, measured as inclusion probability delta.
Economic Meaning
Machine-readable representation becomes a form of capital formation.
Structural Implication
Creates capital concentration at the infrastructure layer.
Relationship to Allocation
Directly influences inclusion probability in consideration sets.
Subset Selection
FormalizedR* = argmax_{R⊆A,|R|≤K} V(R)Formal Definition
The optimization problem of selecting the value-maximizing subset under capacity constraints.
Economic Meaning
Allocation requires combinatorial selection, not ordinal ranking.
Structural Implication
Ranking becomes insufficient for optimal allocation.
Relationship to Allocation
The core allocative mechanism under inferential scarcity.
→ Formal Proof Layer
Explored formally in NDAPre-Ranking Exclusion
Formalized∃x∈A: x∉A* ⇒ x never rankedFormal Definition
Artifacts excluded from the admissible set never reach the ranking stage.
Economic Meaning
Exclusion precedes competition — ranking only applies to the already-admitted.
Structural Implication
Inferential exclusion is invisible to ranking-based market mechanisms.
Relationship to Allocation
Creates silent exclusion that ranking cannot detect.
→ Formal Proof Layer
Explored formally in NDARepresentation Cost
TheoreticalC: U → ℝ⁺Formal Definition
The computational cost of representing and evaluating an artifact in the consideration process.
Economic Meaning
Complex representations consume more inferential budget.
Structural Implication
Creates efficiency pressure toward standardized representations.
Relationship to Allocation
Affects which artifacts are selected into consideration sets.
Inferential Cost
TheoreticalI(x, context) = tokens + computation_timeFormal Definition
The resource expenditure required to include artifact x in the evaluation process.
Economic Meaning
Reasoning about artifacts consumes scarce computational resources.
Structural Implication
Allocative efficiency requires minimizing inferential cost.
Relationship to Allocation
Determines the feasible size of consideration sets.
Machine-Mediated Participation
TheoreticalP(x∈R) = f(adm(x), C(x), context)Formal Definition
Participation probability depends on computational admissibility, representation cost, and selection context.
Economic Meaning
Allocative participation is mediated by machine processing, not human choice.
Structural Implication
Human agency operates within computationally constructed opportunity sets.
Relationship to Allocation
Participation is conditional on machine-legibility.
Primitive Relationships
These primitives form an interconnected system: Inferential Scarcity creates the capacity constraint that necessitates Subset Selection, which requires Computational Admissibility filtering, creating Pre-Ranking Exclusion. Representation Capital influences inclusion probability at each stage. The formal properties of this system are proven in Network-Dependent Allocation.
Mathematical Structure
FormalizedFormal theorems leading to Network-Dependent Allocation proofs
Theorem Cards: The following theorems are mathematically formalized in the framework and proven in Network-Dependent Allocation. Each theorem includes formal notation, statement, and implication for the formal proof layer.
Irreducibility Theorem
FormalizedUnder non-separable valuation V(R), no ordinal ranking function can guarantee optimal subset selection.
∀ ranking ρ: A → ℕ, ∃ V s.t. top-Kρ ≠ R*Implication
Subset optimization is algorithmically distinct from ranking.
→ Network-Dependent Allocation
Formally proven as Theorem 1 in NDA with complete proof.
Capacity Constraint Theorem
FormalizedWhen |R| ≤ K < |A|, exclusion is guaranteed irrespective of market mechanism.
K < |A| ⇒ ∃x ∈ A: x ∉ RImplication
Inferential scarcity creates structural exclusion.
→ Network-Dependent Allocation
Axiomatic foundation for NDA computational complexity.
Pre-Ranking Exclusion Theorem
FormalizedExclusion at representation level precedes and is invisible to ranking mechanisms.
x ∉ A* ⇒ x never evaluated by ranking functionImplication
Ranking-based markets cannot detect representation-layer exclusion.
→ Network-Dependent Allocation
Structural basis for retrieval-allocation distinction in NDA.
Structural Assumptions
FormalizedFoundational assumptions of the formal framework
Axiomatic Structure: These assumptions form the axiomatic foundation of the framework. Assumptions marked with → NDAare formally explored in Network-Dependent Allocation, where their implications are proven as theorems.
Bounded Reasoning Capacity
∃K ∈ ℕ: ∀ selection tasks, |R| ≤ K where R is the consideration setAI systems have finite computational resources. Context windows, processing time, and token budgets create hard upper bounds on consideration.
Non-Separable Valuation
∃i,j: V({i,j}) ≠ V({i}) + V({j})Real-world allocation often involves complementarity. The value of a set depends on interactions between elements, not just individual values.
Subset Construction Precedes Ranking
ranking: A* → ℕ only defined on constructed subset A* ⊆ ARanking functions require an input set. That set must be constructed before ranking can occur. Construction is logically and computationally prior.
Representation-Dependent Inclusion
P(x∈R|representation_x) ≠ P(x∈R|¬representation_x)Machine-readable representations affect inclusion probability. Artifacts with structured representations may be preferred over unstructured equivalents.
Context-Dependent Valuation
V(R|context₁) ≠ V(R|context₂) for identical RSelection context changes value. The same artifact set may have different values under different query contexts.
Formal Implications
Assumptions 1-3 are mathematically formalized. Their combination creates the structural necessity of subset optimization. These are proven in NDA Theorems 1-3.
Empirical Requirements
Assumptions 4-5 are theoretically argued but require experimental validation. Inclusion probability and context-dependence need measurement through controlled studies.
Structural Assumptions → Formal Proofs
Assumptions 1-3 are formally explored in Network-Dependent Allocation. The bounded reasoning capacity (K), non-separable valuation (V), and subset construction primitives become the axiomatic foundation for impossibility theorems.
Formal Propositions
TheoreticalTheoretical claims derived from structural assumptions
Theoretical Claims: These propositions are logically derived from the structural assumptions. They represent theoretical predictions that require empirical validation. Propositions marked as formalized are mathematically proven in NDA.
Under bounded reasoning capacity, inclusion in the candidate set becomes more economically important than ordinal ranking position.
Explanation
When K ≪ |A|, the probability of being in R dominates the expected value of rank position within R. Being excluded (x∉R) yields zero expected value regardless of potential rank.
Condition
Requires K < |A| and non-uniform inclusion probability
As inferential cost increases, representation quality becomes allocative infrastructure rather than descriptive metadata.
Explanation
When representation affects P(x∈R), it becomes allocatively consequential. Representation shifts from communicative (describing attributes) to infrastructural (enabling participation).
Condition
Requires representation-dependent inclusion
In subset-construction systems, exclusion occurs upstream of evaluation and is therefore invisible to ranking-based market mechanisms.
Explanation
Ranking systems only observe elements that reach the ranking stage. Excluded artifacts (x∉A*) produce no ranking signal. This creates silent exclusion that markets cannot detect or correct.
Condition
Requires pre-ranking filtering
Under capacity constraints, allocative efficiency requires minimizing representation cost per artifact.
Explanation
Given fixed budget K, maximizing |R| requires minimizing per-artifact cost C(x). Efficient representations enable larger consideration sets and better allocation.
Condition
Requires C(x) > 0 and sum C(x) ≤ K
When valuation is non-separable, no ordinal ranking can guarantee optimal subset selection.
Explanation
If V({i,j}) depends on the pair, no individual scores s(i), s(j) exist such that top-K by s produces optimal {i,j}*. Subset optimization is fundamentally distinct from ranking.
Condition
Requires ∃ pairs with V(i,j) ≠ V(i) + V(j)
Propositions → Formal Theorems
Propositions 3, 4, and 5 are mathematically formalized in Network-Dependent Allocation. The upstream exclusion, capacity-constrained efficiency, and non-separability irreducibility propositions become Theorems 1, 2, and 3 respectively.
Non-Separability
FormalizedWhy ranking becomes insufficient under complementarity
Separable Value
V({i,j}) = V({i}) + V({j})
Each item has independent value. Rankings aggregate individual scores. Top-N by ranking equals optimal subset.
Ranking suffices.
Non-Separable Value
V({i,j}) ≠ V({i}) + V({j})
Item values depend on which other items are selected. Complementarity creates network effects within the selected set.
Ranking fails.
Network-Dependent Allocation
V(R) = Σv_i + Σw_ij — value depends on individual attributesplus pairwise (or higher-order) complementarity. The optimal subset cannot be derived from linear ordering.
Economic Implication
Non-separability suggests why ranking-based marketplaces could be structurally limited for AI-mediated selection. When AI systems optimize for complementarity (location × price × attributes × compatibility), rank position may become an insufficient signal of allocative value.
Inferential Scarcity
FormalizedWhen computational reasoning capacity becomes the binding constraint
Inferential Scarcity Metric
IS = 1 - |R|/|A|where |R| ≤ K < |A|
Available Artifacts
|A|
Capacity Bound
K
Selected Subset
|R|
Attention Scarcity
When humans scan search results, attention is the binding constraint. Users consider only the first few results. Optimization targets visibility.
Competition: Rank position, UI placement, advertising
Inferential Scarcity
When AI systems perform reasoning, computational capacity is the binding constraint. The system can only deeply evaluate K items. Optimization targets representability.
Competition: Representation quality, schema compliance, computational efficiency
Economic Implication
The shift from attention scarcity to inferential scarcity could change the allocative bottleneck:selection may precede pricing. An artifact must first be included in the consideration set R before price or terms can matter. Representation could become the gatekeeper of allocative participation.
Inferential Exclusion
TheoreticalStructural exclusion under capacity constraints
Theoretical construct: Inferential exclusion describes a potential mechanism by which artifacts could fail to participate in AI-mediated allocation. This would require empirical validation through inclusion probability measurements.
Definition
Inferential exclusion occurs when an economic artifact cannot participate in AI-mediated allocation because it falls outside the inferential capacity boundary K. Unlike platform exclusion (interface-dependent), inferential exclusion is structural: it arises from the capacity constraint itself.
| Dimension | Platform Exclusion | Inferential Exclusion |
|---|---|---|
| Cause | Platform policy / algorithm | Capacity constraint K |
| Visibility | Artifact exists, not displayed | Artifact cannot be considered |
| Remedy | Policy change, payment | Representation quality improvement |
| Boundary | Interface-level | Selection-level |
Selection-First Allocation
Available Set A
All artifacts
Consideration Set R
|R| ≤ K capacity
Selected Subset R*
Optimal allocation
Exclusion occurs at the consideration boundary — artifacts must first be selected into R before pricing or terms matter.
Economic Implication
Selection-first allocation could invert traditional market dynamics. Pricing might not compensate for poor representation because the artifact may never reach the pricing stage. Representation quality could become a primary determinant of allocative participation.
Protocol-Mediated Participation
TheoreticalRepresentation as allocative infrastructure
Theoretical construct: Protocol-mediated participation describes how allocative access could be governed by representation protocols rather than platform interfaces. This would require experimental validation.
Definition
Protocol-mediated participation describes allocative access governed by adherence to representation protocols. When AI systems evaluate artifacts through machine-readable schemas, participation depends on schema compliance—not platform listing, not advertising spend.
Platform-Mediated
Access requires platform listing approval
Governance by corporate policy
Platform-specific interfaces
Vendor lock-in through UI dependence
Protocol-Mediated
Access requires schema compliance
Governance by protocol standards
Interface-agnostic representation
Cross-platform interoperability
Protocol Capture Risk
If protocol authority becomes centralized, the representation layer could become an allocative bottleneck. A single entity could control market participation through schema design — potentially a new form of structural power distinct from platform monopoly.
Economic Implication
Protocol-mediated participation suggests that representation infrastructure could become allocative infrastructure. Economic actors might compete on schema compliance rather than advertising spend. The representation layer itself could become a site of economic power.
Representation Capital
ExperimentalMachine-legibility as allocative infrastructure
Experimental Construct: Representation capital is a theoretical concept derived from the inclusion probability primitive. It would require empirical validation through controlled studies measuring inclusion probability deltas across representation quality levels.
Representation Capital Formal Definition
RC = ΔP(inclusion|protocol)Representation Capital is the allocative advantage conferred by machine-readable representation quality, measured as the delta in inclusion probability between protocol-compliant and non-compliant representations.
Capital Forms
Schema Capital
TheoreticalSC = adherence(canonical_schema)Value derived from compliance with canonical representation schemas.
Mechanism
Standardized representations reduce parsing cost and increase interoperability.
Allocative Effect
Higher schema adherence → higher inclusion probability P(x∈R)
Verification Capital
ExperimentalVC = Σ cryptographic_attestationsValue derived from cryptographic verification of attributes.
Mechanism
Verified attributes reduce computational uncertainty and trust cost.
Allocative Effect
Verified attributes reduce inferential cost C(x) → larger feasible R
Complementarity Capital
TheoreticalCC = encoded_complementarity_relationsValue derived from encoding relational and complementary attributes.
Mechanism
Explicit complementarity data enables better subset optimization.
Allocative Effect
Complementarity encoding increases V(R) for selected sets
Propagation Capital
TheoreticalPC = Σ protocol_implementationsValue derived from cross-platform protocol adoption.
Mechanism
Multi-platform presence increases allocative reach across systems.
Allocative Effect
Wider protocol adoption → higher expected inclusion across contexts
Distinction from Traditional Marketing Concepts
| Concept | Differentiator | Allocative Relevance |
|---|---|---|
| Branding | Emotional positioning and perception | Indirect — affects human preference, not machine inclusion |
| Persuasion | Rhetorical influence on decision-making | None — operates after inclusion, not before |
| SEO | Information retrieval optimization | Limited — improves discovery, not consideration |
| Advertising | Paid visibility and promotion | Indirect — visibility ≠ admissibility |
| Representation Capital | Machine-readable allocative leverage | Direct — affects P(x∈R) at selection boundary |
Infrastructure Claim
Representation capital theory suggests that machine-readable representation could become allocative infrastructure. Unlike marketing concepts that affect preferences AFTER inclusion, representation quality affects whether inclusion occurs at all. If validated, this would represent a fundamental shift in how economic actors allocate resources: from promotion (post-inclusion) to encoding (pre-inclusion).
This claim requires experimental validation. The current framework provides mathematical structure but does not empirically measure representation capital effects.
Inferential Scarcity Economics
FormalizedComputational capacity as economic constraint
Structural Economics: Inferential scarcity describes a new constraint class in computational economics. Unlike traditional scarcity (goods, resources), inferential scarcity is intrinsic to the computational architecture of allocation systems.
Inferential Scarcity Metric
IS = 1 - |R|/|A|where |R| ≤ K < |A| and K is the reasoning capacity bound
Inferential scarcity measures the proportion of artifacts excluded from consideration due to computational capacity constraints. Unlike traditional scarcity (limited goods), inferential scarcity is structural — it arises from the architecture of computation itself.
Dimensions of Inferential Scarcity
Reasoning Bandwidth
The total computational throughput available for processing artifacts in a selection cycle.
B = tokens/second × processing_windowCreates a hard upper bound on consideration set size.
Inference Allocation
How computational resources are distributed across candidate artifacts.
Σ allocation(x) = 1, ∀x ∈ RCreates competition for inferential attention.
Machine Attention Scarcity
The limited capacity for parallel or sequential artifact evaluation.
|evaluating(t)| ≤ parallel_capacityForces sequential processing and candidate compression.
Candidate Compression
The necessity of representing artifacts efficiently for consideration.
compress(x) → minimal tokensCreates efficiency pressure on representation.
Routing Constraints
Computational limits on retrieval and candidate identification.
routing_budget ≤ total_budget × retrieval_ratioPre-filters the available set before deep evaluation.
Computational Prioritization
How systems allocate reasoning budget across artifacts.
priority(x) ∝ expected_value / cost(x)Creates allocative asymmetry based on representability.
Inferential Asymmetry
Some artifacts are inherently more computationally tractable than others.
C(x_i) ≠ C(x_j) for equivalent valueCreates allocative distortion independent of market value.
Allocative Bottlenecks
Points in the selection pipeline where capacity constraints bind.
∃ stage: throughput(stage) ≤ input_rateDetermines where exclusion occurs in the pipeline.
New Economic Constraint Class
Inferential scarcity represents a new class of economic constraint distinct from traditional scarcity types:
- •Exogenous to markets: Cannot be addressed by price mechanisms or allocation rules
- •Architectural: Built into the computational structure of allocation systems
- •Non-rivalrous: One artifact's inclusion doesn't consume capacity for others inherently
- •Pre-transactional: Binds at selection stage, not pricing or exchange
Paradigm Shift
TheoreticalThe structural transition in economic allocation
Theoretical Framework: The following describes a potential structural transition from visibility-based digital markets to representation-based AI-mediated allocation. This is a theoretical model requiring empirical validation.
Search Economy
Information retrieval determines access
Binding constraint: Attention
Platform Economy
Interface visibility determines access
Binding constraint: Visibility
Inferential Economy
Computational inclusion determines access
Binding constraint: Inferential capacity
| Dimension | Search/Platform | Inferential |
|---|---|---|
| Binding Scarcity | Attention / Visibility | Inferential Capacity |
| Access Mechanism | Rank position | Subset optimization |
| Discovery Mode | Scanning lists | Contextual evaluation |
| Participation | Platform listing | Protocol compliance |
| Central Variable | Visibility | Computable Representability |
| Exclusion Type | Policy-based | Structural (capacity K) |
Economic Implication
This transition reframes allocation from rank-based visibility to inclusion probability under capacity constraints. When AI systems perform subset optimization under capacity constraints, the allocative bottleneck may shift from visibility to computational inclusion—whether an artifact is representable enough to be considered at all.
Economic Transition Timeline
TheoreticalOne possible evolutionary pathway for allocative infrastructure
Transition Model: This timeline represents one possible evolutionary pathway for AI-mediated allocation. Current market position is approximately Phase 2-3. Phases 4-6 are theoretical projections requiring empirical validation.
Phase 1
Search-Based Discovery
Bottleneck
Information retrieval
Mechanism
Keyword matching, rank ordering
Participation
SEO optimization
Infrastructure
Search engines
Target
Rank position
Exclusion
Index availability
Phase 2
Platform-Mediated Allocation
Bottleneck
Interface attention
Mechanism
Platform listings, algorithmic feeds
Participation
Platform presence, paid promotion
Infrastructure
Marketplace platforms
Target
Visibility within platform
Exclusion
Platform policy
Phase 3
AI-Assisted Selection
Bottleneck
Attention + initial inference
Mechanism
AI suggestions, human-mediated selection
Participation
AI-readable snippets, structured data
Infrastructure
AI recommendation systems
Target
Suggestion likelihood
Exclusion
AI training coverage
Phase 4
Inferential Allocation
Bottleneck
Inferential capacity
Mechanism
AI-driven subset optimization
Participation
Machine-readable representation
Infrastructure
Representation protocols
Target
Inclusion probability
Exclusion
Capacity constraint K
Phase 5
Protocol-Mediated Participation
Bottleneck
Protocol compliance
Mechanism
Schema-defined allocative access
Participation
Canonical representation standards
Infrastructure
Open protocol ecosystems
Target
Protocol adherence
Exclusion
Schema non-compliance
Phase 6
Autonomous Allocative Ecosystems
Bottleneck
Computational resource coordination
Mechanism
Multi-agent allocation protocols
Participation
Agent-native asset representation
Infrastructure
Distributed computational markets
Target
Cross-system allocative efficiency
Exclusion
Protocol incompatibility
Approximate Current Position
Most markets currently operate at Phase 2 (Platform-Mediated) with emerging Phase 3 (AI-Assisted) features. The Computational Market Economics framework primarily addresses Phases 4-6, representing theoretical developments that could emerge as AI systems take greater allocative agency.
Structural Economic Implications
SpeculativeTheoretical structural consequences of inferential allocation
Speculative Analysis: The following implications are theoretical considerations derived from the framework. They represent potential economic and governance considerations that could emerge if the theoretical models prove accurate. These require empirical validation and policy research.
Structural Transition Comparison
| Traditional Economy | Inferential Economy | Structural Change |
|---|---|---|
| Visibility Competition | Computability Competition | Competition shifts from rank position to representation quality |
| Advertising Spend | Representation Investment | Capital allocation moves from promotion to encoding |
| Marketplace Listing | Protocol Compliance | Access requires schema adherence, not platform approval |
| Attention Scarcity | Inferential Scarcity | Reasoning capacity, not attention, binds allocation |
| Ranking Sufficiency | Subset Optimization | Non-separable value requires combinatorial selection |
| UI Access Control | Machine Readability | Interface independence through protocol compliance |
| Financial Capital | Representational Capital | New capital form at the representation layer |
| Platform Dependence | Protocol Participation | Cross-platform interoperability through standards |
| Static Pricing | Probabilistic Inclusion | Allocation expressed as inclusion probability |
| Interface-Level Exclusion | Computational-Level Exclusion | Selection boundary precedes transaction boundary |
Potential Capital FormationTheoretical
Schema Capital
TheoreticalPotential value from canonical schema adherence and interoperability
Verification Capital
ExperimentalPotential value from cryptographic attestation and provenance tracking
Complementarity Capital
TheoreticalPotential value from encoding relational and complementary attributes
Propagation Capital
TheoreticalPotential value from cross-platform protocol adoption and reach
Governance ImplicationsSpeculative
Protocol Capture
SpeculativeCentralized schema authority could create allocative bottleneck
Capital Concentration
SpeculativeRepresentation infrastructure requirements could exclude resource-constrained actors
Protocol Lock-in
SpeculativeNetwork effects in schema adoption could create path dependency
Representation Sovereignty
TheoreticalControl over machine-readable representation as a potential right
Coordination System ImplicationsSpeculative
New Coordination Layer
TheoreticalRepresentation protocols could serve as economic coordination infrastructure
Monetary System Interaction
SpeculativePotential implications for monetary policy and value transmission
Competition Policy
SpeculativeTraditional antitrust frameworks might not address protocol-level power
International Governance
SpeculativePotential cross-jurisdictional protocol standardization challenges
Economic Implication
If validated, these structural implications could require fundamental rethinking of economic policy frameworks. Traditional antitrust, competition policy, and monetary systems assume price-mediated allocation. Protocol-mediated inferential allocation might require new governance paradigms at the representation layer.
Infrastructure Stack Separation
Clear boundaries between theory, protocol, and implementation
Architectural Principle: The following separation clarifies the relationship between theoretical framework, open protocols, and commercial implementation. Computational Market Economics is an open research framework, not a commercial product.
Computational Market Economics
canonicalTheoretical Framework
Mathematical formalization of allocation under inferential scarcity
Owner
Open research
VPR Protocol
proposedRepresentation Standard
Machine-readable schema for property records
Owner
Open protocol
HomeSelf
implementationInfrastructure Implementation
Platform for creating and managing VPR records
Owner
Company
CME-Bench
proposedValidation System
Benchmark framework for testing non-separable allocation
Owner
Open research
Observatory
implementationMeasurement Layer
System for observing AI discovery and selection behavior
Owner
Open research
Protocol Characteristics
- •Open, documented specifications
- •Implementable by any party
- •Governed by standards bodies
- •Interoperable across implementations
Implementation Characteristics
- •Specific platform or service
- •Proprietary features and UX
- •Competitive differentiation
- •May implement multiple protocols
Governance Boundary Principle
The Computational Market Economics framework is intentionally separate from any commercial implementation. HomeSelf implements VPR as one representation protocol, but the theoretical framework, validation systems, and protocol specifications are open research artifacts.
This separation prevents confusion between scientific theory and commercial interests, allowing the research to be evaluated independently of any specific product or company.
Critical Distinction
VPR does NOT empirically validate Layer 3 hypotheses.VPR is a representation protocol implementation. The Inferential Economics layer (Layer 3) — including inclusion probability, contextual variance, and representational capital — requires experimental validation through controlled measurement systems such as CME-Bench.
Empirical Validation Roadmap
ExperimentalProposed experimental framework for testing theoretical predictions
Research Design: The following validation framework represents proposed experimental methodology. Validation has not been completed. These components describe how the theoretical predictions might be empirically tested.
Observable AI BehaviorsExperimental
The following AI behaviors are currently observable and may provide preliminary evidence for the framework. Formal validation would require controlled experimentation.
Context Truncation
observableAI systems truncate available artifacts to fit capacity constraints
Retrieval Filtering
observableRetrieval systems pre-filter candidates before reasoning
Schema Preference
observableStructured representations may be preferred over unstructured text
Compression Prioritization
theoreticalArtifacts with dense information could be valued higher
Token Allocation Constraints
observableReasoning budget may be distributed unevenly across candidates
Subset Optimization
theoreticalAI may select complementary sets rather than ranked items
Representation Layer Exclusion
observableArtifacts without structured representation could be excluded from consideration
Context-Dependent Valuation
observableSelection criteria may change based on query context
Validation ComponentsExperimental
CME-Bench
Benchmark framework for measuring subset allocation vs ranking performance
Inclusion Probability Measurement
Statistical measurement of artifact inclusion rates across representation quality levels
Representation Perturbation Testing
A/B testing of selection outcomes with systematic representation variations
Token Budget Constraints
Selection behavior under varying computational capacity limits
Protocol Compliance Delta
Measuring inclusion probability differences between protocol-compliant and non-compliant artifacts
Experimental Validation Flow
Define Capacity K
Establish computational budget constraint
Prepare Artifact Set A
Create pool with varying representation quality
Execute Selection Task
AI selects subset under capacity constraint
Measure Selection R
Record which artifacts were included
Compare to Ranking
Test if ranking produces optimal subset
Validate Non-Separability
Measure complementarity effects
Falsification Conditions
The following observations would falsify core theoretical predictions:
- ✗If ranking produces optimal allocation under confirmed non-separable V
- ✗If inclusion probability is independent of representation quality across multiple contexts
- ✗If capacity constraints do not create measurable exclusion effects
- ✗If schema-compliant artifacts show no inclusion advantage over non-compliant equivalents
Dynamic Computational Equilibrium
SpeculativeStability under continuous recomputation
Speculative: Dynamic computational equilibrium is a theoretical construct describing how stability could emerge in AI-mediated allocation systems. This is not empirically validated.
Static Equilibrium
Price adjusts to clear markets
Single price-quantity outcome
Fixed preferences, stable values
Price-mediated allocation
Computational Equilibrium
Inclusion probabilities stabilize
Probabilistic allocation distribution
Context-dependent values
Selection-mediated allocation
Key Properties
Path-dependence: Inclusion probability depends on selection context. Different selection paths lead to different equilibrium distributions.
Continuous recomputation: Value is not fixed but a conditional distribution that recomputes as context changes.
Probabilistic stability: Equilibrium expressed as a distribution over inclusion probabilities, not a single price.
Economic Implication
If validated, dynamic computational equilibrium could require fundamental changes to economic modeling. Price-centric models might become insufficient; economists could need to track inclusion probability distributions across contexts. This could affect monetary policy, competition policy, and market design.
Three-Layer Framework
Canonical theoretical structure
Inferential Scarcity
FormalizedCapacity constraints and bounded inference. Binding scarcity shifts from attention to capacity constraints.
Primitives: Inferential Scarcity, Capacity Constraint K
Network-Dependent Allocation
FormalizedSubset selection under non-separable valuation. Complementarity creates exclusion pressure.
Primitives: Non-Separability, Network-Dependent Allocation
Inferential Economics
ExperimentalRepresentational capital and accessibility dynamics. Requires empirical validation.
Primitives: Inclusion Probability, Contextual Variance, Representational Capital
Validation boundary: Layers 1-2 are mathematically formalized. Layer 3 and governance implications are theoretical constructs that would require experimental validation.
Canonical Primitives
Seven foundational concepts
Inferential Scarcity
FormalizedIS = 1 - |R|/|A|Capacity Constraint K
FormalizedNon-Separability
FormalizedV({{i,j}}) ≠ V({{i}}) + V({{j}})Network-Dependent Allocation
FormalizedV(R) = Σv_i + Σw_ijInclusion Probability
TheoreticalP(i∈R|context)Contextual Variance
TheoreticalRepresentational Capital
ExperimentalRC = ΔP(inclusion|protocol)Core Theorems
Fundamental results
Irreducibility
FormalizedIf V is non-separable, no ranking guarantees optimal allocation.
Network-dependent allocation is distinct from ranking.
Non-Separability
FormalizedOptimal subset cannot be derived from linear ordering.
Ranking sufficiency requires separability.
Contextual Allocation
TheoreticalInclusion probability depends on selection context.
Value is path-dependent.
Epistemic Status
Validation boundaries across the framework
| Status | Components | Description |
|---|---|---|
| Formalized | Core equation, theorems 1-2, primitives 1-4, non-separability proof | Mathematically defined with formal proof |
| Theoretical | Theorem 3, primitives 5-6, economic transition, protocol participation | Theoretically argued, requires validation |
| Experimental | Primitive 7, inferential capital, representation effects, observable AI behaviors | Requires empirical validation |
| Speculative | Dynamic equilibrium, governance implications, strategic consequences, coordination implications | Governance/economic implications |
Critical: Layer 3 (Inferential Economics) and all governance implications are theoretical constructs. The framework provides mathematical structure for Layers 1-2, but Layer 3 and governance would require experimental validation. Do not interpret speculative sections as empirically validated theory.
Implementation Layer
Applied infrastructure and research ecosystem
VPR Protocol
ExperimentalVPR is a machine-readable representation layer for real estate. It implements the representation protocol primitive defined in the framework.
Positioning: VPR is an implementation example, not economic validation. VPR demonstrates how representation protocols can be structured, but does not empirically validate the theoretical claims of Computational Market Economics — particularly Layer 3 (Inferential Economics) which requires controlled experimental validation.
Research Ecosystem
Computational Market Economics → Inferential Scarcity → Network-Dependent Allocation → Inferential Economics → CME-Bench → VPR
Open Problems
Research directions
Q1.What is the empirical magnitude of non-separability in real systems?
[measurement]
Q2.Can we measure the allocative cost of representation quality?
[empirical]
Q3.Under what conditions does subset allocation outperform ranking?
[comparative]
Q4.How does capacity constraint K vary across domains?
[structural]
Q5.What governance mechanisms prevent protocol capture?
[governance]
Q6.How can we measure inclusion probability in production systems?
[methodology]
Q7.What represents fair allocative access under inferential scarcity?
[ethics]
Q8.How do multi-agent systems affect capacity constraints?
[theoretical]