Simple and Robust Quality Disclosure: The Power of Quantile Partition

Shipra Agrawal, Yiding Feng, Wei Tang

Online platforms like Upwork and Airbnb frequently use simple, percentile-based badges—such as "Top 1%" or "Top Rated Plus"—to signal seller quality. Despite the complexity of global markets, these systems remain remarkably stable. This research provides a rigorous mathematical justification for this phenomenon, proving that quantile-based disclosure policies are theoretically optimal for robustly signaling quality when market conditions are unknown.

The Challenge of Market Uncertainty

Platforms act as intermediaries, disclosing seller quality to buyers to facilitate transactions. However, designing an optimal disclosure policy is notoriously difficult because platforms often lack fine-grained knowledge of the market. Specifically, they may not know:

  1. The exact distribution of seller quality across the platform.
  2. The distribution of buyer "types" or their specific willingness to pay.
  3. The exact functional form of buyer valuations.

While traditional economic models assume the platform can tailor policies to these variables, this paper asks: What is the best disclosure rule when simplicity and robustness are the primary constraints? The authors seek a policy that performs well in the "worst case" across all possible distributions of quality and buyer preferences.

Methodology: Minimax Robustness

The researchers employ a minimax competitive ratio framework. They evaluate a disclosure policy by comparing its revenue against a "Bayesian-optimal" benchmark—a theoretical policy that possesses full knowledge of the market. The goal is to find a policy that minimizes the maximum possible gap between its performance and the benchmark.

Technical Foundations

To solve this, the authors reduced the economic problem to a geometric one:

  • Indirect Revenue Functions: They demonstrated that a seller's revenue can be summarized by a function $h(x)$ that is non-negative, non-decreasing, and convex.
  • Extreme-Point Reduction: They proved that the worst-case scenario for any policy occurs when the revenue function takes a specific "hinge" shape ($h(x) = \max\{c, x\}$). This allows the platform to optimize against a single parameter $c$ rather than an infinite space of potential buyer behaviors.
  • Fixed-Point Characterization: For a system with $K$ signals, the authors derived optimal quantile thresholds using a backward recursion and a one-dimensional fixed-point equation.

Why Quantiles Outperform Thresholds

The study’s most striking insight is that pooling by rank (quantiles) is fundamentally superior to pooling by raw quality (thresholds).

Consider a policy that signals "Quality > 8." This is fragile; if the entire market shifts or quality inflation occurs, the signal becomes useless. In contrast, a policy that signals "Top 10%" automatically adapts to the distribution of the day, maintaining its informational value regardless of market shifts.

The "Max-over-Bins" Formula

The authors provide a simple formula to calculate the robustness of any quantile partition. They found that the worst-case loss is determined by the single "weakest" bin in the partition. To minimize this loss, the optimal policy should be "top-heavy," allocating narrower, more precise quantile buckets to high-quality sellers and coarser buckets to lower-quality ones.

Key Results and Benchmarks

  • The Limit of Raw Thresholds: Monotone partitions based on raw quality (like traditional star ratings) are surprisingly ineffective in robust settings. They cannot beat a factor-2 approximation (50% of optimal revenue), regardless of how many signals are used.
  • The Efficiency of Quantiles: $K$-quantile partitions converge to optimal revenue at a rate of $1 + \Theta(1/K)$. Even the simplest policy—dividing the population into equal 10% buckets—yields a competitive ratio of exactly $1 + 1/K$.
  • Quantitative Performance:
    • With no information ($K=1$), a platform guarantees 50% of optimal revenue.
  • With five optimal signals ($K=5$), the platform guarantees 91.71% of the Bayesian-optimal revenue.
  • Real-World Validation: The authors evaluated existing systems through their framework. Upwork’s badge system (Top 1%, 3%, 10%) yields a competitive ratio of ~1.52, while Airbnb’s labels yield ~1.46, demonstrating that these platforms have intuitively converged toward robust designs.

Conclusion and Future Directions

This research confirms that the "simple" badges used by major platforms are not just concessions to user experience—they are mathematically robust tools for handling market uncertainty. While the current model assumes linear valuations and monopoly pricing, it provides a foundational framework for understanding how information should be partitioned in digital economies. Future work may extend these findings to competitive multi-seller environments and multi-dimensional quality metrics.

Summary updated

Abstract

Quality information on online platforms is often conveyed through simple, percentile-based badges and tiers that remain stable across different market environments. Motivated by this empirical evidence, we study robust quality disclosure in a market where a platform commits to a public disclosure policy mapping the seller's product quality into a signal, and the seller subsequently sets a downstream monopoly price. Buyers have heterogeneous private types and valuations that are linear in quality. We evaluate a disclosure policy via a minimax competitive ratio: its worst-case revenue relative to the Bayesian-optimal disclosure-and-pricing benchmark, uniformly over all prior quality distributions, type distributions, and admissible valuations. Our main results provide a sharp theoretical justification for quantile-partition disclosure. For K-quantile partition policies, we fully characterize the robust optimum: the optimal worst-case ratio is pinned down by a one-dimensional fixed-point equation and the optimal thresholds follow a backward recursion. We also give an explicit formula for the robust ratio of any quantile partition as a simple "max-over-bins" expression, which explains why the robust-optimal partition allocates finer resolution to upper quantiles and yields tight guarantees such as 1 + 1/K for uniform percentile buckets. In contrast, we show a robustness limit for finite-signal monotone (quality-threshold) partitions, which cannot beat a factor-2 approximation. Technically, our analysis reduces the robust quality disclosure to a robust disclosure design program by establishing a tight functional characterization of all feasible indirect revenue functions.
BibTeX
@misc{agrawal2026simple,
  author = {Shipra Agrawal and Yiding Feng and Wei Tang},
  title = {{Simple and Robust Quality Disclosure: The Power of Quantile Partition}},
  year = {2026},
  eprint = {2602.01066},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2602.01066},
}
Figure