Virtual Valuation¶
An auction-theory transform that converts an agent value and its prior distribution into marginal revenue, enabling expected-revenue analysis through virtual surplus under stated incentive and regularity conditions.
Core Idea¶
A virtual valuation (or virtual value) is an auction-theory transform that converts an agent's private value together with a modeled distribution of values into the agent's marginal contribution to expected seller revenue. For a continuously distributed buyer value \(v\), cumulative distribution \(F\), and positive density \(f\), the standard Myerson virtual value is
It is therefore not a psychological revaluation of the item and not a second private preference. The first term is the buyer's reported value; the second is an information-rent adjustment determined by the population model. Myerson's optimal-auction analysis uses this transformation to express expected revenue as expected virtual surplus for incentive-compatible mechanisms under the model's hypotheses.
Scope of Application¶
The home scope is single-parameter Bayesian auction and mechanism design: monopoly reserve pricing, single-item auctions with asymmetric bidder distributions, procurement analogues after sign/convention changes, and algorithmic mechanism analyses that convert revenue objectives into virtual-welfare objectives. Myerson's paper treats a seller with one object and privately informed prospective buyers, deriving optimal auctions for a broad but explicit model class.
The abstraction applies when a prior is part of the problem specification. It can support a single buyer, several independently distributed buyers, and feasibility systems where maximizing virtual surplus is compatible with incentive constraints.
Clarity¶
Virtual value clarifies the distinction between welfare and revenue. Allocating to the highest raw value maximizes reported surplus under familiar assumptions. Allocating by nonnegative virtual value incorporates the expected information rent that must be left to strategic agents. The correction makes visible why a revenue-maximizing seller may impose a reserve, exclude a low type, or favor a bidder whose distribution gives a larger marginal-revenue score.
Manages Complexity¶
Direct optimization over all allocation and payment rules is difficult because incentive compatibility links outcomes across every possible report. The virtual-value representation absorbs payment consequences into a transformed objective. Under the supported envelope/payment identity, expected revenue becomes expected virtual surplus, allowing an allocation-side optimization followed by payment recovery.
Abstract Reasoning¶
For a posted price \(p\) offered to one buyer, expected revenue is
At an interior optimum with differentiable \(F\),
which is equivalent to \(\phi(p)=0\). Thus the zero of virtual value identifies a monopoly-price threshold only under the stated interior/differentiability conditions; boundary optima and irregular distributions need separate treatment.
Knowledge Transfer¶
Literal transfer occurs across auction formats and feasibility constraints that share single-parameter private types and a Bayesian revenue objective. The same transformation roles support posted pricing, single-item auctions, certain multi-unit or downward-closed environments, and procurement after adapting buyer-value to seller-cost conventions.
Conceptual transfer also occurs between auction theory and monopoly pricing. Bulow and Roberts show how optimal-auction reasoning can be interpreted through ordinary marginal-revenue economics. The transfer is disciplined: a revenue curve and incentive model must exist.
Relationships to Other Abstractions¶
Current abstraction Virtual Valuation Domain-specific
Parents (1) — more general patterns this builds on
-
Virtual Valuation is a kind of Transformation Prime
Virtual Valuation specializes
prime:transformation: the input is a private value plus its distribution, the rule subtracts an inverse-hazard information-rent term (or takes a revenue-curve slope), and the output preserves the type.
Hierarchy path (1) — routes to 1 parentless root
- Virtual Valuation → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Virtual Valuation sits in a sparse region of the domain-specific corpus (79th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Revenue Equivalence Theorem — 0.85
- Edgeworth Box — 0.82
- Perfect Competition — 0.82
- Hotelling's Law — 0.82
- Vickrey Auction — 0.81
Computed from structural-signature embeddings · 2026-09-08