Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal Pricing with Unreliable Signals

Published 3 Apr 2026 in cs.GT and cs.DS | (2604.02758v1)

Abstract: We study a single-buyer pricing problem with unreliable side information, motivated by the increasing use of AI-assisted decision-making and LLM-based predictions. The seller observes a private sample that may be either accurate (coinciding with the buyer's valuation), or hallucinatory (an independent draw from the prior), without knowing which case has realized. The buyer does not observe the realized signal, yet knows whether it is accurate or hallucinatory. This creates a higher-order informational asymmetry: the seller is uncertain about the reliability of his own side information, while the buyer has private information about that reliability. Adopting a consistency-robustness framework, we characterize the exact Pareto frontier of tradeoffs between consistency (performance under an accurate signal) and robustness (performance under a hallucinatory signal). We show that keeping the unreliable signal private generates substantial value, yielding tradeoffs that strictly dominate any public-signal benchmark. We further show that perfect consistency does not preclude meaningful protection against hallucination: for every prior, there exists a mechanism achieving perfect consistency together with a nontrivial robustness guarantee of $\frac{1}{2}$. Moreover, if the prior has an infinite mean or a mean of at most its monopoly price, we provide a mechanism that is simultaneously 1-consistent and 1-robust. Our results illustrate a new mechanism design paradigm: rather than relying only on information directly possessed by the designer, mechanisms can be built to leverage the other side's knowledge about the reliability of the designer's information.

Summary

  • The paper formalizes a revenue maximization problem under unreliable, AI-generated side information, establishing a Pareto frontier for consistency and robustness.
  • It introduces a consistency–robustness mechanism design that exploits the buyer's higher-order information asymmetry using randomized posted pricing.
  • The study demonstrates strong guarantees with perfect consistency and nontrivial robustness, informing pricing strategies in AI-driven marketplaces.

Optimal Pricing with Unreliable Signals: Consistency–Robustness Mechanism Design

Problem Formulation and Informational Asymmetries

This work formalizes a revenue maximization problem in the presence of unreliable, AI-generated side information. The seller aims to price a single item for a single buyer, where the buyer’s valuation vv is unknown and drawn from a commonly known distribution F\mathcal{F}. The seller observes a private signal ss which is either:

  • Accurate (s=vs = v): coincident with the buyer’s value, or
  • Hallucinatory (sFs \sim \mathcal{F}): a sample drawn independently from the prior, conveying no information about the buyer.

The critical informational asymmetry arises because the seller does not observe the regime (accurate or hallucinatory), but the buyer knows the regime (even though the observed ss remains hidden from her).

This setup reflects the increasing use of AI (notably, LLMs) for price discrimination using user-level predictions of value that may be unreliable. Mechanistically, the model adopts a consistency-robustness framework: the mechanism’s revenue performance is measured both when the signal is reliable (consistency, fraction CC of value vv can be extracted) and when the signal is unreliable (robustness, fraction RR of OPT(F)\mathit{OPT}(\mathcal{F}) can be extracted, where F\mathcal{F}0 is the revenue-optimal posted price for the prior).

Main Contributions: Pareto Frontier of Consistency–Robustness Tradeoff

The paper gives a sharp, distribution-agnostic characterization of the achievable pairs F\mathcal{F}1, fully describing the Pareto frontier of possible tradeoffs.

Mathematically, for every F\mathcal{F}2, the maximum achievable robustness F\mathcal{F}3 is

F\mathcal{F}4

The result is both achievability (there exist mechanisms for every F\mathcal{F}5) and optimality (for every F\mathcal{F}6, there exists a prior where this F\mathcal{F}7 is infeasible).

The frontier strictly dominates the baseline “public-signal” randomized strategy (where F\mathcal{F}8), which mixes between posting the signal and posting the monopoly price but fails to exploit the informational asymmetry of private signals. Figure 1

Figure 1: The blue line represents the F\mathcal{F}9 frontier, strictly dominating the ss0 public-signal benchmark (dotted red).

For the symmetric guarantee (ss1), the optimal ratio is approximately ss2, which is superior to the ss3 attained by public-signal randomization.

Mechanism Design Insights: Leveraging Private Signals and Higher-Order Information

The analysis demonstrates that keeping the signal private introduces leverage: because the buyer knows the reliability regime while the seller does not, pricing schemes can be designed to exploit this higher-order asymmetry, achieving outcomes unattainable via public signal revelation.

Key technical reductions transform the high-dimensional mechanism design LP into a one-dimensional program using the structure of the consistency constraint:

  • Consistency in the accurate regime translates to utility upper bounds in the hallucinatory regime.
  • The optimal mechanism, under general constraints, is shown to be implementable via randomized posted pricing.
  • The worst-case robustness is then captured by duality, yielding a low-dimensional optimization over step-function dual variables.

The piecewise nature of the worst-case distribution surfaces triangular or step-like forms in value space, distinct from standard triangular forms in quantile space prominent in prior-independent/prior-free models.

Strong Guarantees: Perfect Consistency, Robustness, and Best-of-Both-Worlds

The paper provides several strong results:

  • Perfect Consistency with Nontrivial Robustness: For every prior, there exists a mechanism that is 1-consistent (full value extraction in the accurate regime) and ss4-robust:
    • This is achieved via a “guess-for-discount” mechanism: the seller posts a hidden price based on ss5, allows the buyer to guess ss6, and gives a discount for a correct guess. If ss7 is accurate (the buyer knows its value), she gets the discount, otherwise, in the hallucinatory regime, the expected revenue can be analytically lower bounded.
  • Best-of-Both-Worlds: For distributions where the mean is at most the monopoly price (e.g., uniform ss8, exponential), it is possible to achieve both ss9 and s=vs = v0 simultaneously.
  • Heavy-Tailed (Infinite Mean) Distributions: For priors with infinite mean, for every s=vs = v1, there exists a mechanism "almost" attaining s=vs = v2.

These results reveal that private unreliable signals, when their reliability is known to the buyer, are a robust source of informational leverage. The contrast with public-signal models is especially apparent: in the public-signal baseline, perfect consistency and nontrivial robustness are mutually exclusive.

Structural Characterization: Worst-Case Distributions and Mechanism Form

The technical characterization of the worst-case distribution for robustness (given a dual variable s=vs = v3 and benchmark s=vs = v4) uses a three-threshold envelope, leading to the following piecewise construction:

  • Below threshold s=vs = v5: all probability on zero values.
  • In s=vs = v6: mass so that s=vs = v7.
  • In s=vs = v8: dictated by the dual variable s=vs = v9, saturating convex dual constraints.
  • Above sFs \sim \mathcal{F}0: all mass above, capturing the adversarial nature. Figure 2

    Figure 2: Illustration of the thresholds sFs \sim \mathcal{F}1 and sFs \sim \mathcal{F}2 which control where the revenue curve constraints become binding.

    Figure 3

    Figure 3: The revenue-curve constraints creating a tight envelope, determining the extremal (worst-case) distribution.

The analysis further reduces the dual optimization to step-functions, noting that extremal worst-case mechanisms are elicited by low-dimensional parameterizations. Figure 4

Figure 4: Conversion of general sFs \sim \mathcal{F}3 dual variable to a step-function, reducing the problem's complexity.

Figure 5

Figure 5: Revenue curve for the extremal worst-case distribution sFs \sim \mathcal{F}4, illustrating piecewise construction in value space.

Practical and Theoretical Implications

The results establish a new paradigm where mechanism design explicitly leverages agents’ knowledge about the reliability of the designer’s information, rather than only the information directly available to the designer. The framework presents a compelling argument for the utility of secrecy about the reliability of AI-generated or third-party side information in economic design.

Practical implications include:

  • Strategies for vendors in marketplaces with AI-driven buyer profiling; optimal use of incomplete or noisy side information.
  • Design principles: mechanisms should not always “faithfully” reveal or act on side information, but instead optimally integrate both the signal and meta-information about its reliability.

Theoretical implications:

  • Novel LP reductions suggest deeper connections between higher-order information asymmetry and mechanism smoothness.
  • Reveals a distinct separation between public information frameworks and private, higher-order knowledge settings.
  • Suggests similar approaches could extend to multi-agent, multi-item, or more general stochastic environments and broader classes of side information (mixtures between accurate and hallucinatory).

The results also open avenues in the learning-augmented algorithms literature, highlighting the tension and complementarity between robustness and adaptivity in stochastic, AI-driven environments.

Conclusion

This paper presents a comprehensive analysis of optimal pricing under unreliable, private side information, with a formal Pareto frontier for consistency and robustness, strong mechanism characterizations, and new conceptual insights into the role of higher-order information. The work marks a significant advancement in the study of mechanism design with AI-generated or unreliable predictions and opens several directions for extending these ideas to more general and dynamic market environments.

Reference: "Optimal Pricing with Unreliable Signals" (2604.02758)

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Collections

Sign up for free to add this paper to one or more collections.