In Ad Network scenarios, multiple DSPs (Demand Side Platforms) participate in auctions, typically under a First Price Auction (FPA) mechanism. To optimize performance, DSPs often employ Bid Shading techniques to maximize their ROI and revenue while maintaining a competitive level of inventory acquisition.

Bid Shading is a specialized technique developed for first-price auctions. Since the final clearing price equals the submitted bid (i.e., pay-as-you-bid), bidding one’s true valuation often leads to “winner’s curse” or overpayment, resulting in capital inefficiency. Consequently, Bid Shading leverages historical data to estimate win rates or the “market price” (the second-highest bid) to dynamically shade the bid. This ensures the final payment is lower than the original valuation but higher than the second-highest bid, effectively reducing costs and boosting ROI without sacrificing win probability.

In feed mixed ranking (MixRank) scenarios, various business lines (such as Ads, E-commerce, Live Streaming, Short Video, and Articles) provide a “PK Score” for ranking during each request. From a mechanism standpoint, this PK Score is functionally equivalent to a bid in an advertising system: the PK Score can be viewed as an “implicit bid” submitted by a business entity for an exposure opportunity.

Naturally, this raises a question: Can we adapt the principles of Bid Shading to systematically calibrate PK Scores and optimize overall mixed ranking utility? Theoretically, this is highly feasible. This article introduces Score Shading—a method of applying dynamic perturbations (shading) to PK Scores to identify the globally optimal “bidding point.” By doing so, the system maintains competitiveness while maximizing platform-wide revenue, specifically addressing two core objectives:

Problem One: Enhancing the penetration rate (load growth) of specific content formats in high-value traffic by increasing their “participation-to-exposure” ratio.
Problem Two: Reducing the scale (i.e., the cost) of a specific format’s PK Score while keeping the overall win rate (load) stable and within a reasonable range.

This article will first review Bid Shading modeling in Ad Networks, then generalize it to mixed ranking Score Shading. We will explore optimization modeling for both objectives, the Lagrangian dual solution, and the regulation mechanism for the pacing parameter λ. Finally, we will discuss critical challenges such as win-rate modeling and incentive compatibility.

Bid Shading Methodology

From the perspective of a DSP in an Ad Network, the Bid Shading problem is typically modeled as the following optimization task: maximizing value (cost) subject to a target profit margin constraint (1 - media payout / revenue).

\[ \begin{aligned} \max_{x_i} \quad & \sum_{i} C_i F(x_i) \\ \text{s.t.} \quad & \sum_{i} x_i F(x_i) \le K \sum_{i} C_i F(x_i) \end{aligned} \]

The notation is defined as follows:

• \(C_i\): The intrinsic value of the \(i\)-th traffic unit (usually synonymous with valuation in Ad Networks).
  
• \(x_i\): The bid price submitted by the DSP for the current request.
  
• \(F(x_i)\): The win rate (probability of winning) given bid \(x_i\).
  
• \(K\): The target profit margin constraint.

Using the method of Lagrange multipliers, we construct the following Lagrangian, where \(\lambda\) is the multiplier (\(\lambda > 0\)):

\[\mathcal{L}(x_i, \lambda) = \sum_i C_i F(x_i) - \lambda \left[ \sum_i x_i F(x_i) - K \sum_i C_i F(x_i) \right]\]

Rearranging the terms yields:

\[\mathcal{L}(x_i, \lambda) = \sum_i F(x_i) \left[ (1 + \lambda K)C_i - \lambda x_i \right]\]

The role of \(\lambda\) is to ensure the constraint is satisfied. In production environments, \(\lambda\) is often adjusted dynamically via a controller (such as a PID) to ensure the actual profit rate (TAC) aligns with expectations. However, within a specific time slice, \(\lambda\) remains constant. Thus, for each online request, the system selects the optimal bid \(x_i^*\) that maximizes the Lagrangian \(\mathcal{L}\):

\[x_i^*= \arg\max_{x_i}\;F(x_i)\left[(1+\lambda K)C_i - \lambda x_i\right]\]

How should \(\lambda\) be regulated? We can further reformulate the objective as follows:

\[\mathcal{L} = \sum_i \cdot F(x_i) \left[C_i + \lambda(KC_i-x_i) \right]\]

If the actual TAC exceeds the target \(K\) (i.e., DSP profit is below expectations), \(\lambda\) is increased. In this state, choosing an excessively high bid \(x_i\) would penalize \(\mathcal{L}\), forcing the system to naturally select a lower bid \(x_i\) to restore the profit margin. Conversely, \(\lambda\) is decreased to enhance the DSP’s competitiveness and volume acquisition.

Score Shading Strategy

In mixed ranking, each business line’s PK Score can be treated as its bid for a given request. Building upon the Bid Shading paradigm, we can model the following scenarios. First, we define several core variables:

• \(V\): The value term—the business utility gained if a specific format wins the exposure, defined by the business entity.
  
• \(s\): The PK Score, which serves as the “cost” or “shadow price” for winning the auction.
  
• \(F(s)\): The win rate model, representing the probability of winning given a score \(s\).
  
• \(C\): The business cost constraint (often a proxy for long-term user value like LT, which is difficult to optimize directly).

Using these symbols, we model the following two problems respectively:
- Problem One: On high-value traffic, increase the conversion of specific formats from “not shown” to “shown,” boosting format penetration (load growth).
- Problem Two: While maintaining a stable overall win rate (load), reduce the scale or cost of a format’s PK Score to keep it within an efficient range.

Problem One: Improving Penetration

This objective is defined as maximizing the expected utility of each auction while ensuring the aggregate cost (PK Score) remains within a specified budget or constraint.

\[ \begin{aligned} \max_{s_i} \quad & \sum_{i=1}^{n} V_i F(s_i) \\ \text{s.t.} \quad & \frac{1}{n}\sum_{i=1}^{n} s_i F(s_i) \le C \end{aligned} \]

The critical challenge here is defining the constraint \(C\). While Long-Term Value (LTV/LT) is the fundamental constraint, its long feedback loop and high volatility make it unsuitable for real-time control.

Furthermore, since mixed ranking systems often impose limits on the distribution of PK Scores (e.g., ensuring p90 or p99 values remain comparable across business lines), we use the winning PK Score as the direct constraint. Theoretically, mean, P90, and P99 each require individual constraints, but for simplicity, we model the mean constraint here.

Using the Lagrangian dual approach, we derive the following function:

\[\mathcal{L}(s_i,\lambda)=\sum_{i=1}^{n} V_i F(s_i) - \lambda \left(\sum_{i=1}^{n} s_i F(s_i) - nC\right)\]

Rearranging gives:

\[\mathcal{L}=\sum_{i=1}^{n} F(s_i) \left(V_i - \lambda s_i\right)+ \lambda nC\]

Since \(C\) is constant, it can be omitted. For the \(i\)-th request, we simply choose \(s_i^*\) to maximize the following objective, where \(\lambda\) acts as the pacing coefficient to keep the average PK Score within bounds (multiple constraints would imply multiple \(\lambda\) values):

\[s_i^*=\arg\max_{s_i}\;F(s_i)\left[(V_i - \lambda s_i) \right]\]

Problem Two: Cost Reduction

In this scenario, the goal is to minimize the PK Score while keeping the business utility constant. The problem is formalized as follows, where we minimize the PK Score (mean) subject to a win rate constraint \(T\) (a proxy for load).

\[ \begin{aligned} \min_{s_i} \quad & \frac{1}{n}\sum_{i=1}^{n} s_i F(s_i) \\ \text{s.t.} \quad & \frac{1}{n}\sum_{i=1}^{n} F(s_i) = T \end{aligned} \]

Through Lagrangian derivation, we obtain the dual function:

\[\mathcal{L}(s_i,\lambda)=\frac{1}{n}\sum_{i=1}^{n} s_i F(s_i)+\lambda \left(\sum_{i=1}^{n} F(s_i) - nT \right)\]

The decision goal is to select \(s_i^*\) for each request that minimizes the following, where \(\lambda\) is the pacing coefficient for the win rate:

\[s_i^* = \arg\min_{s_i}\;F(s_i) \cdot \left(s_i - \lambda\right)\]

Here, \(\lambda\) effectively functions as the “marginal value of a win” or a “price threshold.” Analyzing \(F(s_i) \cdot (s_i - \lambda)\), two cases arise:

1. If the traffic is “cheap” (\(s_i < \lambda\)): The term \((s_i - \lambda)\) is negative. To minimize this (make it more negative), we want \(F(s_i)\) to be as large as possible—i.e., bid higher to win the “bargain.”
   
2. If the traffic is “expensive” (\(s_i > \lambda\)): The term \((s_i - \lambda)\) is positive. To minimize this, we want \(F(s_i)\) to be as small as possible (approaching 0)—i.e., bid lower or abstain from the “loss-making” auction.

In practice, \(\lambda\) is also dynamically tuned via a PID controller. If volume is insufficient (\(T\) is not reached), \(\lambda\) is increased; if volume exceeds the target, \(\lambda\) is decreased.

Key Technical Challenges

Q1: Win-Rate Modeling

Accurately modeling the win rate \(F(s)\) is the most critical component of this framework.

The most straightforward approach is to directly model the win probability given a bid, which can be implemented in two ways:

• Method One: Log Replay. Construct <bid, win/loss> pairs from historical logs and train a binary classifier (similar to a CTR model). However, this requires careful handling to ensure \(F(s)\) remains monotonic with respect to \(s\).
  
• Method Two: Curve Fitting. Perform parametric or non-parametric regression on historical statistics to better guarantee the monotonicity of \(F(s)\).

A more sophisticated approach is Distribution Estimation—instead of modeling the win probability directly, we model the probability distribution of the highest competing score in the auction, similar to the Deep Landscape Forecasting (DLF) method.

The core difference is that the former is Point Estimation, while the latter is Distribution Estimation. Point estimation only provides \(\mathbb{P}(\text{win}=1 | s, \text{context})\). To determine “how the win rate changes if I bid \(s + 0.1\),” the model must re-run inference, which is computationally expensive. More importantly, it cannot capture the uncertainty of the competitive intensity.

And methods like Deep Landscape Forecasting predict the probability distribution parameters of the opponent’s highest score (assuming it is a Gaussian distribution, with parameters \(\mu, \sigma\)). Once the distribution function is available, you can directly get the win rate under any bid through \(F(s) = \Phi(s; \mu, \sigma)\).

And in this, \(\sigma\) (variance) has a clear physical meaning: it represents the uncertainty of the current request competition. If the user-side historical features show that this user often watches live streaming (intense and unstable competition), \(\sigma\) will become larger. In the dual optimization logic, a large \(\sigma\) will automatically trigger “conservative bidding,” preventing volume loss caused by prediction bias.

For the point estimation modeling method, “almost winning (opponent score 1.01, you bid 1.0)” and “miserable defeat (opponent score 5.0, you bid 1.0)” are the same in the eyes of the model, but they can both be modeled in distribution estimation. This also makes distribution estimation characterize the “competition landscape” far more accurately than binary models, especially when you try to lower scores through Shading, DLF can more accurately tell you “to what extent lowering will encounter the dense area of competitors.”

Therefore, in the following situations, the necessity of modeling distribution methods like DLF will be relatively strong:

1) Highly uneven score distributions: If competitor scores cluster heavily under specific features (e.g., evening peaks), DLF’s descriptive power helps avoid “red ocean” competition.
2) High sensitivity to volume loss: If undershooting the load target due to aggressive shading is unacceptable, DLF’s variance \(\sigma\) provides a “safety margin” that binary models cannot.
3) Compute constraints: If you cannot afford multi-point sampling online, the “infer once, solve analytically” nature of DLF is the only viable choice.

Regarding DLF implementation, refer to Deep Landscape Forecasting for Real-time Bidding Advertising. Key technical points include:

The core of DLF lies in not directly modeling the win rate, but modeling the probability distribution \(P(Z|\theta)\) of the opponent’s highest score \(Z\). Suppose \(Z\) follows a log-normal distribution (Log-Normal), and the model outputs parameters \(\theta = (\mu, \sigma)\). The modeling details are as follows:

1. Core Definitions

• Probability Density Function (PDF) \(f(z | \theta)\): The probability that the highest competing bid is exactly \(z\).
  
• Cumulative Distribution Function (CDF) \(F(s | \theta) = P(Z < s)\): The win rate at bid \(s\).
  
• Survival Function \(S(s | \theta) = 1 - F(s | \theta) = P(Z > s)\): The probability that bid \(s\) fails to win.

2. Loss Function Derivation

In training, samples are typically Right-Censored—after a loss, we only know \(Z \ge s\). DLF utilizes a Negative Log-Likelihood (NLL) loss:

\[\text{Loss} = \sum_{i \in \text{win}} \underbrace{-\log f(Z_i | \theta_i)}_{\text{Regression on observed second-prices}} + \sum_{i \in \text{loss}} \underbrace{-\log S(s_i | \theta_i)}_{\text{Constraint on censored/lost bids}}\]

• For winners: We observe the true highest competing score \(Z_i\) (the second price) and minimize the residual via the PDF.
  
• For losers: We only know \(Z_i > s_i\). The survival function term forces the model to learn that the opponent’s distribution is concentrated above the current bid.

3. Online Analytical Decision-Making

Since \(F(s)\) is parameterized as a known distribution (e.g., \(\Phi\)), we can solve for \(s_i^*\) analytically. For Problem One, the optimal \(s\) is found by taking the first derivative and setting it to zero:

\[\frac{\partial}{\partial s} [F(s)(V - \lambda s)] = 0\]

Simplifying yields:

\[F'(s) \cdot (V - \lambda s) - \lambda F(s) = 0 \implies \frac{F(s)}{F'(s)} + s = \frac{V}{\lambda}\]

The elegance of DLF lies in the fact that \(F(s)\) and \(F'(s)\) are no longer black boxes but concrete formulas with parameters \(\mu, \sigma\). For a Log-Normal distribution:

\(\Phi\) (CDF): \(F(s) = \Phi(\frac{\ln s - \mu}{\sigma})\)

\(\phi\) (PDF): \(F'(s) = \frac{1}{s\sigma} \phi(\frac{\ln s - \mu}{\sigma})\)

This eliminates the need for expensive discrete sampling or grid searches online, allowing the system to locate the optimal shaded score in microseconds.

Q2: Feedback Loop Mitigation

When Score Shading is active, the observed “win rate” is based on already-reduced scores. As bids decrease, the competitive landscape appears “harder to win,” causing \(F(s)\) to downgrade further—leading to a “death spiral” of plummeting bids.

The standard solution is an Epsilon-Greedy exploration mechanism: allocating a small percentage of traffic to an “exploration bucket” where scores remain unshaded. This provides the ground truth needed to collect unbiased competition data.

Systemic Risks

From a single business line’s perspective, Score Shading is a perfect local optimizer. However, from a platform-wide perspective, if every business line shades independently, it triggers a game-theoretic “race to the bottom,” potentially destabilizing the entire distribution ecosystem.

Potential Pitfalls

If the platform allows every format (Short Video, Articles, E-commerce, Live Streaming) to run independent PID controllers for Score Shading, several issues arise:

(1) Score Deflation and the “Broken Window” Effect (Race to the Bottom) Suppose Articles and Live Streaming compete for the same slot. Live Streaming shades its score from 1.0 to 0.8. Articles, seeing weaker competition, shades its score from 0.9 to 0.7 to win. Live Streaming then finds it can still win at 0.6…

This leads to a severe leftward shift (deflation) of the global ranking scores (MixRank Score). Many platforms have hard “experience protection thresholds” (e.g., filtering content with Score < 0.3). Score deflation can cause high-quality content to fall below these absolute thresholds, resulting in “empty slots” (frontend gaps) or a flood of low-quality fallback content.

(2) Oscillatory Instability via Multi-PID Coupling (Oscillation & Chaos) In mixed ranking, traffic is often a zero-sum game. When Live Streaming’s \(\lambda_1\) and Short Video’s \(\lambda_2\) controllers act on the same traffic pool, they form a complex non-linear coupling. If Live Streaming slightly increases its score, Short Video’s volume (Load) instantly drops, triggering a violent compensatory reaction (score spike) from the Short Video PID.

This results in high-frequency, pulse-like oscillations in online traffic distribution—where the feed might be entirely Live Streaming one minute and entirely Short Video the next. This instability destroys user experience and creates “compute tides” that can overload backend servers.

Governance Strategies

To mitigate these systemic issues, two primary strategies exist: establishing a global “Score Anchor” or implementing a unified auction mechanism (e.g., VCG) to internalize externalities.

• Solution One: The “Global Anchor” Strategy

Without an anchor, Score Shading is like countries engaging in currency wars. Since the auction is “relative,” absolute scores can collapse infinitely. An anchor acts as the “Gold Standard” or “USD” of the mixed ranking economy. The platform mandates that a dominant core format (e.g., organic recommendation for Short Videos or Articles, accounting for >70% of traffic) is strictly prohibited from shading. Its score must 100% honestly reflect its estimated business value (True Value). Alternatively, Ads can serve as an anchor as their eCPM has a clear physical meaning and is less prone to abrupt shifts.

By fixing this anchor, all other formats (Live, E-commerce) have a “physical floor” for their shading behavior. If they shade below the anchor’s true value, they immediately lose volume. This creates a Price Floor that prevents systemic collapse and the “race to the bottom.”

• Solution Two: Unified Auction Mechanism (VCG) for Accounting

Although VCG is typically an ad-tech concept, it can be applied to all business lines to account for the “opportunity cost” one format imposes on the platform. This effectively eliminates the incentive for shading.

The core logic of the VCG mechanism is: business lines no longer pay according to their own “bid,” but pay according to the “social cost” they cause to the system. In other words, if you win, you pay for the value lost by those you displaced.

Specifically, if Business A wins a slot, the “price” it pays equals: “the total value other participants would have gained if A were absent” minus “the total value other participants gain when A is present.” For example:

Suppose there are 3 slots. With A, the optimal set is {A, B, C} with total value \(W = V_A + V_B + V_C\). The steps for VCG pricing are:

1. Calculate total value \(W\).
   
2. Simulate the system “without A.” A new business D enters, and the set becomes {B, C, D}.
   
3. A is charged the “Score Cost” \(P_A = (V_B^{new} + V_C^{new} + V_D) - (V_B^{old} + V_C^{old})\).

VCG is the gold standard for achieving Incentive Compatibility. In an incentive-compatible system, “telling the truth” (truthful bidding) is the dominant strategy—any attempt to shade or manipulate scores will harm the participant’s own interests. VCG aligns individual and platform interests perfectly:

1. If Business A overbids (Positive Shading), its cost is determined by those behind it. If its true value is lower than the clearing price, it incurs a loss.
   
2. If Business A underbids (Negative Shading), it only reduces its chance of winning without reducing the cost it pays when it does win (since its price is independent of its own bid).

Under VCG, business lines realize that shading yields no extra benefit, and only truthful reporting of estimated value maximizes their surplus.

However, despite being mathematically perfect, VCG faces massive implementation hurdles in production.

First is Computational Complexity. VCG requires simulating the “counterfactual” for every winner. For \(N\) slots, this theoretically requires \(N+1\) full ranking passes. In high-performance recommendation engines, this latency is often prohibitive.

Second is Metric Alignment. VCG assumes \(V_B + V_C\) is additive. But is 1 minute of Live Stream duration truly equivalent to 1 minute of Short Video duration? When Ads (eCPM) and E-commerce (GMV) are added, the units are inherently misaligned. If the global value function \(f(V)\) is poorly defined, VCG will generate misleading charges, causing the ecosystem to tilt dangerously toward one format and collapse.

Consequently, VCG is typically reserved for highly refined stages of platform growth where absolute fairness is the priority. In earlier stages, Solution One (Global Anchor) is usually preferred for its simplicity and agility.

Summary

This article explores the transition of Bid Shading from the advertising domain to the feed mixed ranking landscape—Score Shading. By treating PK Scores as “implicit bids,” we bridge the gap between auction theory and recommendation algorithms, providing a rigorous mathematical framework for format penetration and scale control.

The success of Score Shading rests on three pillars:

• Dual Optimization Framework: Using Lagrangian Duality to transform global business constraints into real-time decisions via PID-controlled \(\lambda\).
  
• Win-Rate Modeling: Moving beyond binary point estimation to Distribution Estimation (DLF), allowing the system to map the “competitive landscape” and solve for optimal bids analytically and efficiently.
  
• Systemic Governance: Guarding against score deflation and oscillations through Global Anchors or VCG-based incentive compatibility to align individual format goals with platform-wide health.

As mixed ranking systems evolve, simple value comparisons are being replaced by sophisticated mechanism design. Score Shading is not just a tuning trick; it is a manifestation of platform governance through mathematical modeling. Future efforts will likely incorporate Reinforcement Learning (RL) to manage even longer-cycle constraints, such as long-term retention (LT), ensuring fairness and growth across a complex multi-format ecosystem.