alphaFeedback

WorksComputer Science

Toward User-Centered Agentic Recommendation: When Does Platform Competition Benefit Users?

AI contributions
  • generative AI tools
View details

Abstract

Conventional recommender systems operate within platform-specific catalogs, limiting access to potentially valuable resources across platforms. We propose user-centered agentic recommendation, a paradigm in which user agents compare recommendations from competing platform agents, and formalize their interaction as a repeated game. Platforms strategically modify descriptions without changing intrinsic item value, while each user agent assesses platform credibility using feedback from consumed items only. Our analysis shows that expanded resource access need not improve user welfare: strategic misrepresentation and limited verification can offset the benefits of platform competition. We quantify when platform credibility assessment allows users to benefit from broader access despite strategic exaggeration. Our analysis identifies resource and reporting conditions that guarantee higher average welfare than the original platform with an interaction budget linear in platform count. Experiments on synthetic and Amazon-grounded markets show that credibility assessment can improve finite-horizon utility, while its benefits depend on market size and mechanism parameters.

Introduction

Most recommender systems organize choice within a platform: they learn from user interactions, rank items in their own catalogs, and collect feedback on the resulting recommendations. Finding alternatives across platforms remains the user’s responsibility. Advances in large language models (LLMs) and agents suggest a different organization. Recommendation agents combine planning and tool use (Wang et al., 2024), and can interpret personal information need and mediate interactions with recommenders (Xu et al., 2025), motivating recent proposals for user-centered services and personalization beyond platform boundaries (Zhang et al., 2026; Lin et al., 2026).

In this work, we propose user-centered agentic recommendation: a personal user agent solicits recommendations from multiple platform agents to find the most relevant resource on the user’s behalf. Each platform retains its private catalog and responds independently. The user agent brings these responses together at the point of choice, without requiring competitors to share catalogs or a central service to control their resources. Recommendation thus moves from ranking within a platform already chosen by the user to comparing what different platforms offer for the same request.

This expanded access creates a new difficulty. Platforms competing for selection can improve how a resource is described without changing what the user actually receives. Platform credibility assessment offers a way to discount such mismatch, but each interaction can only verify the consumed resource, echoing the information problem of experience goods (Nelson, 1970). Adding platforms expands the set of assessments needed without increasing the feedback available to each user; strategically changing the descriptions can also make past assessments less useful. This raises a central question: When does user-centered agentic recommendation benefit users compared with staying on a single platform?

We model repeated interactions between users with different interests and platforms offering different resources. Platforms compete for exposure by changing the descriptions of their recommended resources, not the resources themselves. Correspondingly, each user agent learns from the target user’s consumption and uses this experience to assess the credibility of the platforms. We compare the utility users receive when staying on their original platform, and also against the situation when accurate item description is available.

Without the platform’s credibility assessment on the user agent side, there is a weak Nash equilibrium in which every platform claims the highest possible relevance, so that users cannot distinguish better resources through the descriptions. Credibility assessment limits this loss. Our welfare bound separates the cost of countering platforms’ strategic overstatement. Most importantly, this allows user side tolerance of adaptive descriptions, provided that the gap between reported and actual relevance stays within a specified range for each user and platform, without requiring truthful reporting.

At fixed mechanism parameters, the sample complexity of user agent’s learning about the platforms’ strategic behavior grows linearly with the number of platforms and falls inversely with interactions per user. Thus, when the benefit of accurate comparison exceeds the allowance for changing overstatement, enough feedback guarantees expected welfare at least as high as staying on the original platform. For a fixed positive margin, an interaction budget proportional to platform count suffices. A matching example shows why this cost matters: users can initially be worse off despite access to a better resource. The linear dependence cannot generally be improved for the studied mechanism.

Experiments on synthetic and Amazon dataset distinguish access to better resources from benefits users actually receive. In the synthetic market, platform credibility assessment reduces reporting losses and improves average utility over the original platform by the end of the simulated horizon. In the Amazon dataset, credibility assessment also helps correct overstatements, but observed mean utility remains below the original platform. Controlled markets connect the welfare guarantee to the feedback budget: retaining a valuable resource while adding low-value platforms requires more interactions for the guarantee utilities, and observed gains can occur before they are certified. These findings support a conditional answer to our question, not a universal benefit from competition.

Related Work

LLM-based recommendation and strategic presentation. Recommendation agents combine planning, tools, and knowledge (Wang et al., 2024), support personal instructions (Xu et al., 2025), and motivate user-centered services (Zhang et al., 2026) and cross-platform personalization (Lin et al., 2026). Magentic Marketplace studies consumer assistants interacting with competing service agents under different search and manipulation conditions [5]. Presentation affects generated-answer visibility [1], supplier promotion (Kumar and Lakkaraju, 2024; Nestaas et al., 2025), recommendation rankings [10], and shopping choices [2]; gains can diminish as adoption spreads (Puerto et al., 2025). These effects vary across strategies and models [10], rather than establishing a universally monotone response to exaggeration. We separate presentation from resource value to study welfare under repeated interaction and personal feedback.

Strategic competition and information economics. Strategic recommendation studies content-provider mediation [6], top-KK price of anarchy (Yao et al., 2023a), and welfare-aligned rewards (Yao et al., 2023b). Learning-platform competition need not align with user utility (Jagadeesan et al., 2023). Information economics examines acquisition costs (Stigler, 1961), search diversion (Hagiu and Jullien, 2011), and strategic communication [8]. In Bayesian persuasion, Collina et al. [7] identify utility and information conditions for competing providers’ equilibrium outcomes to approach aligned-provider welfare. Strategic bandits address dynamic context misreports using post-selection rewards (Kleine Buening et al., 2024b) and screen strategic click rates using post-click feedback (Kleine Buening et al., 2024a), obtaining equilibrium guarantees through screening or exclusion. We fix resource-generation rules and analyze reports under softmax choice and platform credibility assessment; Appendix D compares mechanisms in an overlapping submodel with the same observable feedback.

Credibility assessment and consumption feedback. Consumption provides quality information for experience goods (Nelson, 1970); reputation links future returns to quality incentives (Shapiro, 1983), while online feedback aggregates transaction experience [9]. The Influence Limiter uses target-specific reputations to constrain raters’ influence on predictions (Resnick and Sami, 2007). We instead use each user’s own record to correct reports about exogenous resources, guiding selection using consumed-item feedback only. Our proof bounds welfare distortion through consumption events without requiring minimum exposure. Policy-regret analyses account for how deviations affect future feedback [3]; our welfare guarantees instead apply under a bounded-gap condition.

A Model of User-Centered Agentic Recommendation

We study mm user agents (UAs) and nn platform agents (PAs) interacting over TT rounds with a fixed relevance function rr. Figure 1 illustrates the interaction and feedback.

Interaction for user $j$ in round $t$ across a user agent and multiple platform agents

Figure 1. Interaction for user jj in round tt. The UA compares recommendations from multiple PAs; after consumption, only its credibility record for the selected platform is updated.

Users and platforms. User jj and platform ii have fixed interest centers uj,ci∈Rdu_j,c_i \in\mathbb{R}^d, respectively.3 In round tt, the user draws qj,t∼Qjq_{j,t} \sim Q_j, and the platform retrieves aj,t∼Ri(⋅∣j,qj,t)a_{j,t} \sim\mathcal{R}_i(\cdot\mid j,q_{j,t}) from its private resources. The fixed rule Ri\mathcal{R}_i may deterministically select the best local query match. Retrieved items can differ across users and rounds, but their attributes remain fixed.

Relevance function. The fixed function r:Rd×Rd→[0,1]r : \mathbb{R}^{d} \times\mathbb{R}^{d} \to[0,1] gives consumption value rji,t=r(qj,t,aji,t)r_{ji,t} = r(q_{j,t}, a_{ji,t}). This value varies with the query and retrieved candidate; expectations average over their generation rules. A platform can make an unchanged resource appear more relevant through its description. To isolate this presentation effect without modeling the text itself, platform ii chooses a description intensity λi,t∈[0,1]\lambda_{i,t} \in[0,1], shared across users in round tt. We model the resulting reported relevance by the bounded interpolation

Aji,t=rji,t+λi,t(1−rji,t).(1)A_{ji,t} = r_{ji,t} + \lambda_{i,t}(1-r_{ji,t}). \tag*{(1)}

The intensity fills a fraction λi,t\lambda_{i,t} of the remaining gap to 1: zero is truthful and one reports maximal relevance, without changing rji,tr_{ji,t} or incurring a direct cost. Equation (1) models platform behavior for analysis; neither this map nor current intensities are supplied to the UA. It observes reports before choice and only the consumed candidate’s true value afterward.

Recommendation policy. For each query, the UA compares candidates from all platforms. It uses platform credibility assessment to account for inflated reports: a user-specific correction ωji,t\omega_{ji,t} summarizes overstatement observed in past consumption, giving score Sji,t=Aji,t−ωji,tS_{ji,t} = A_{ji,t} - \omega_{ji,t}. A larger correction discounts the report more heavily. Each UA maintains its own records, so different users may assess the same platform differently.

To capture choice variability at the same scores, we use the random-utility logit model ((McFadden, 1974; Yao et al., 2023a)) with fresh i.i.d. shocks εji,t∼Gumbel⁡(0,ν)\varepsilon_{ji,t} \sim\operatorname{Gumbel}(0,\nu), independent of the pre-choice state:

Ij,t=arg max⁡i∈[n]{Sji,t+εji,t}.(2)I_{j,t} = \underset{i \in[n]}{\operatorname{arg\,max}}\left\{S_{ji,t} + \varepsilon_{ji,t}\right\}. \tag*{(2)}

Gumbel noise yields tractable selection probabilities, with a larger scale ν>0\nu> 0 making choices less sensitive to score differences.

User utility. We evaluate recommendations by the true value of the consumed resource, not its reported relevance. Conditional on the pre-choice state, user jj’s expected consumption utility in round tt is

Uj,t:=Eεj,t[rjIj,t,t]=∑i=1nPr⁡εj,t(Ij,t=i) rji,t.(3)U_{j,t} := \mathbb{E}_{\varepsilon_{j,t}}[r_{jI_{j,t},t}] = \sum_{i=1}^{n} \Pr_{\varepsilon_{j,t}}(I_{j,t}=i)\,r_{ji,t}. \tag*{(3)}

The expectation holds current candidates, reports, and credibility corrections fixed; the shocks affect choice but do not enter consumption utility.

Platform utility. We measure platform payoff by value-weighted engagement, reflecting both user selection and delivered value. Under policies π=(π1,…,πn)\boldsymbol{\pi}=(\pi_1,\ldots,\pi_n), platform ii’s round payoff and cumulative objective are

ui,t=∑j=1m1{Ij,t=i}rji,t,JiT(π)=Eπ[∑t=1Tui,t].(4)u_{i,t} = \sum_{j=1}^{m} \mathbf{1}\{I_{j,t}=i\}r_{ji,t}, \qquad J_i^{T}(\boldsymbol{\pi}) = \mathbb{E}^{\boldsymbol{\pi}}\left[\sum_{t=1}^{T}u_{i,t}\right]. \tag*{(4)}

Policies may adapt to locally available history, queries, and candidates; Appendix D formalizes their information constraints.

Platform credibility assessment. Records start at ωji,1=0\omega_{ji,1}=0. At round end, the UA observes the consumed candidate’s exact value and updates only that platform’s record by exponential averaging:

ωji,t+1=ωji,t+η1{Ij,t=i}(Aji,t−rji,t−ωji,t),0<η≤1.(5)\omega_{ji,t+1} = \omega_{ji,t} + \eta\mathbf{1}\{I_{j,t}=i\}(A_{ji,t}-r_{ji,t}-\omega_{ji,t}), \qquad0 < \eta\le1. \tag*{(5)}

The rate η\eta weights each newly verified discrepancy; unselected records neither change nor decay. The credibility correction summarizes past overstatement rather than the latent intensity λi,t\lambda_{i,t}, and can lag changes in descriptions, queries, and retrieved items.

Definition 3.1 (Actual, calibrated, and original-system utility) Let ιj∈[n]\iota_j \in[n] be user jj’s original platform, fixed before outcomes and retained in the new market. Let Ij,t0I^0_{j,t} denote the choice in (2) with scores replaced by true relevance. The three average utilities are

UT(n)=1mT∑j=1m∑t=1TE[Uj,t],UT0(n)=1mT∑j=1m∑t=1TE[rjIj,t0,t],BT=1mT∑j=1m∑t=1TE[rjιj,t].(6)\begin{aligned} U_T(n) &= \frac{1}{mT}\sum_{j=1}^{m}\sum_{t=1}^{T}\mathbb{E}[U_{j,t}],\\ U_T^0(n) &= \frac{1}{mT}\sum_{j=1}^{m}\sum_{t=1}^{T}\mathbb{E}[r_{jI^0_{j,t},t}],\\ B_T &= \frac{1}{mT}\sum_{j=1}^{m}\sum_{t=1}^{T}\mathbb{E}[r_{j\iota_j,t}]. \tag*{(6)} \end{aligned}

Expectations include resource, policy, and choice randomness. Calibration uses the same candidates and noise scale, solely as an analytical reference; it provides no additional feedback to the UA. The original system retains the same candidate-generation rule but restricts each user to ιj\iota_j.

Our research question is: When does platform competition improve user utility over using a single fixed platform, so that UT(n)≥BTU_T(n) \ge B_T, and how does this depend on market size, interaction horizon, and credibility updates?

Welfare Analysis

Cross-platform access can improve available resources, but strategic reports can distort choice. Using Definition 3.1, write

Gain⁡T(n):=UT0(n)−BT,Distortion⁡T(n):=UT0(n)−UT(n).(7)\operatorname{Gain}_T(n) := U_T^0(n) - B_T,\qquad\operatorname{Distortion}_T(n) := U_T^0(n) - U_T(n). \tag*{(7)}

The change relative to the original platform decomposes as

ΔUT(n):=UT(n)−BT=Gain⁡T(n)−Distortion⁡T(n).(8)\Delta U_T(n) := U_T(n) - B_T = \operatorname{Gain}_T(n) - \operatorname{Distortion}_T(n). \tag*{(8)}

Gain⁡T\operatorname{Gain}_T measures the benefit of calibrated choice, whereas Distortion⁡T\operatorname{Distortion}_T measures the effect of reporting and credibility correction; both are signed. We examine resource opportunities and competitive distortion, then bound the loss using consumption feedback.

Resource opportunities and competitive distortion

Let Mj,t(n):=max⁡i≤nrji,tM_{j,t}(n) := \max_{i \le n} r_{ji,t} be the best candidate value for user jj in round tt. Compare nested markets on the same query and resource realization, retaining incumbent candidates when a platform enters. Abbreviating Mn=Mj,t(n)M_n = M_{j,t}(n) and x=rj,n+1,tx = r_{j,n+1,t} gives the marginal resource opportunity

Mn+1−Mn=(x−Mn)+.(9)M_{n+1} - M_n = (x - M_n)_+. \tag*{(9)}

An entrant is valuable insofar as it supplies what the existing market lacks. For a fixed entrant and resource realization, enlarging the incumbent pool weakly reduces this opportunity, without requiring independence or identical distributions.

Appendix A.§ 4 derives distributional expressions under conditional independence and growth rates under additional common-upper-tail conditions. These quantify available resources, not consumption utility.

From availability to consumption. In the calibrated benchmark, choices use true relevance but can still select a lower-value resource because of randomness. Hence

Gain⁡T(n)=1mT∑j,tE[Mj,t(n)−rjιj,t,t]−1mT∑j,tE[Mj,t(n)−rjIj,t0,t].(10)\begin{aligned} \operatorname{Gain}_T(n) &= \frac{1}{mT}\sum_{j,t}\mathbb{E}\left[M_{j,t}(n)-r_{j\iota_{j,t},t}\right] \\ &\quad- \frac{1}{mT}\sum_{j,t}\mathbb{E}\left[M_{j,t}(n)-r_{jI^0_{j,t},t}\right]. \tag*{(10)} \end{aligned}

The first term is the gain over the original platform if the user always consumes the best available resource. The second subtracts the value lost because random choice may select a worse candidate, even with accurate scores. Better available resources therefore need not translate into higher utility.

Competitive reporting can erase the comparison value. Even the value attainable under calibrated choice can be lost through strategic reporting. Disable credibility updates and keep ωji,t=0\omega_{ji,t}=0. Let πmax⁡\pi^{\max} denote the profile in which every platform always chooses the shared intensity λi,t=1\lambda_{i,t}=1.

Proposition 4.1 (Competition without credibility assessment) Under the platform payoff in (4), πmax⁡\pi^{\max} is a weak Nash equilibrium of the mechanism without credibility assessment over admissible finite-horizon policies. Its welfare is

UToff(πmax⁡)=1mT∑j,tE[1n∑i=1nrji,t].(11)U_T^{\mathrm{off}}(\pi^{\max})=\frac{1}{mT}\sum_{j,t}\mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n}r_{ji,t}\right]. \tag*{(11)}

Against competitors reporting 11, no unilateral policy achieves a selection probability above 1/n1/n. Identical reports induce uniform choice, discarding the premium from favoring better candidates (Appendix A.§ 2). This equilibrium risk motivates credibility assessment; the proposition does not assert convergence of platform learning.

Welfare protection from consumption feedback

Only consumed resources are verified, so infrequently selected platforms can retain inaccurate records. We bound the loss from actual consumption rather than require every record to become accurate. The report–value gap dji,t:=Aji,t−rji,t=λi,t(1−rji,t)d_{ji,t}:=A_{ji,t}-r_{ji,t}=\lambda_{i,t}(1-r_{ji,t}) changes with both the platform’s action and the resource. The next condition bounds its range.

Assumption 4.2 (Bounded gap amplitude) There is a deterministic δ∈[0,1]\delta\in[0,1] such that, almost surely over the induced trajectories,

max⁡s,t≤T∣dji,s−dji,t∣≤δfor all j∈[m], i∈[n].(12)\max_{s,t\le T}|d_{ji,s}-d_{ji,t}|\le\delta\qquad\text{for all }j\in[m],\ i\in[n]. \tag*{(12)}

The condition restricts variation rather than the level of overstatement, allowing large persistent discrepancies without requiring convergence. A small δ\delta is an additional condition that adaptive reporting need not satisfy. The universally valid choice δ=1\delta=1 may yield an uninformative bound.

The verification budget for one personal record is

Ψ(ν,η):=∑k=0∞[1−exp⁡(−(1−η)kν)]≤1ην.(13)\Psi(\nu,\eta):=\sum_{k=0}^{\infty}\left[1-\exp\left(-\frac{(1-\eta)^k}{\nu}\right)\right]\le\frac{1}{\eta\nu}. \tag*{(13)}

The index kk counts previous consumptions of that platform, not elapsed rounds. At η=1\eta=1, the first factor (1−η)0(1-\eta)^0 is interpreted as one, giving Ψ(ν,1)=1−e−1/ν\Psi(\nu,1)=1-e^{-1/\nu}.

Theorem 4.3 (Finite-horizon welfare guarantee) Under Assumption 4.2, the mechanism of Section 3 satisfies

UT(n)−BT≥Gain⁡T(n)−min⁡{1,nΨ(ν,η)T+δ2ν}.(14)U_T(n)-B_T\ge\operatorname{Gain}_T(n)-\min\left\{1,\frac{n\Psi(\nu,\eta)}{T}+\frac{\delta}{2\nu}\right\}. \tag*{(14)}

The same error term also bounds the absolute distortion ∣UT0(n)−UT(n)∣|U_T^0(n)-U_T(n)|.

The verification cost nΨ(ν,η)/Tn\Psi(\nu,\eta)/T decreases with accumulated consumption, while δ/(2ν)\delta/(2\nu) accounts for mismatch from changing gaps that feedback need not eliminate. The guarantee covers every admissible, possibly adaptive profile satisfying the amplitude condition, without requiring equilibrium or truthful reporting. Corollary B.4 gives the simpler transient bound n/(νηT)n/(\nu\eta T).

Why consumption feedback suffices. After separating gap variation, score errors are weighted by the actual selection probabilities. In expectation, this charges loss to consumed resources, precisely those whose records update. After kk previous consumptions, a pair’s error beyond the gap range is at most (1−η)k(1-\eta)^k, with charge at most 1−exp⁡(−(1−η)k/ν)1-\exp(-(1-\eta)^k/\nu). Its total charge is bounded by Ψ(ν,η)\Psi(\nu,\eta); summing over mnmn records and averaging over mTmT interactions yields nΨ(ν,η)/Tn\Psi(\nu,\eta)/T. No minimum exposure or unconsumed-value feedback is needed (Appendix B).

When the protected gain is positive. Theorem 4.3 answers the welfare question whenever calibrated gain covers the distortion budget. Let GG be any deterministic lower bound on Gain⁡T(n)\operatorname{Gain}_{T}(n) for the same market, temperature, and horizon.

Corollary 4.4 (A sufficient budget for user benefit) Under Assumption 4.2, if Gain⁡T(n)≥G>δ/(2ν)\operatorname{Gain}_{T}(n) \ge G > \delta/(2\nu), then UT(n)≥BTU_{T}(n) \ge B_{T} whenever

T≥nΨ(ν,η)G−δ/(2ν).(15)T \ge\frac{n\Psi(\nu,\eta)}{G-\delta/(2\nu)}. \tag*{(15)}

For a fixed positive margin G−δ/(2ν)G-\delta/(2\nu), the sufficient interaction budget grows linearly with market size; a smaller margin requires proportionally more interactions. Both the gain certificate and the amplitude condition must cover the evaluated horizon.

Appendix B.§ 5 derives explicit gain bounds under resource-separation or heterogeneous-support conditions, instantiated in Appendix E.§ 6. These expose a temperature tradeoff: less random choice exploits resource differences more strongly but increases sensitivity to gap variation. The reporting restrictions remain imposed conditions, not consequences of payoff maximization.

The cost of personalized verification

The n/Tn/T dependence reflects separate user–platform records: each additional platform creates another record, but a user supplies only TT verifications. More users add records and feedback proportionally, so the ratio does not become n/(mT)n/(mT). At η=1\eta=1, Ψ(ν,1)≤1\Psi(\nu,1) \le1 and the transient bound is n/Tn/T even at low temperature.

The following cold-start market shows this cost even with constant values and gaps (δ=0\delta= 0). It uses a prescribed maximal-reporting profile, not an equilibrium under credibility assessment.

Proposition 4.5 (Cold-start loss under market expansion). Fix c∈(0,1)c \in(0,1) and n≥4n \ge4. For one user, let the original platform have constant value cc, one additional platform have value 11, and the remaining n−2n-2 platforms have value 00. All reports equal 11, η=1\eta= 1, and all credibility corrections start at zero. For every ν>0\nu> 0, at T=⌊n/2⌋T = \lfloor n/2 \rfloor,

UT(n)≤2(1+c)n,n>2(1+c)c⟹UT(n)<BT=c.(16)U_T(n) \le\frac{2(1+c)}{n}, \qquad n > \frac{2(1+c)}{c} \quad\Longrightarrow\quad U_T(n) < B_T = c. \tag*{(16)}

The best available value nevertheless exceeds the original platform’s value by the constant 1−c1-c.

Unverified reports continue attracting consumption even after the best resource is found: initial utility can be O(1/n)O(1/n) despite a constant resource advantage (Appendix § 9).

At fixed temperature, this family also dilutes calibrated choice. With Tn=⌊n/2⌋T_n = \lfloor n/2 \rfloor and νn=1/(2log⁡n)\nu_n = 1/(2\log n) for both choice rules, however, UTn0(n)→1U^0_{T_n}(n) \to1 while UTn(n)≤2(1+c)/n→0U_{T_n}(n) \le2(1+c)/n \to0 (Corollary C.2).

In this same family, δ=0\delta= 0 and Ψ(νn,1)=1−n−2\Psi(\nu_n,1) = 1-n^{-2}. Theorem 4.3 also guarantees positive net utility at T≥CnT \ge Cn, for every fixed C>1/(1−c)C > 1/(1-c) and all sufficiently large nn (Corollary C.3). Thus a linear budget is enough and its order cannot be reduced for this mechanism and reporting family. This does not establish optimality across UA mechanisms or matching η,ν,δ\eta,\nu,\delta dependencies.

Experiments

We evaluate access gains, reporting losses and recovery through personal consumption feedback.

Comparisons and protocol. We compare the original fixed platform and cross-platform choice with or without platform credibility assessment. Evaluator-only frontiers and calibrated choice at the same temperature separate availability from selection; neither supplies UA feedback. Net utility relative to the original platform decomposes into calibrated gain and distortion as in (8).

We use 128 users, 4,096 rounds, 12 seeds, and nested markets n∈{2,4,8,16,32}n \in\{2,4,8,16,32\}. Unless stated otherwise, ν=0.1\nu= 0.1 and η=0.2\eta= 0.2. Platform behavior spans fixed heterogeneous intensities, maximal reporting, and Exp3 learning over five intensities from zero to one ([4]). Original platforms are assigned by profile–catalog affinity among the first two catalogs before queries are drawn and retained at every width.

Comparisons reuse resources and original assignments within seeds. PA actions are held fixed in fixed-policy comparisons; learning PAs adapt to separate feedback histories. We report conditional expected consumption utility, with sampled choices generating feedback, and pointwise 95% Student-tt intervals over seeds (Appendix E.§ 1).

Synthetic markets

Setup. Users and platforms have heterogeneous interest centers in eight dimensions. Each platform has 24 private items drawn around its center. For each query drawn around a user’s center, the platform samples four local items and submits the best query match. True value is cosine similarity rescaled to [0,1][0,1] (Appendix E.§ 2).

Broader access does not remove reporting losses. Expanding the market improves both the frontier and calibrated choice, yet mean utility without assessment remains below the original platform at every tested width (Figure 2, left). These trajectories illustrate the risk in § 4.1, without establishing convergence to its equilibrium.

Synthetic markets under learning PAs

Figure 2. Synthetic markets under learning PAs: gains across market widths at T=4096T = 4096 (left) and cumulative average net utility at n=16n = 16 (right).

Credibility assessment improves comparison without requiring honesty. Credibility assessment turns the negative mean gain positive by the final horizon (Figure 2, right). This does not require honesty: under fixed maximal reporting, every report remains one, yet utility exceeds the original platform (Table 1). Scores 1−ωji,t1 - \omega_{j i,t} distinguish platforms through personal feedback even when reporting actions never improve. Useful comparison need not mean exact recovery of current item values.

PAWithout assessmentWith assessmentChange
Fixed−0.007-0.0070.0550.0550.0620.062
Maximal−0.062-0.0620.0300.0300.0920.092
Exp3−0.039-0.0390.0480.0480.0870.087

Table 1. Credibility assessment effects in synthetic markets.

Learning PAs reach net gain 0.0480.048 with interval [0.039,0.058][0.039, 0.058], despite negative cumulative gain at 64 rounds. About one third of users still lose relative to the original platform, so average benefit is not universal (Appendices E.§ 4–E.§ 5).

Both broad-market environments fall outside the useful gap-amplitude guarantee at the tested temperatures (Appendix E.§ 1). Their width sweeps change resources and PA learning as well as verification, so the results describe empirical behavior rather than isolate an n/Tn/T effect.

Market size and the guaranteed benefit region. A separate controlled market tests Theorem 4.3 with an original platform, a preferred platform and weaker alternatives. We vary market width, preferred quality and reporting-range width aa. PAs draw intensities independently in [1−a,1][1-a,1] each round, without adapting to UA actions. Certificates use analytical supports, not observed extrema (Appendix E.§ 6).

Unlike broad-market expansion, weaker entrants here do not improve the best resource. Calibrated gain barely changes, but distortion rises from 0.005 to 0.056 between 4 and 32 platforms (Table 4). Changes in calibrated choice also reduce net gain, so verification costs are not isolated.

SettingCalibrated gainObserved net gainCertified lower boundCertified rounds
Base0.4930.4660.0941,465
n=4n = 40.4960.4910.137357
n=32n = 320.4890.4330.0363,034
h=0.60h = 0.600.1400.120−0.305-0.305—
h=0.75h = 0.750.3270.301−0.084-0.084—
a=0a = 00.4930.4650.316582
a=0.10a = 0.100.4930.466−0.129-0.129—

Table 4. Observed net utility and theoretical guarantees in the controlled synthetic market at T=4096T = 4096. The base is (n,h,a)=(16,0.9,0.05)(n, h, a) = (16, 0.9, 0.05); other rows change one parameter. Lower bounds are rounded down. All observed-net-gain interval half-widths are below 0.0001 over 12 seeds. A dash means no finite positive-gain budget is certified.

Widening the reporting range can remove the positive certificate with little observed net-utility change: the theorem covers all admissible policies satisfying the range condition, not just this random policy. Widening [1−a,1][1-a,1] also lowers mean intensity, so this is not an isolated variation effect. In a separate test with restricted Exp3, the first saved positive net-gain interval occurs at 128 rounds, versus 1,465 certified by Corollary 4.4. The certificate gives a guaranteed region, not the empirical benefit boundary (Appendix E.§ 6).

Amazon-grounded markets

Setup. We construct virtual markets from Amazon Reviews 2023 Musical Instruments metadata and positive training interactions ((Hou et al., 2026)). A single frozen Qwen3-Embedding-0.6B representation ((Zhang et al., 2025)) embeds 2,048 candidate products and users’ training profiles. Clustering the product vectors gives 32 private catalogs; these are virtual platforms, not observed sellers. Queries vary around each user’s profile, and each platform samples four eligible products and submits the best query match. Value is cosine similarity rescaled to [0,1][0,1], a semantic proxy rather than observed satisfaction (Appendix E.§ 3).

Smaller resource advantages change the value of access. Amazon resource frontiers improve with width, but calibrated choice has negative mean gain at every tested width under the default temperature (Figure 3, left). This contrast precedes reporting and correction: at n=16n=16, the mean frontier improvement over the original platform is 0.039 versus 0.178 in synthetic markets. Amazon’s choice gap of 0.046 exceeds this resource-access benefit ((10)).

Amazon semantic markets under learning PAs

Figure 3. Amazon semantic markets under learning PAs: gains across market widths at T=4096T=4096 (left) and cumulative average net utility at n=16n=16 (right).

Reducing distortion need not beat the original platform. Credibility assessment improves utility under all three PA conditions, including unchanged maximal reporting (Table 2). Under learning PAs, remaining distortion is smaller than in synthetic markets, but even zero distortion cannot overcome Amazon’s negative calibrated gain. The final net-gain interval, [−0.0160,0.0004][-0.0160, 0.0004], includes zero despite positive paired benefit over uncorrected reports, establishing neither average benefit nor harm relative to the original platform.

PAWithout assessmentWith assessmentChange
Fixed−0.013-0.013−0.008-0.0080.0050.005
Maximal−0.016-0.016−0.009-0.0090.0070.007
Exp3−0.014-0.014−0.008-0.0080.0070.007

Table 2. Credibility assessment effects in Amazon markets.

Choice depends on value differences relative to temperature. Lowering ν\nu from 0.1 to 0.03 on unchanged Amazon resources makes both calibrated and actual mean gains positive, although the latter interval still includes zero (Appendix E.§ 5). Under Exp3, lower temperature improves mean utility in both markets despite increasing distortion, balancing selectivity against reporting sensitivity. Net gain, not distortion alone, determines user benefit.

Sensitivity to the value proxy. Sparse observed ratings show weak or negative associations with semantic relevance in the examined cohorts. With the same retrieval process and a frozen rating-trained outcome model, credibility assessment again improves on uncorrected reports, while average net utility over the original platform becomes positive (Appendix E.8). Thus the correction benefit persists across proxies, but whether users beat their original platform depends on the outcome model; neither simulation establishes actual consumer welfare.

Discussion and Conclusion

User-centered agentic recommendation expands resource access while leaving personal feedback limited. Consumption-event accounting bounds welfare loss under platform credibility assessment without requiring minimum exposure. Resource and reporting conditions give explicit benefit regions; a cold-start family matches the linear dependence on market size for this mechanism. Parameterized experiments also expose substantial slack: failure of the certificate does not imply failure of the market.

The guarantees concern expected average welfare under fixed resource-generation rules, scalar reports, exact consumption feedback, zero-initialized records, and a bounded range of reporting discrepancies. Within this scope, the analysis quantifies how resource advantages and personal verification costs jointly determine the benefits of platform competition. Alternative-update comparisons appear in Appendix E.7. The Amazon study evaluates simulated outcomes under specified value proxies rather than observed consumer welfare.

AI use statement

We used generative AI tools to polish the manuscript, assist with writing experimental code, and help identify potential errors in the theoretical analysis. The authors take responsibility for the final content of this work, including the theoretical claims, experimental implementation, and reported results.

Resource Access: Proofs and Calibrated-Gain Bounds

Conditional choice notation. All conditional quantities below are evaluated at a realized pre-choice state, including the current queries, candidates, descriptions, and credibility records. This conditioning does not hold candidate values fixed across rounds. Write dji,t:=Aji,t−rji,td_{ji,t}:=A_{ji,t}-r_{ji,t} for the report–value gap and define

eji,t:=dji,t−ωji,t,Sji,t=rji,t+eji,t.(17)e_{ji,t}:=d_{ji,t}-\omega_{ji,t},\qquad S_{ji,t}=r_{ji,t}+e_{ji,t}. \tag*{(17)}

Let rj,t=(rji,t)i=1n\mathbf{r}_{j,t}=(r_{ji,t})_{i=1}^{n} and ej,t=(eji,t)i=1n\mathbf{e}_{j,t}=(e_{ji,t})_{i=1}^{n}. The Gumbel choice rule gives the probability map and consumption-value operator

pi(v):=exp⁡(vi/ν)∑k=1nexp⁡(vk/ν),pji,t=pi(rj,t+ej,t),(18)p_i(v):=\frac{\exp(v_i/\nu)}{\sum_{k=1}^{n}\exp(v_k/\nu)},\qquad p_{ji,t}=p_i(\mathbf{r}_{j,t}+\mathbf{e}_{j,t}), \tag*{(18)}
Uν(r,e):=∑i=1npi(r+e)ri.(19)\mathcal{U}_{\nu}(\mathbf{r},\mathbf{e}):=\sum_{i=1}^{n}p_i(\mathbf{r}+\mathbf{e})r_i. \tag*{(19)}

Here pji,tp_{ji,t} is conditional on the pre-choice state and averages only the fresh choice randomness. Actual conditional utility is Uj,t=Uν(rj,t,ej,t)U_{j,t}=\mathcal{U}_{\nu}(\mathbf{r}_{j,t},\mathbf{e}_{j,t}), and calibrated conditional utility is Uν(rj,t,0)\mathcal{U}_{\nu}(\mathbf{r}_{j,t},\mathbf{0}). Lemma B.1 derives the probabilities.

Calibrated gains from candidate moments

The frontier in § 4.1 quantifies available resources. The following optional certificate instead evaluates calibrated choice through candidate moments. For each user and round, define the mean and variance across the realized candidate values:

rˉj,t:=1n∑i=1nrji,t,Vj,t:=1n∑i=1n(rji,t−rˉj,t)2.(20)\bar{r}_{j,t}:=\frac{1}{n}\sum_{i=1}^{n}r_{ji,t},\qquad V_{j,t}:=\frac{1}{n}\sum_{i=1}^{n}(r_{ji,t}-\bar{r}_{j,t})^2. \tag*{(20)}

Proposition A.1 (Gains from calibrated comparison) For the resource process in § 3 and any ν>0\nu>0,

Gain⁡T(n)≥1mT∑j,tE[rˉj,t−rjιj,t+(1−e−1/ν)Vj,t].(21)\operatorname{Gain}_{T}(n)\ge\frac{1}{mT}\sum_{j,t}\mathbb{E}\left[\bar{r}_{j,t}-r_{j\iota_j,t}+(1-e^{-1/\nu})V_{j,t}\right]. \tag*{(21)}

No independence or identical-distribution assumption on candidate values is required.

Denote the right-hand side of (21) by GnG_n. It is one possible certificate GG in Corollary 4.4, not a requirement of that result. The first term is the change in average candidate quality relative to the original platform, and the second lower-bounds the selection premium over uniform choice. The certificate can be nonpositive even when calibrated gain is positive. Holding average-quality change and temperature fixed, a larger expected cross-platform variance raises this lower bound; it does not order the actual utilities of arbitrary markets. Expectations are taken after evaluating each query’s candidate pool.

Proof. Fix a realized candidate-value vector r∈[0,1]n\mathbf{r}\in[0,1]^n for one user and round. By the Gumbel choice identity in Lemma B.1, its calibrated conditional utility is

c:=∑i=1nrieri/ν∑i=1neri/ν.c:=\frac{\sum_{i=1}^{n}r_i e^{r_i/\nu}}{\sum_{i=1}^{n}e^{r_i/\nu}}.

Suppress the user and round indices and write

rˉ:=1n∑iri,V:=1n∑i(ri−rˉ)2,b:=c−rˉ,κ:=1−e−1/ν.\bar{r} := \frac{1}{n}\sum_i r_i,\qquad V := \frac{1}{n}\sum_i(r_i-\bar{r})^2,\qquad b := c-\bar{r},\qquad\kappa:= 1-e^{-1/\nu}.

The definition of cc gives

1n∑i(ri−c)e(ri−c)/ν=0,b=1n∑i(ri−c)(e(ri−c)/ν−1).\frac{1}{n}\sum_i(r_i-c)e^{(r_i-c)/\nu}=0,\qquad b=\frac{1}{n}\sum_i(r_i-c)\left(e^{(r_i-c)/\nu}-1\right).

We claim that, for every z∈[−1,1]z\in[-1,1],

z(ez/ν−1)≥κz2.z\left(e^{z/\nu}-1\right)\ge\kappa z^2.

For z≥0z\ge0, the inequalities ez/ν−1≥z/νe^{z/\nu}-1\ge z/\nu and 1/ν≥κ1/\nu\ge\kappa prove the claim. For z=−a≤0z=-a\le0 with a∈[0,1]a\in[0,1], concavity of a↦1−e−a/νa\mapsto1-e^{-a/\nu} implies

1−e−a/ν≥a(1−e−1/ν)=aκ.1-e^{-a/\nu}\ge a\left(1-e^{-1/\nu}\right)=a\kappa.

Multiplication by aa proves the same claim for negative zz. Since ri,c∈[0,1]r_i,c\in[0,1], it applies to each ri−cr_i-c, giving

b≥κn∑i(ri−c)2=κ(V+(c−rˉ)2)=κ(V+b2)≥κV.\begin{aligned} b\ge\frac{\kappa}{n}\sum_i(r_i-c)^2 \\ &=\kappa\left(V+(c-\bar{r})^2\right)=\kappa\left(V+b^2\right)\ge\kappa V. \end{aligned}

Thus calibrated conditional utility is at least rˉ+κV\bar{r}+\kappa V for every realized vector. Apply this inequality to rj,tr_{j,t}, subtract the same-round value rjιj,tr_{j\iota_j,t} of the original platform, and take expectations and the average over users and rounds. Definition 3.1 then yields (21). The argument uses no independence, identical-distribution, or constant-value assumption: the expectation is taken after evaluating calibrated utility and the cross-platform variance at each realized vector.

Proof of Proposition 4.1

Proof In the without-assessment mechanism, credibility corrections are identically zero. Fix any platform ii and any admissible, possibly randomized and history-dependent deviation πi′\pi'_i, while every other platform uses the constant policy λk,t=1\lambda_{k,t}=1. For every pre-choice state reached under this deviation, all rivals report 11, whereas Aji,t=rji,t+λi,t(1−rji,t)≤1A_{ji,t}=r_{ji,t}+\lambda_{i,t}(1-r_{ji,t})\le1. Fresh Gumbel choice randomness therefore gives the conditional probability

pji,t′=eAji,t/νeAji,t/ν+(n−1)e1/ν≤1n.p'_{ji,t}=\frac{e^{A_{ji,t}/\nu}}{e^{A_{ji,t}/\nu}+(n-1)e^{1/\nu}}\le\frac{1}{n}.

As rji,t≥0r_{ji,t}\ge0, the deviating platform’s conditional expected round payoff is at most

∑j=1mrji,tpji,t′≤1n∑j=1mrji,t.\sum_{j=1}^{m}r_{ji,t}p'_{ji,t}\le\frac{1}{n}\sum_{j=1}^{m}r_{ji,t}.

This holds for every shared intensity chosen by the deviation, including choices based on current candidates and all admissible past feedback. The joint query and candidate law is independent of description policies, so the resource expectations on the right are unchanged by the deviation. Summing over rounds and taking expectations yields

JiT,off(πi′,π−imax⁡)≤1n∑j=1m∑t=1TE[rji,t]=JiT,off(πmax⁡).J_i^{T,\mathrm{off}}\left(\pi_i',\pi_{-i}^{\max}\right) \leq\frac{1}{n}\sum_{j=1}^{m}\sum_{t=1}^{T}\mathbb{E}[r_{ji,t}] = J_i^{T,\mathrm{off}}\left(\pi^{\max}\right).

The equality holds because all scores equal 11 under πmax⁡\pi^{\max}, so each platform is selected with conditional probability 1/n1/n. Since the comparison covers every admissible full-horizon unilateral deviation, πmax⁡\pi^{\max} is a weak Nash equilibrium. The proof permits dependencies across platforms, users, and rounds; it does not require a fixed realized resource vector. Under the same all-maximal policy profile, each user’s conditional expected consumption value is n−1∑irji,t=rˉj,tn^{-1}\sum_i r_{ji,t}=\bar r_{j,t}. Averaging gives (11). Consequently, the difference between calibrated utility and this equilibrium’s utility is exactly the average selection premium over uniform choice. Applying the pointwise inequality proved above gives

UT0(n)−UToff(πmax⁡)≥1−e−1/νmT∑j,tE[Vj,t].(22)U_T^0(n)-U_T^{\mathrm{off}}\left(\pi^{\max}\right) \geq\frac{1-e^{-1/\nu}}{mT}\sum_{j,t}\mathbb{E}[V_{j,t}]. \tag*{(22)}

This quantifies the comparison value lost at the without-assessment equilibrium. The result does not assert dominance against arbitrary history-responsive rivals, uniqueness, or convergence of a learning process.

Marginal value of an additional candidate

Proposition A.2 (The value of an additional candidate). Fix a user, a round, and a temperature ν>0\nu>0. For values r1,…,rnr_1,\ldots,r_n, let Zn=∑i=1neri/νZ_n=\sum_{i=1}^{n}e^{r_i/\nu}, un0=uν(r,0)u_n^0=u_\nu(r,0), and Mn=max⁡i≤nriM_n=\max_{i\leq n}r_i. Adding a candidate of value x∈[0,1]x\in[0,1] changes calibrated utility by

un+10−un0=ex/νZn+ex/ν(x−un0).(23)u_{n+1}^0-u_n^0=\frac{e^{x/\nu}}{Z_n+e^{x/\nu}}\left(x-u_n^0\right). \tag*{(23)}

The corresponding frontier increment is (9).

Proof. For the calibrated choice rule, adding value xx gives

un+10=Znun0+xex/νZn+ex/ν.u_{n+1}^0=\frac{Z_nu_n^0+xe^{x/\nu}}{Z_n+e^{x/\nu}}.

Subtracting un0u_n^0 proves Equation (23). Its coefficient is strictly positive, so the sign of the increment is the sign of x−un0x-u_n^0. The frontier identity follows directly from Mn+1=max⁡{Mn,x}M_{n+1}=\max\{M_n,x\}.

Resource-frontier results and proofs

To quantify the opportunity for heterogeneous platforms, write Fji,t(x):=Pr⁡(rji,t≤x∣qj,t)F_{ji,t}(x) := \Pr(r_{ji,t} \le x \mid q_{j,t}).

Proposition A.3 (Marginal resource opportunity) Suppose candidate values are conditionally independent across platforms given qj,tq_{j,t}, with conditional CDFs Fji,tF_{ji,t} that need not coincide. Then

E[Mj,t(n+1)−Mj,t(n)∣qj,t]=∫01∏i=1nFji,t(x)[1−Fj,n+1,t(x)] dx.(24)\mathbb{E}[M_{j,t}(n+1)-M_{j,t}(n)\mid q_{j,t}] = \int_{0}^{1}\prod_{i=1}^{n}F_{ji,t}(x)[1-F_{j,n+1,t}(x)]\,\mathrm{d}x. \tag*{(24)}

At each quality threshold, the integrand is the probability that no incumbent exceeds it while the entrant does. Thus the marginal value of a platform depends on its resources relative to the entire incumbent pool, not on a representative platform distribution.

An explicit rate in market width follows under an additional common-upper-tail benchmark. Suppose the conditional distributions share right endpoint 1 and, for almost every query, satisfy

c−xα≤1−Fji,t(1−x)≤c+xα,0<x≤x0,(25)c_{-}x^{\alpha} \le1-F_{ji,t}(1-x) \le c_{+}x^{\alpha}, \qquad0 < x \le x_{0}, \tag*{(25)}

where c−,c+,α>0c_{-}, c_{+}, \alpha> 0 and x0∈(0,1]x_{0} \in(0,1] are uniform over users, rounds, queries, and a fixed nested sequence of platforms. Platforms may remain heterogeneous within these bounds.

Corollary A.4 (Growth under a common upper tail) Under the conditional independence in Proposition A.3 and the uniform tail condition (25), as n→∞n \to\infty,

E[1−Mj,t(n)∣qj,t]=Θ(n−1/α),(26)\mathbb{E}[1-M_{j,t}(n)\mid q_{j,t}] = \Theta(n^{-1/\alpha}), \tag*{(26)}
E[Mj,t(n+1)−Mj,t(n)∣qj,t]=Θ(n−1−1/α).(27)\mathbb{E}[M_{j,t}(n+1)-M_{j,t}(n)\mid q_{j,t}] = \Theta(n^{-1-1/\alpha}). \tag*{(27)}

The constants are uniform, so the same orders hold after averaging over users, rounds, and queries.

The exponent α\alpha describes the scarcity of near-optimal resources: a larger exponent gives a slower approach to the upper endpoint. These rates quantify diminishing opportunities at the market scale, although different heterogeneous entrants need not have successively smaller increments.

Proposition A.3 allows discrete or continuous candidate values. Corollary A.4 additionally requires the common-endpoint, uniform upper-tail benchmark. Given a query and a realized finite catalog, candidate values have finite support and cannot satisfy (25) with α>0\alpha> 0: a maximum below 1 violates the positive lower tail bound, whereas an atom at 1 violates the upper bound as x↓0x \downarrow0. Thus these rates do not certify the fixed-catalog experiments.

The upper-tail benchmark is nevertheless compatible with immutable items when its expectation includes random resource initialization. For example, fix a query and independently draw one item value Xi∼Unif⁡[0,1]X_i \sim\operatorname{Unif}[0,1] per platform at initialization, retaining that item forever. With r(q,a)=clip⁡[0,1](a)r(q,a)=\operatorname{clip}_{[0,1]}(a) and aji,t=Xia_{ji,t}=X_i, the conditional CDF before conditioning on the realized items is continuous uniform in every round. No item changes across rounds. More generally, any such interpretation must verify conditional independence and the tail bounds under the same conditioning. The rates describe the opportunity term in (10), not a growth law for calibrated or actual utility.

Proof. Fix a user, round, and query, and take all probabilities and expectations in this proof conditional on that query. Write Ri=rji,tR_i=r_{j i,t}, Mn=max⁡i≤nRiM_n=\max_{i\le n}R_i, and Fi(x)=Pr⁡(Ri≤x∣qj,t)F_i(x)=\Pr(R_i\le x\mid q_{j,t}). No independence across users or rounds is required.

Exact marginal opportunity. For X=Rn+1X=R_{n+1}, the pointwise identity

(X−Mn)+=∫011{Mn≤x<X} dx(X-M_n)_+ = \int_0^1 \mathbf{1}\{M_n\le x<X\}\,\mathrm{d}x

holds because all values lie in [0,1][0,1]. The same-entrant comparison in § 4.1 is also pointwise: under a common resource realization, nested nonempty incumbent sets S⊆TS\subseteq T not containing entrant kk satisfy

(Rk−max⁡i∈TRi)+≤(Rk−max⁡i∈SRi)+.\left(R_k-\max_{i\in T}R_i\right)_+ \le\left(R_k-\max_{i\in S}R_i\right)_+.

Taking conditional expectations preserves the inequality without an independence assumption. This compares the same entrant against two incumbent sets; it does not compare different entrants along a heterogeneous arrival sequence.

Tonelli’s theorem and conditional independence across platforms give

E[Mn+1−Mn]=∫01Pr⁡(Mn≤x, X>x) dx=∫01[∏i=1nFi(x)][1−Fn+1(x)] dx.\begin{aligned} \mathbb{E}[M_{n+1}-M_n]=\int_0^1\Pr(M_n\le x,\ X>x)\,\mathrm{d}x \\ &=\int_0^1\left[\prod_{i=1}^{n}F_i(x)\right]\left[1-F_{n+1}(x)\right]\,\mathrm{d}x. \end{aligned}

This proves Equation (24), including distributions with atoms.

Distance to the upper endpoint. Now impose Equation (25) with constants uniform over the nested platform sequence and all conditioning queries. Set

b=min⁡{x0,(2c+)−1/α},ρ=1−c−bα∈[1/2,1).b=\min\{x_0,(2c_+)^{-1/\alpha}\},\qquad\rho=1-c_-b^\alpha\in[1/2,1).

For Yn=1−MnY_n=1-M_n and 0<x≤b0<x\le b, conditional independence yields

(1−c+xα)n≤Pr⁡(Yn≥x)=∏i=1nFi(1−x)≤e−nc−xα.(28)(1-c_+x^\alpha)^n\le\Pr(Y_n\ge x)=\prod_{i=1}^{n}F_i(1-x)\le e^{-nc_-x^\alpha}. \tag*{(28)}

The non-strict inequality in Yn≥xY_n\ge x respects possible atoms; endpoints do not affect the tail integral. For x>bx>b, monotonicity of the CDFs gives Pr⁡(Yn≥x)≤ρn\Pr(Y_n\ge x)\le\rho^n. Hence

E[Yn]≤∫0∞e−nc−xα dx+ρn=Γ(1+1α)(nc−)−1/α+ρn.\begin{aligned} \mathbb{E}[Y_n]\le\int_0^\infty e^{-nc_-x^\alpha}\,\mathrm{d}x+\rho^n \\ &=\Gamma\left(1+\frac{1}{\alpha}\right)(nc_-)^{-1/\alpha}+\rho^n. \end{aligned}

For the lower bound, c+xα≤1/2c_+x^\alpha\le1/2 on [0,b][0,b], so log⁡(1−c+xα)≥−2c+xα\log(1-c_+x^\alpha)\ge-2c_+x^\alpha. Restricting the integral to [0,bn−1/α][0,bn^{-1/\alpha}] gives

E[Yn]≥∫0bn−1/αe−2nc+xα dx≥be−2c+bαn−1/α.\begin{aligned} \mathbb{E}[Y_n]\ge\int_0^{bn^{-1/\alpha}}e^{-2nc_+x^\alpha}\,\mathrm{d}x \\ &\ge be^{-2c_+b^\alpha}n^{-1/\alpha}. \end{aligned}

The exponentially small ρn\rho^n is dominated by n−1/αn^{-1/\alpha} as n→∞n\to\infty, proving the first rate.

Marginal rate. Subtracting two Θ\Theta bounds does not determine the order of an increment. Instead, change variables in the exact marginal formula to obtain

E[Mn+1−Mn]=∫01[∏i=1nFi(1−x)][1−Fn+1(1−x)] dx.\mathbb{E}[M_{n+1}-M_n]=\int_{0}^{1}\left[\prod_{i=1}^{n}F_i(1-x)\right]\left[1-F_{n+1}(1-x)\right]\,\mathrm{d}x.

On [0,b][0,b], apply Equation (28) to the product and the two-sided tail condition to the new platform. Beyond bb, bound the integrand by ρn\rho^n. The upper bound is

E[Mn+1−Mn]≤c+∫0∞xαe−nc−xα dx+ρn=c+αΓ(1+1α)(nc−)−1−1/α+ρn.\begin{aligned} \mathbb{E}[M_{n+1}-M_n]\le c_+\int_{0}^{\infty}x^\alpha e^{-nc_-x^\alpha}\,\mathrm{d}x+\rho^n \\ &=\frac{c_+}{\alpha}\Gamma\left(1+\frac{1}{\alpha}\right)(nc_-)^{-1-1/\alpha}+\rho^n. \end{aligned}

The corresponding lower bound is

E[Mn+1−Mn]≥c−∫0bn−1/αxαe−2nc+xα dx≥c−bα+1e−2c+bαα+1n−1−1/α.\begin{aligned} \mathbb{E}[M_{n+1}-M_n]\ge c_-\int_{0}^{bn^{-1/\alpha}}x^\alpha e^{-2nc_+x^\alpha}\,\mathrm{d}x \\ &\ge\frac{c_-b^{\alpha+1}e^{-2c_+b^\alpha}}{\alpha+1}n^{-1-1/\alpha}. \end{aligned}

These establish the second rate. Every constant depends only on (c−,c+,x0,α)(c_-,c_+,x_0,\alpha), not on platform identity, the user, round, or query. Taking expectations over queries and averaging over users and rounds therefore preserves both orders. The argument requires conditional independence, but nowhere requires identical platform distributions.

Why frontier rates are not calibrated-gain rates

Remark A.5 (A frontier rate need not be a utility rate). For an illustrative i.i.d. continuous uniform benchmark, Pr⁡(Mn≤x)=xn\Pr(M_n\le x)=x^n on [0,1][0,1], and hence

E[Mn]=∫01(1−xn) dx=nn+1.\mathbb{E}[M_n]=\int_{0}^{1}(1-x^n)\,\mathrm{d}x=\frac{n}{n+1}.

For any fixed ν>0\nu>0, the strong law of large numbers applies to the bounded variables RieRi/νR_i e^{R_i/\nu} and eRi/νe^{R_i/\nu}. Their sample means converge almost surely, and the denominator has a strictly positive limit. Thus

un0⟶∫01xex/ν dx∫01ex/ν dxalmost surely.u_n^0\longrightarrow\frac{\int_{0}^{1}xe^{x/\nu}\,\mathrm{d}x}{\int_{0}^{1}e^{x/\nu}\,\mathrm{d}x}\quad\text{almost surely.}

Since 0≤un0≤10\le u_n^0\le1, bounded convergence also gives convergence of expectations. Evaluating the two integrals,

∫01ex/ν dx=ν(e1/ν−1),∫01xex/ν dx=νe1/ν−ν2(e1/ν−1),\int_{0}^{1}e^{x/\nu}\,\mathrm{d}x=\nu(e^{1/\nu}-1),\qquad\int_{0}^{1}xe^{x/\nu}\,\mathrm{d}x=\nu e^{1/\nu}-\nu^2(e^{1/\nu}-1),

gives

E[Mn]=nn+1⟶1,E[un0]⟶1−ν+1e1/ν−1.(29)\mathbb{E}[M_n]=\frac{n}{n+1}\longrightarrow1,\qquad\mathbb{E}[u_n^0]\longrightarrow1-\nu+\frac{1}{e^{1/\nu}-1}. \tag*{(29)}

It is strictly below 1 because e1/ν−1>1/νe^{1/\nu}-1>1/\nu. This example does not impose identical distributions on the main model: even a simple access benchmark does not justify identifying the frontier rate with a calibrated-gain rate at fixed temperature.

Proofs of the Consumption-Based Welfare Results

We derive the choice probabilities and perturbation bounds, prove the consumption-based welfare guarantee, and give computable verification budgets and resource-based gain certificates.

From Gumbel choice to selection probabilities

Lemma B.1 (Gumbel choice probabilities) Conditional on the pre-choice state, let S1,…,SnS_1,\ldots,S_n be fixed scores and let εi\varepsilon_i be independent Gumbel(μ,ν)(\mu,\nu) shocks with common location μ\mu and scale ν>0\nu>0. If I=arg max⁡i(Si+εi)I=\operatorname*{arg\,max}_i(S_i+\varepsilon_i), then

Pr⁡(I=i)=exp⁡(Si/ν)∑kexp⁡(Sk/ν).\operatorname{Pr}(I=i)=\frac{\exp(S_i/\nu)}{\sum_k\exp(S_k/\nu)}.

Proof The Gumbel cumulative distribution and density are

F(x)=exp⁡[−e−(x−μ)/ν],f(x)=1νe−(x−μ)/νF(x).F(x)=\exp\left[-e^{-(x-\mu)/\nu}\right],\qquad f(x)=\frac{1}{\nu}e^{-(x-\mu)/\nu}F(x).

Ties have probability zero. Conditioning on εi=x\varepsilon_i=x and using independence gives

Pr⁡(I=i)=∫−∞∞f(x)∏k≠iF(x+Si−Sk) dx.\operatorname{Pr}(I=i)=\int_{-\infty}^{\infty}f(x)\prod_{k\ne i}F(x+S_i-S_k)\,dx.

Set y=e−(x−μ)/νy=e^{-(x-\mu)/\nu}. Then f(x) dx=−e−y dyf(x)\,dx=-e^{-y}\,dy, so reversing the integration limits yields

Pr⁡(I=i)=∫0∞exp⁡[−y(1+∑k≠ie(Sk−Si)/ν)] dy=1∑ke(Sk−Si)/ν=eSi/ν∑keSk/ν.\begin{aligned} \operatorname{Pr}(I=i) &=\int_0^\infty\exp\left[-y\left(1+\sum_{k\ne i}e^{(S_k-S_i)/\nu}\right)\right]\,dy\\ &=\frac{1}{\sum_k e^{(S_k-S_i)/\nu}} =\frac{e^{S_i/\nu}}{\sum_k e^{S_k/\nu}}. \end{aligned}

The common location cancels. For fixed true values rir_i, it follows that E[rI]=∑iPr⁡(I=i)ri\mathbb{E}[r_I]=\sum_i\operatorname{Pr}(I=i)r_i, which gives (19) upon substituting Si=ri+eiS_i=r_i+e_i. The expectation does not include the choice shock in the reward. ■

Softmax perturbations

The following lemmas provide the two comparisons used in Theorem 4.3. All vectors refer to one user and one round.

Lemma B.2 (Nonnegative reweighting). Let v∈Rnv \in\mathbb{R}^n be arbitrary base scores, z≥0z \ge0 score increments, and r∈[0,1]nr \in[0,1]^n rewards. Let p0\mathbf{p}^0 and p\mathbf{p} be the softmax distributions of vv and v+zv+z at temperature ν>0\nu> 0. Then

∣⟨p−p0,r⟩∣≤∑ipi(1−e−zi/ν)≤1ν∑ipizi.(30)\left|\langle\mathbf{p}-\mathbf{p}^0,r\rangle\right| \le\sum_i p_i(1-e^{-z_i/\nu}) \le\frac{1}{\nu}\sum_i p_i z_i. \tag*{(30)}

Proof. Put Z=∑ipie−zi/ν∈(0,1]Z=\sum_i p_i e^{-z_i/\nu}\in(0,1]. Direct normalization gives pi0=pie−zi/ν/Zp_i^0=p_i e^{-z_i/\nu}/Z. If Z<1Z<1, the vector qi=pi(1−e−zi/ν)/(1−Z)q_i=p_i(1-e^{-z_i/\nu})/(1-Z) is a probability distribution and p=Zp0+(1−Z)q\mathbf{p}=Z\mathbf{p}^0+(1-Z)\mathbf{q}. Both expected rewards lie in [0,1][0,1], so their difference is at most 1−Z1-Z in absolute value. The final bound follows from 1−e−x≤x1-e^{-x}\le x for x≥0x\ge0. If Z=1Z=1, positivity of softmax probabilities implies zi=0z_i=0 for every ii, and the distributions agree. The argument requires no relation between the base scores vv and the true rewards rr.

Lemma B.3 (Relative score perturbations). For r∈[0,1]nr\in[0,1]^n, b∈Rnb\in\mathbb{R}^n, and ν>0\nu>0, write osc⁡(x)=max⁡ixi−min⁡ixi\operatorname{osc}(x)=\max_i x_i-\min_i x_i. Then

∣Uν(r,b)−Uν(r,0)∣≤osc⁡(r)min⁡{1,osc⁡(b)4ν}.(31)\left|U_\nu(r,b)-U_\nu(r,0)\right|\le\operatorname{osc}(r)\min\left\{1,\frac{\operatorname{osc}(b)}{4\nu}\right\}. \tag*{(31)}

Proof. Let pi(s)∝exp⁡((ri+sbi)/ν)p_i^{(s)}\propto\exp((r_i+sb_i)/\nu) for s∈[0,1]s\in[0,1]. Differentiating the normalization gives

dds∑ipi(s)ri=1νCov⁡p(s)(r,b).\frac{d}{ds}\sum_i p_i^{(s)}r_i=\frac{1}{\nu}\operatorname{Cov}_{p^{(s)}}(r,b).

A random variable supported on an interval of length LL has variance at most $L^2/4: subtract the interval midpoint and bound the resulting second moment. Cauchy–Schwarz therefore bounds the absolute covariance by osc⁡(r)osc⁡(b)/4\operatorname{osc}(r)\operatorname{osc}(b)/4. Integration proves the linear bound. The other bound follows because both expected rewards lie between min⁡iri\min_i r_i and $\max_i r_i.

Proof of Theorem 4.3

We first establish the theorem’s absolute distortion guarantee:

∣Distortion⁡T(n)∣≤min⁡{1,nΨ(ν,η)T+δ2ν}.(32)|\operatorname{Distortion}_T(n)|\le\min\left\{1,\frac{n\Psi(\nu,\eta)}{T}+\frac{\delta}{2\nu}\right\}. \tag*{(32)}

Combining this bound with (8) yields (14).

Proof. Fix a trajectory on which Assumption 4.2 holds and put aji=min⁡s≤Tdji,sa_{ji}=\min_{s\le T}d_{ji,s}. This path-dependent minimum is a proof aid, not an algorithmic input. If pair (j,i)(j,i) has been selected NN times before round tt, expanding the convex-combination update (5) gives

aji[1−(1−η)N]≤ωji,t≤aji+δ,−δ≤eji,t≤δ+aji(1−η)N.(33)a_{ji}[1-(1-\eta)^N]\le\omega_{ji,t}\le a_{ji}+\delta,\qquad-\delta\le e_{ji,t}\le\delta+a_{ji}(1-\eta)^N. \tag*{(33)}

For η=1\eta=1, the product interpretation gives (1−η)N=1(1-\eta)^N=1 when N=0N=0 and 00 otherwise.

Define pre-choice auxiliary variables

bji,t=min⁡{eji,t,δ},zji,t=(eji,t−δ)+.b_{ji,t}=\min\{e_{ji,t},\delta\},\qquad z_{ji,t}=(e_{ji,t}-\delta)_{+}.

Then e=b+ze=b+z, b∈[−δ,δ]b\in[-\delta,\delta], and z≥0z\ge0. Apply Lemma B.2 between scores r+b+zr+b+z and r+br+b, and Lemma B.3 between r+br+b and rr. The first comparison is weighted by the actual selection probabilities:

∣Uν(rj,t,ej,t)−Uν(rj,t,0)∣≤∑ipji,t(1−e−zji,t/ν)+δ2ν.(34)\left|U_{\nu}(r_{j,t},e_{j,t})-U_{\nu}(r_{j,t},0)\right|\le\sum_i p_{ji,t}(1-e^{-z_{ji,t}/\nu})+\frac{\delta}{2\nu}. \tag*{(34)}

Let Ft\mathcal{F}_t be the complete pre-choice analysis state, including current values, reports, and credibility records; it is not the UA’s observation. Since δ\delta is deterministic and zz is determined by the current state, fresh choice randomness gives

E[1−e−zjIj,t,t/ν∣Ft]=∑ipji,t(1−e−zji,t/ν).\mathbb{E}[1-e^{-z_{jI_{j,t},t}/\nu}\mid\mathcal{F}_t]=\sum_i p_{ji,t}(1-e^{-z_{ji,t}/\nu}).

On the (k+1)(k+1)st selection of a pair, (33) implies z≤aji(1−η)k≤(1−η)kz\le a_{ji}(1-\eta)^k\le(1-\eta)^k. Thus, pathwise,

∑{t:Ij,t=i}(1−e−zji,t/ν)≤∑k≥0[1−exp⁡(−(1−η)kν)]=Ψ(ν,η).(35)\sum_{\{t:I_{j,t}=i\}}(1-e^{-z_{ji,t}/\nu})\le\sum_{k\ge0}\left[1-\exp\left(-\frac{(1-\eta)^k}{\nu}\right)\right]=\Psi(\nu,\eta). \tag*{(35)}

Take the triangle inequality for the averaged distortion, substitute the conditional-expectation identity, sum over the mnmn pairs, and divide by mTmT in (34). This proves (32), with truncation at 11 because both utilities lie in [0,1][0,1]. Substitution in (8) proves the net-welfare bound (14). The future-dependent ajia_{ji} enters only the pathwise upper bound, not the conditional-expectation substitution.

The welfare bound concerns expectations; the pathwise accounting step does not turn it into a realized or high-probability guarantee.

Corollary B.4 (Linearized welfare bound). Under Assumption 4.2,

∣Distortion⁡T(n)∣≤min⁡{1,nνηT+δ2ν}.(36)|\operatorname{Distortion}_{T}(n)|\le\min\left\{1,\frac{n}{\nu\eta T}+\frac{\delta}{2\nu}\right\}. \tag*{(36)}

Proof. Apply 1−e−x≤x1-e^{-x}\le x termwise in (13) to obtain Ψ(ν,η)≤ν−1∑k≥0(1−η)k=1/(νη)\Psi(\nu,\eta)\le\nu^{-1}\sum_{k\ge0}(1-\eta)^k=1/(\nu\eta), and substitute into (32).

Comparison with the without-assessment equilibrium. For the same resource market and temperature, combining (22) with (32) gives, for every admissible credibility-assessment game profile satisfying Assumption 4.2,

UT(n)−UToff(πmax⁡)≥1−e−1/νmT∑j,tE[Vj,t]−min⁡{1,nΨ(ν,η)T+δ2ν}.(37)U_T(n)-U_T^{\mathrm{off}}(\pi^{\max})\ge\frac{1-e^{-1/\nu}}{mT}\sum_{j,t}\mathbb{E}[V_{j,t}] -\min\left\{1,\frac{n\Psi(\nu,\eta)}{T}+\frac{\delta}{2\nu}\right\}. \tag*{(37)}

This follows by adding and subtracting UToff(n)U_T^{\mathrm{off}}(n). It compares the profile with the specified without-assessment equilibrium, without requiring the credibility-assessment game profile to be an equilibrium.

Evaluating the verification budget

The budget in (13) retains the nonlinear cost of changing a selection distribution. It is a property of the existing mechanism, not an additional algorithmic parameter.

Proposition B.5 (Budget evaluation and certification) For every ν>0\nu> 0, 0<η≤10 < \eta\le1, and integer K≥1K \ge1,

0≤Ψ(ν,η)−∑k=0K−1[1−exp⁡(−(1−η)kν)]≤(1−η)Kνη.(38)0 \le\Psi(\nu,\eta) - \sum_{k=0}^{K-1} \left[1-\exp\left(-\frac{(1-\eta)^k}{\nu}\right)\right] \le\frac{(1-\eta)^K}{\nu\eta}. \tag*{(38)}

Under Assumption 4.2, if a deterministic certificate GG satisfies Gain⁡T(n)≥G>δ/(2ν)\operatorname{Gain}_T(n) \ge G > \delta/(2\nu) in the evaluated market and horizon, then

T≥nΨ(ν,η)G−δ/(2ν)⟹UT(n)≥BT.(39)T \ge\frac{n\Psi(\nu,\eta)}{G-\delta/(2\nu)} \quad\Longrightarrow\quad U_T(n) \ge B_T. \tag*{(39)}

Proof. Bound the omitted terms by (1−η)k/ν(1-\eta)^k/\nu and sum their geometric tail to obtain (38). Substituting the assumed gain certificate into Theorem 4.3 and solving for TT proves (39), equivalently Corollary 4.4.

At ν=0.1\nu= 0.1 and η=0.2\eta= 0.2, this yields Ψ(ν,η)≈13.405600945\Psi(\nu,\eta) \approx13.405600945, compared with 1/(νη)=501/(\nu\eta) = 50. The refinement reduces the verification allowance but leaves the gap-amplitude requirement unchanged.

Certificates from resource and reporting conditions

Theorem 4.3 requires a gap-amplitude bound, while Corollary 4.4 also requires positive calibrated gain. The following certificates derive both from explicit resource and reporting conditions. They are sufficient conditions on a market, not extra observations supplied to the UA and not predictions of strategic behavior.

Proposition B.6 (Heterogeneous support certificate) Suppose deterministic intervals satisfy, almost surely throughout the evaluated horizon,

rji,t∈[Lji,Hji]⊆[0,1],λi,t∈[λi−,λi+]⊆[0,1].r_{ji,t} \in[L_{ji},H_{ji}] \subseteq[0,1], \qquad\lambda_{i,t} \in[\lambda_i^-,\lambda_i^+] \subseteq[0,1].

The platform intensity remains shared across users and may otherwise adapt arbitrarily. Set

δsup:=max⁡j,i{λi+(1−Lji)−λi−(1−Hji)}.(40)\delta_{\mathrm{sup}} := \max_{j,i}\left\{\lambda_i^+(1-L_{ji})-\lambda_i^-(1-H_{ji})\right\}. \tag*{(40)}

For each user choose a reference platform kjk_j, put Ljmin⁡=min⁡iLjiL_j^{\min}=\min_i L_{ji}, and define

Gjsup:=Ljmin⁡−Hjj+Ljkj−Ljmin⁡1+∑i≠kjexp⁡((Hji−Ljkj)/ν),Gsup:=1m∑j=1mGjsup.(41)\begin{aligned} G_j^{\mathrm{sup}} &:= L_j^{\min}-H_{jj}+\frac{L_{jk_j}-L_j^{\min}}{1+\sum_{i\ne k_j}\exp((H_{ji}-L_{jk_j})/\nu)},\\ G^{\mathrm{sup}} &:= \frac{1}{m}\sum_{j=1}^{m}G_j^{\mathrm{sup}}. \tag*{(41)} \end{aligned}

Then Assumption 4.2 holds with δ=δsup\delta= \delta_{\mathrm{sup}} and Gain⁡T(n)≥Gsup\operatorname{Gain}_{T}(n) \ge G_{\mathrm{sup}}. Hence, if Gsup>δsup/(2ν)G_{\mathrm{sup}} > \delta_{\mathrm{sup}}/(2\nu),

T≥nΨ(ν,η)Gsup−δsup/(2ν)⟹UT(n)≥BT.(42)T \ge\frac{n\Psi(\nu,\eta)}{G_{\mathrm{sup}}-\delta_{\mathrm{sup}}/(2\nu)} \Longrightarrow U_{T}(n) \ge B_{T}. \tag*{(42)}

Proof. The map λ(1−r)\lambda(1-r) is increasing in λ\lambda and decreasing in rr on the given domain. Therefore each pair’s gap stays in

[λi−(1−Hji),λi+(1−Lji)],[\lambda_i^{-}(1-H_{ji}),\lambda_i^{+}(1-L_{ji})],

which proves (40), simultaneously for all users under a shared platform action. Conditional on any candidate realization, calibrated choice gives

pjkj,t0=11+∑i≠kjexp⁡((rji,t−rjkj,t)/ν)≥11+∑i≠kjexp⁡((Hji−Ljkj)/ν).p^{0}_{j k_j,t}=\frac{1}{1+\sum_{i\ne k_j}\exp((r_{ji,t}-r_{j k_j,t})/\nu)}\ge\frac{1}{1+\sum_{i\ne k_j}\exp((H_{ji}-L_{j k_j})/\nu)}.

Every candidate has value at least Ljmin⁡L_j^{\min}, and candidate kjk_j has value at least LjkjL_{j k_j}. Thus calibrated conditional utility minus the original value is at least

Ljmin⁡+pjkj,t0(Ljkj−Ljmin⁡)−Hjιj≥Gsup.L_j^{\min}+p^{0}_{j k_j,t}(L_{j k_j}-L_j^{\min})-H_{j\iota_j}\ge G^{\mathrm{sup}}.

The multiplier Ljkj−Ljmin⁡L_{j k_j}-L_j^{\min} is nonnegative, so the probability lower bound preserves the inequality. Average over candidates, rounds, and users to prove (41); apply Corollary 4.4 to obtain (42).

Independence, identical distributions, and deterministic candidate values are unnecessary. The certificate is valid for any reference kjk_j, although choosing a platform with a high lower endpoint makes it useful. In particular, distinct users may have distinct reference platforms. The intervals must cover the induced distributions, not merely the values observed in one simulation. For example, if reporting lies in [1−a,1][1-a,1] and a pair’s value lies in [v−w,v+w]⊆[0,1][v-w,v+w]\subseteq[0,1], its gap range is at most

2w+a(1−v−w).(43)2w+a(1-v-w). \tag*{(43)}

This expression separates resource spread from allowed reporting variation; neither is inferred from a no-regret property.

Corollary B.7 (Resource margins and temperature) Let n≥2n\ge2. Suppose that almost surely, for every user and round, a best candidate kk satisfies

rjk,t−rjιj,t≥g>0,rjk,t−rji,t≥γ>0(i≠k).r_{j k,t}-r_{j\iota_j,t}\ge g>0,\qquad r_{j k,t}-r_{ji,t}\ge\gamma>0\quad(i\ne k).

The constants g,γg,\gamma are uniform, but kk may depend on the candidate realization. Then

Gain⁡T(n)≥g−(n−1)e−γ/ν1+(n−1)e−γ/ν.(44)\operatorname{Gain}_{T}(n)\ge g-\frac{(n-1)e^{-\gamma/\nu}}{1+(n-1)e^{-\gamma/\nu}}. \tag*{(44)}

If Assumption 4.2 also holds, the following conditions are sufficient for UT(n)≥BTU_T(n)\ge B_T:

3δ2g≤ν≤γlog⁡((n−1)(3−g)/g),T≥3nΨ(ν,η)g.(45)\frac{3\delta}{2g}\le\nu\le\frac{\gamma}{\log((n-1)(3-g)/g)},\qquad T\ge\frac{3n\Psi(\nu,\eta)}{g}. \tag*{(45)}

Proof. Fix a realized candidate vector and abbreviate its best value by MM. With x=(n−1)e−γ/νx=(n-1)e^{-\gamma/\nu}, calibrated choice selects the best candidate with probability at least 1/(1+x)1/(1+x). Since all values lie in [0,1][0,1], its expected shortfall from MM is at most x/(1+x)x/(1+x). Subtract the original value and then average to obtain (44).

For (45), note that 0<g≤10<g\le1 and the logarithm is positive. Its temperature upper bound implies x≤g/(3−g)x\le g/(3-g) and hence x/(1+x)≤g/3x/(1+x)\le g/3. The lower bound gives δ/(2ν)≤g/3\delta/(2\nu)\le g/3, while the horizon condition gives nΨ(ν,η)/T≤g/3n\Psi(\nu,\eta)/T\le g/3. Substitution in Theorem 4.3 proves the result.

The temperature interval in (45) can be empty: its feasibility requires

3δ2glog⁡((n−1)(3−g)g)≤γ.\frac{3\delta}{2g}\log\left(\frac{(n-1)(3-g)}{g}\right)\le\gamma.

This is a sufficient compatibility test between resource separation, market size, and reporting variation, not a necessary condition or an optimal temperature rule. The heterogeneous interval certificate can be substantially tighter because it retains each competitor’s separation. Uniform positive margins exclude realizations in which no candidate improves on the original platform; they are not implied by the resource-center model.

Verification Cost of Market Expansion

This appendix proves the cold-start obstruction in § 4.3, extends it to other horizons, and separates it from the loss due to stochastic choice. Values and reports are constant throughout; the construction does not require changing descriptions or an alternating resource process.

Cold-start bound for a general horizon

We prove Proposition 4.5 through the following more general bound.

Lemma C.1 (Finite-horizon cold-start bound) In the market of Proposition 4.5, for every ν>0\nu>0 and 1≤T≤n−21\le T\le n-2,

UT(n)≤1+cT(Hn−1−Hn−T−1),Hk:=∑s=1k1s,H0:=0.(46)U_T(n)\le\frac{1+c}{T}\left(H_{n-1}-H_{n-T-1}\right),\qquad H_k:=\sum_{s=1}^{k}\frac{1}{s},\qquad H_0:=0. \tag*{(46)}

Proof. All reports equal one, which is feasible under (1) by taking λi=1\lambda_i=1; the platform with true value one has zero gap regardless of its intensity. With η=1\eta=1, a zero-value platform has score one until first consumption and score zero thereafter. The value-one platform always has score one. The original platform’s score is one before its first consumption and cc thereafter.

Before round tt, at most t−1t-1 distinct zero-value platforms have been consumed. For 1≤t≤n−11\le t\le n-1, there are consequently at least n−t−1n-t-1 unverified zero-value platforms. Together with the value-one platform, they contribute at least (n−t)e1/ν(n-t)e^{1/\nu} to the softmax normalizer. Only the value-one platform and the original platform contribute to its value-weighted numerator, and their scores are at most one. Let Ft\mathcal{F}_t denote the complete pre-choice analysis state; this does not require the UA to observe unconsumed values. Conditional on that state,

E[rIt,t∣Ft]=∑irieSi,t/ν∑ieSi,t/ν≤(1+c)e1/ν(n−t)e1/ν=1+cn−t.(47)\mathbb{E}[r_{I_t,t}\mid\mathcal{F}_t]=\frac{\sum_i r_i e^{S_{i,t}/\nu}}{\sum_i e^{S_{i,t}/\nu}}\leq\frac{(1+c)e^{1/\nu}}{(n-t)e^{1/\nu}}=\frac{1+c}{n-t}. \tag*{(47)}

No independence between successive choices or uniform coverage is used. For 1≤T≤n−21 \leq T \leq n-2, take expectations and average to obtain

UT(n)≤1+cT∑t=1T1n−t=1+cT(Hn−1−Hn−T−1)≤1+cn−T.(48)\begin{aligned} U_T(n)\leq\frac{1+c}{T}\sum_{t=1}^{T}\frac{1}{n-t} \\ &=\frac{1+c}{T}(H_{n-1}-H_{n-T-1})\leq\frac{1+c}{n-T}. \tag*{(48)} \end{aligned}

For n≥4n\geq4, the choice T=⌊n/2⌋T=\lfloor n/2\rfloor lies in this range and n−T≥n/2n-T\geq n/2, giving (16). Since the old platform’s value is always cc, BT=cB_T=c; the strict inequality follows when n>2(1+c)/cn>2(1+c)/c. The best available value is one at every round, proving the claimed constant resource-frontier gain. The proof uses continued softmax competition between unverified reports and the best platform; a different user-agent rule need not obey the bound.

Separating verification from stochastic choice

At a fixed temperature, calibrated utility also decreases as the market expands in this construction. The following joint market–temperature family keeps calibrated choice nearly efficient and uses the same temperature for actual choice.

Corollary C.2 (Cold-start loss with nearly efficient calibrated choice) Fix c∈(0,1)c\in(0,1). For every integer n≥4n\geq4, use the market and policies of Proposition 4.5, with

Tn=⌊n/2⌋,νn=12log⁡n.(49)T_n=\lfloor n/2\rfloor,\qquad\nu_n=\frac{1}{2\log n}. \tag*{(49)}

Evaluate actual and calibrated utility at this same temperature. Then

1−UTn0(n)≤(1−c)n−2(1−c)+1n,UTn(n)≤2(1+c)n.(50)1-U_{T_n}^{0}(n)\leq(1-c)n^{-2(1-c)}+\frac{1}{n},\qquad U_{T_n}(n)\leq\frac{2(1+c)}{n}. \tag*{(50)}

Consequently, as n→∞n\to\infty,

Distortion⁡Tn(n)→1,Gain⁡Tn(n)→1−c,UTn(n)−BTn→−c.(51)\operatorname{Distortion}_{T_n}(n)\to1,\qquad\operatorname{Gain}_{T_n}(n)\to1-c,\qquad U_{T_n}(n)-B_{T_n}\to-c. \tag*{(51)}

The calibrated choice becomes nearly efficient while actual utility vanishes over the same horizon and resource process. This is a joint parameter-family counterexample, not a fixed-temperature large-market conclusion or a claim that a fixed market fails forever. It also does not establish a dynamic equilibrium. The limitation is specific to the stated mechanism: a different user agent need not keep undiscovered reports competing with a discovered value-one resource.

Proof. For the market in Proposition 4.5, fully calibrated softmax utility is constant across rounds and equals

UT0(n)=e1/ν+cec/νe1/ν+ec/ν+n−2.(52)U_T^0(n)=\frac{e^{1/\nu}+ce^{c/\nu}}{e^{1/\nu}+e^{c/\nu}+n-2}. \tag*{(52)}

Its shortfall from one satisfies

1−UT0(n)=(1−c)ec/ν+n−2e1/ν+ec/ν+n−2≤(1−c)e−(1−c)/ν+(n−2)e−1/ν.(53)1-U_T^0(n)=\frac{(1-c)e^{c/\nu}+n-2}{e^{1/\nu}+e^{c/\nu}+n-2}\leq(1-c)e^{-(1-c)/\nu}+(n-2)e^{-1/\nu}. \tag*{(53)}

Set ν=νn=1/(2log⁡n)\nu=\nu_n=1/(2\log n). Then e−(1−c)/νn=n−2(1−c)e^{-(1-c)/\nu_n}=n^{-2(1-c)} and e−1/νn=n−2e^{-1/\nu_n}=n^{-2}, so

1−UTn0(n)≤(1−c)n−2(1−c)+n−2n2≤(1−c)n−2(1−c)+1n.(54)1-U_{T_n}^0(n)\leq(1-c)n^{-2(1-c)}+\frac{n-2}{n^2}\leq(1-c)n^{-2(1-c)}+\frac{1}{n}. \tag*{(54)}

Proposition 4.5 applies at every positive temperature and therefore gives UTn(n)≤2(1+c)/nU_{T_n}(n)\leq2(1+c)/n at this same νn\nu_n. Since c∈(0,1)c\in(0,1) is fixed independently of nn, the calibrated utility converges to one and the nonnegative actual utility converges to zero. Finally, BTn=cB_{T_n}=c for every nn. Substitution into the definitions of Distortion and Gain proves (51).

This comparison uses one joint sequence (n,Tn,νn)(n,T_n,\nu_n) for both systems. In contrast, for any fixed ν>0\nu>0, the numerator of (52) is constant while its denominator grows linearly in nn, and the calibrated utility tends to zero. Thus neither a fixed-temperature large-market conclusion nor interchange of long-run and low-temperature limits is used.

Matching the order of the interaction budget

Corollary C.3 (A linear budget in the same cold-start family). Fix c∈(0,1)c\in(0,1) and use the market and reporting profile of Proposition 4.5, with η=1\eta=1 and νn=1/(2log⁡n)\nu_n=1/(2\log n) for every n≥4n\geq4. For n>2(1+c)/cn>2(1+c)/c and 1≤T≤⌊n/2⌋1\leq T\leq\lfloor n/2\rfloor,

UT(n)≤2(1+c)n<c=BT.(55)U_T(n)\leq\frac{2(1+c)}{n}<c=B_T. \tag*{(55)}

Conversely, for every fixed C>1/(1−c)C>1/(1-c), all sufficiently large nn satisfy

T≥Cn⇒UT(n)>BT.(56)T\geq Cn\quad\Rightarrow\quad U_T(n)>B_T. \tag*{(56)}

Both statements concern expected cumulative-average utility under the same mechanism, resources, and prescribed reporting profile.

Proof. For T≤⌊n/2⌋T\leq\lfloor n/2\rfloor, Lemma C.1 and (48) give UT(n)≤(1+c)/(n−T)≤2(1+c)/nU_T(n)\leq(1+c)/(n-T)\leq2(1+c)/n. The stated restriction on nn makes this smaller than cc.

In this market each gap is constant, so δ=0\delta=0. Since η=1\eta=1, Ψ(νn,1)=1−e−1/νn=1−n−2\Psi(\nu_n,1)=1-e^{-1/\nu_n}=1-n^{-2}. Calibrated utility is independent of TT, and (53) gives, for every TT,

Gain⁡T(n)≥1−c−(1−c)n−2(1−c)−1n.\operatorname{Gain}_T(n)\geq1-c-(1-c)n^{-2(1-c)}-\frac{1}{n}.

For T≥CnT\geq Cn, Theorem 4.3 therefore implies

UT(n)−BT≥1−c−(1−c)n−2(1−c)−1n−1−n−2C.(57)U_T(n)-B_T\geq1-c-(1-c)n^{-2(1-c)}-\frac{1}{n}-\frac{1-n^{-2}}{C}. \tag*{(57)}

Its right-hand side converges to 1−c−1/C>01-c-1/C>0, which proves (56). The convergence is uniform over horizons T≥CnT\ge Cn because no remaining term depends on TT.

Thus the order nn of a sufficient interaction budget cannot be reduced uniformly within this family: budgets o(n)o(n) eventually belong to the short-budget regime, whereas a large enough constant multiple of nn suffices. This does not identify the earliest crossing time, give a per-user realized safety guarantee, or prove an information-theoretic lower bound for other recommendation mechanisms. It matches only the market-width order in the displayed joint temperature family; it does not establish necessity of the separate η\eta, ν\nu, or δ\delta dependencies.

Additional Model Details

The query and candidate process has a fixed joint law independent of description policies; independence across platforms, users, or rounds is not required. Before normalization or retrieval, raw queries and resources take the form uj+ξu_j+\xi and ci+ζc_i+\zeta, with fixed perturbation laws satisfying Eξ=Eζ=0\mathbb{E}\xi=\mathbb{E}\zeta=0. Thus the centers need not equal the means of normalized queries or retrieved candidates.

Definition D.1 (Admissible platform policy). A policy πi\pi_i chooses a possibly randomized λi,t\lambda_{i,t} using the queries received, its own current candidates, and its past submissions and payoff feedback. It cannot condition on current UA choice shocks or future observations. Users’ credibility records and competing platforms’ resources are not disclosed to the platform.

Non-disclosure does not rule out inference from available feedback. A unilateral deviation in JiTJ_i^T regenerates subsequent choices, feedback, and credibility records rather than holding the realized history fixed.

Comparison with screening mechanisms. For one user with fixed positive resource values, value-weighted engagement and selection count induce identical platform preferences. In this overlapping submodel, the mechanism of Kleine Buening et al. (2024b) Appendix A can detect misreports from consumed rewards without knowing the reporting map. Its incentive guarantee combines exclusion with greedy selection and a terminal uniform-allocation phase; these operations change the choice rule studied here. When values vary across users or rounds, the payoff equivalence no longer holds in general.

Experimental Details

Shared interaction and evaluation protocol

We use the mechanism and default settings of § 3 and § 5, with seeds 1200–1211. The without-assessment condition keeps ω≡0\omega\equiv0. Nested markets reuse the first nn platforms of a maximum-width resource stream, retaining original assignments. Queries, local retrieval, PA sampling and UA choice use separate random streams. Across mechanisms, resources and sampling uniforms are paired, but learning actions adapt to their own feedback histories.

Saved horizons T∈{1,16,32,64,128,256,512,1024,2048,4096}T\in\{1,16,32,64,128,256,512,1024,2048,4096\} are cumulative prefixes, not independent replications or retuned learners. Parameter grids and representations are fixed before simulation.

Platform behavior. Fixed heterogeneous PAs draw λi∼Unif⁡[0.25,0.95]\lambda_i \sim\operatorname{Unif}[0.25, 0.95] once. A maximal-reporting condition sets all intensities to one. Learning PAs use Exp3 over {0,0.25,0.5,0.75,1}\{0, 0.25, 0.5, 0.75, 1\}. With weights wia,1=1w_{ia,1}=1 and full horizon H=4096H=4096, the probabilities and update are

γ=min⁡{1,5log⁡5(e−1)H},ρia,t=(1−γ)wia,t∑bwib,t+γ5,log⁡wia,t+1=log⁡wia,t+γ51{a=ℓi,t}(ui,t/m)ρia,t.(58)\begin{aligned} \gamma&= \min\left\{1,\sqrt{\frac{5\log5}{(e-1)H}}\right\},\\ \rho_{ia,t} &= (1-\gamma)\frac{w_{ia,t}}{\sum_b w_{ib,t}}+\frac{\gamma}{5},\\ \log w_{ia,t+1} &= \log w_{ia,t}+\frac{\gamma}{5}\frac{\mathbf{1}\{a=\ell_{i,t}\}(u_{i,t}/m)}{\rho_{ia,t}}. \tag*{(58)} \end{aligned}

Here ℓi,t\ell_{i,t} is the sampled action and ui,tu_{i,t} is the realized payoff in (4). PAs observe only their own aggregate payoffs, not competing resources, credibility records or counterfactual rewards. The finite grid is an experimental choice; these runs do not establish policy regret or convergence.

Estimation and uncertainty. Within each seed, utility averages ∑ipji,trji,t\sum_i p_{ji,t}r_{ji,t} over users and prefix rounds, conditional on sampled histories. This is an evaluator quantity: sampled choices generate PA rewards and credibility updates. All benchmarks use the same candidates; neither unconsumed values nor the reporting formula are supplied to the UA.

Net gains and mechanism differences are computed within seed. Pointwise 95% intervals use t11,0.975t_{11,0.975} times the standard error over 12 seeds, without multiplicity adjustment. Amazon intervals condition on its frozen data and representation; synthetic seeds also redraw centers and catalogs. Users, rounds and prefixes are not independent replications. Negative-net-gain user fractions describe within-seed heterogeneity, not failure probabilities for the population-average guarantee.

Fixed-policy contrasts isolate score correction; Exp3 contrasts include behavioral responses. Width sweeps also change resources and the payoff scale per platform, so they do not isolate verification speed. Full configurations and seed-level outputs are retained in the experiment artifacts.

Relation to the welfare guarantee. The broad-market queries have full spherical support, local sampling permits repeated items, and Exp3 assigns positive probability to intensities zero and one. For broad-market Exp3 and T≥2T \ge2, no deterministic δ<1\delta< 1 is therefore uniformly valid; fixed intensity instead has essential gap range λi\lambda_i. These runs test empirical behavior beyond the useful small-amplitude guarantee, not its certified budget. Observed ranges are not almost-sure certificates. Appendix E.§ 6 supplies a bounded-support test. Finite catalogs also need not satisfy the common-upper-tail assumptions, so measured frontier gains do not test their asymptotic rate.

Synthetic resource generator

Write unit⁡(v)=v/∥v∥2\operatorname{unit}(v)=v/\lVert v\rVert_2. User and platform centers are independent unit-normalized standard Gaussian vectors in R8\mathbb{R}^8. Each platform has 24 private items:

vik=unit⁡(ci+0.35zik),qj,t=unit⁡(uj+0.20ξj,t),zik,ξj,t∼N(0,I8).(59)v_{ik}=\operatorname{unit}(c_i+0.35z_{ik}),\qquad q_{j,t}=\operatorname{unit}(u_j+0.20\xi_{j,t}),\qquad z_{ik},\xi_{j,t}\sim\mathcal{N}(0,I_8). \tag*{(59)}

Items are drawn once; query innovations are fresh each round. For each query, each platform draws four local indices uniformly with replacement and submits the item with largest query cosine. Value is (1+qj,tTvaj,t)/2(1 + q_{j,t}^{\mathsf{T}}v_{a_{j,t}})/2. This fixed rule is independent of descriptions and sees no competing catalog. Centers are pre-normalization locations, not means of query-conditioned candidates.

The original platform is assigned before queries by

ιj∈arg⁡max⁡i∈{1,2}ujT(124∑k=124vik).(60)\iota_j \in\arg\max_{i\in\{1,2\}} u_j^{\mathsf{T}}\left(\frac{1}{24}\sum_{k=1}^{24}v_{ik}\right). \tag*{(60)}

It supplies exactly the same subsequent candidates in the original and expanded markets and is not optimized retrospectively over all 32 platforms.

Amazon data and semantic resources

Data and representation. The Amazon Reviews 2023 Musical Instruments 5-core release contains 511,836 ratings, split globally by timestamp into approximately 80/10/10 training, validation and test portions. We retain 2,048 text-covered training-eligible products and 256 users with at least three positive text-covered training interactions. The inherited product subset used MF-derived strata, but neither its old catalog labels nor MF predictions define the semantic market.

Frozen Qwen3-Embedding-0.6B ((Zhang et al., 2025)) embeds titles, categories, features and descriptions, excluding reviews and rating statistics. Inputs are capped at 1,200 characters and 256 tokens; last non-padding token pooling and L2 normalization yield 1,024 dimensions. The cache covers 3,616 products, including profile items outside the candidate universe; its manifest records the model revision.

Platforms and original assignments. Euclidean KMeans forms 32 virtual catalogs. Among five predetermined starts with 40 Lloyd iterations and at least eight items per catalog, minimum inertia selects the partition before simulation. Catalog sizes range from 16 to 185; platform centers are empirical vector means, not observed seller attributes.

Each seed samples 128 users and permutes catalogs. User centers average up to eight most recent training products rated at least four stars, then normalize. As in (60), the original platform maximizes profile–catalog affinity among the first two catalogs, using each catalog’s size. This simulated assignment precedes queries and is retained at every width.

Queries and local retrieval. For the unit profile uju_j and d=1024d = 1024, draw

qj,t=unit⁡(uj+0.5dξj,t),ξj,t∼N(0,Id).(61)q_{j,t} = \operatorname{unit}\left(u_j + \frac{0.5}{\sqrt{d}}\xi_{j,t}\right), \qquad\xi_{j,t} \sim\mathcal{N}(0,I_d). \tag*{(61)}

Each platform samples four products uniformly with replacement from its own catalog, excluding products the user rated during training, and submits the best current-query cosine match. The simulated value is

rji,t=1+cos⁡(qj,t,vaji,t)2.(62)r_{j i,t} = \frac{1+\cos(q_{j,t},v_{a_{j i,t}})}{2}. \tag*{(62)}

Interpretation. The LLM supplies representations, not strategic text or feedback; consumption reveals the selected semantic proxy exactly. Generated outcomes are not observed consumer counterfactuals. Inherited sampling, full-period 5-core filtering, uncertain metadata timing and possible pretraining overlap limit interpretation. Held-out ratings do not tune the mechanism.

Platform-policy comparisons

Seed means at n=16n = 16, T=4096T = 4096, ν=0.1\nu= 0.1 and η=0.2\eta= 0.2. Without assessment and With assessment give net utility relative to the original platform; Change is their paired difference before rounding. All paired pointwise 95% intervals for Change exclude zero. Fixed denotes heterogeneous fixed intensities; Maximal sets all intensities to one. These two conditions hold PA actions unchanged across mechanisms, whereas Exp3 comparisons include platform responses. Amazon uses the semantic value proxy.

Synthetic net-gain intervals are [0.0455,0.0643][0.0455, 0.0643] under fixed reporting and [0.0390,0.0576][0.0390, 0.0576] under Exp3; Amazon intervals are [−0.0166,−0.0001][-0.0166, -0.0001] and [−0.0160,0.0004][-0.0160, 0.0004]. Thus positive paired assessment benefits need not imply benefit over the original platform. Negative-net-gain user fractions average 29.2%/33.1% for synthetic fixed/Exp3 and 67.5%/66.5% for Amazon.

Choice-temperature sensitivity

Across the tested temperatures, lower values improve calibrated and actual mean gains in both markets under Exp3, despite larger distortion (Table 3). Better selection can outweigh increased reporting sensitivity, but Amazon’s actual net-gain interval at ν=0.03\nu= 0.03 still crosses zero. Resources are reused across temperatures; PA actions adapt to each UA’s feedback history.

Marketν\nuCalibrated gainActual net gain95% CIDistortion
Synthetic0.03165.299.8[89.8, 109.8]65.4
0.1092.548.3[39.0, 57.6]44.2
0.304.4−11.9[−20.3, −3.6]16.3
Amazon0.0312.86.1[−1.9, 14.1]6.7
0.10−6.6−7.8[−16.0, 0.4]1.2
0.30−12.9−13.3[−21.8, −4.9]0.4

Table 3. Choice-temperature sensitivity with Exp3 PAs and credibility assessment, at n=16n = 16, T=4096T = 4096 and η=0.2\eta= 0.2. Value columns are in units of 10−310^{-3}. Means and pointwise 95% intervals for actual net gain use 12 seeds.

Controlled certificate experiments

Shared bounded-support construction. Each platform submits ai=eia_i = e_i. User jj’s query center has coordinates 0.4 at its original platform 1, hh at a preferred platform ij∗≠1,2i_j^* \ne1, 2, and 0.1 elsewhere. Queries add independent coordinate noise uniform on [−0.01,0.01][-0.01, 0.01], with r(q,a)=clip⁡[0,1](qTa)r(q,a) = \operatorname{clip}_{[0,1]}(q^{\mathsf{T}}a). Candidates and query laws are fixed. Each PA selects one intensity in [1−a,1][1-a,1] per round, shared across users; this restriction is imposed, not induced by competition. Both protocols use 128 users, 4,096 rounds, 12 seeds, ν=0.1\nu= 0.1 and η=0.2\eta= 0.2.

Support-based certificate. The value supports are [0.39,0.41][0.39, 0.41], [h−0.01,h+0.01][h - 0.01, h + 0.01] and [0.09,0.11][0.09, 0.11] for the original, preferred and remaining platforms. Proposition B.6 gives

δ=0.02+0.89a,\delta= 0.02 + 0.89a,
G=0.09−0.41+h−0.11+exp⁡((0.42−h)/0.1)+(n−2)exp⁡((0.12−h)/0.1).(63)G = 0.09 - 0.41 + \frac{h - 0.1}{1 + \exp((0.42 - h)/0.1) + (n - 2)\exp((0.12 - h)/0.1)}. \tag*{(63)}

The widest gap interval is [(1−a)0.89,0.91][(1-a)0.89, 0.91], at a low-value platform. The reciprocal denominator bounds the preferred platform’s calibrated selection probability using its lowest value and competitors’ highest values. Every resource is worth at least 0.09, the preferred resource adds at least h−0.1h - 0.1, and the original is worth at most 0.41. Thus GG is an analytical lower bound, not a measured gain.

For G>δ/(2ν)G > \delta/(2\nu), Corollary 4.4 gives the certified budget

Tcert=⌈nΨ(ν,η)G−δ/(2ν)⌉.T_{\mathrm{cert}} = \left\lceil\frac{n\Psi(\nu,\eta)}{G - \delta/(2\nu)} \right\rceil.

At (n,h,a)=(16,0.9,0.05)(n,h,a) = (16,0.9,0.05), δ=0.0645\delta= 0.0645, G>0.468981G > 0.468981 and Ψ(0.1,0.2)<13.405602\Psi(0.1,0.2) < 13.405602 by (38). Substitution gives a certified budget of 1,465 rounds and net gain above 0.0941 at T=4096T = 4096. All certificates use analytical supports and conservative rounding, not observed extrema.

Restricted Exp3. The first protocol fixes (n,h,a)=(16,0.9,0.05)(n,h,a) = (16,0.9,0.05), with preferred identities cyclically assigned to platforms 3, . . . , 16, and runs (58) on {0.95,0.9625,0.975,0.9875,1}\{0.95, 0.9625, 0.975, 0.9875, 1\}. Final net gain is 0.4658, with interval [0.4657, 0.4659], versus −0.2210 without assessment. The first saved positive interval occurs at 128 rounds, while the 64-round interval is negative. This observed transition is not a stopping-time guarantee; the analytical budget covers every admissible policy in the interval.

Market, resource and reporting sweeps. The second protocol retains preferred platforms 3 or 4 at every width. Intensities are drawn independently from Unif⁡[1−a,1]\operatorname{Unif}[1-a,1] each round, independently of UA actions: these are open-loop, not learning policies. Table 4 varies one parameter around (16,0.9,0.05)(16,0.9,0.05), giving seven settings and 84 seeded runs.

Entrants do not improve the best resource, so the width sweep combines choice dilution and verification effects. Increasing aa also lowers mean intensity, not just widening its range. Observed gains remain positive even when no finite budget is certified.

Alternative calibration with matched forgetting

We compare (5) with an affine gap predictor using matched forgetting, initialization and score range. For one user–platform record, index verified consumptions by s=1,…,ks = 1,\ldots,k, with reports AsA_s, gaps ds=As−rsd_s = A_s - r_s and ρ=1−η\rho= 1 - \eta. Before its next consumption, fit

(a^k,b^k)∈arg⁡min⁡a,b{ρka2+η∑s=1kρk−s(ds−a−bAs)2+κb2},κ=0.01.(64)(\hat{a}_k,\hat{b}_k) \in\arg\min_{a,b} \left\{ \rho^k a^2 + \eta\sum_{s=1}^{k} \rho^{k-s}(d_s - a - bA_s)^2 + \kappa b^2 \right\}, \qquad\kappa= 0.01. \tag*{(64)}

The score is A−clip⁡[0,1](a^k+b^kA)A - \operatorname{clip}_{[0,1]}(\hat{a}_k + \hat{b}_k A), with zero initial coefficients and the same temperature as EMA. Only the consumed record updates, at round end; unconsumed records do not decay. Neither intensities nor the reporting formula are supplied, and regularization is fixed in advance. Restricting b=0b = 0 recovers the zero-initialized EMA exactly. The extension uses the current report as a predictor, unlike lagged EMA.

Comparisons reuse the original resources and seeds. Fixed-policy comparisons share actions; Exp3 populations learn separately under each UA. Table 5 and Table 6 report paired differences.

PAMean95% CI
Fixed4.94[4.86, 5.02]
Exp3−0.32-0.32[−0.47-0.47, −0.16-0.16]
Restricted Exp322.82[22.74, 22.90]

Table 5. Calibration in synthetic markets.

PAMean95% CI
Fixed0.13[0.11, 0.15]
Exp3−0.29-0.29[−0.32-0.32, −0.25-0.25]

Table 6. Calibration in Amazon markets.

Entries report affine gap calibration minus EMA utility in 10−310^{-3} units; positive values favor affine calibration. Both use matched forgetting, with m=128m = 128, n=16n = 16 and T=4096T = 4096. CIs are paired pointwise 95% intervals over 12 seeds. Fixed denotes heterogeneous fixed intensities; Exp3 uses the full action grid. Restricted Exp3 uses the controlled synthetic market. Amazon values use the semantic outcome proxy.

Neither update uniformly dominates. Affine calibration performs better under fixed reporting and restricted Exp3; broad-market Exp3 slightly favors EMA. These comparisons test sensitivity to predictor form, not optimality among all same-feedback methods.

Observed ratings and outcome-model sensitivity

Observed-rating check. Using the same chronological split (timestamp ties enter the later split), an existing diagnostic covers 130 test ratings from 58 eligible users. Training-profile cosine, used because review-time queries are unobserved, has Spearman correlation 0.101 with ratings, with interval [−0.117,0.265][-0.117, 0.265]. Restricting to unseen pairs in the 2,048-product universe leaves 19 ratings from 15 users.

A broader cohort requires at least ten training ratings overall and three positive training ratings within that universe; profiles use up to eight latest positives. Of 1,717 eligible users, 92 contribute 119 unseen test ratings. Correlation is −0.185-0.185, with interval [−0.349,−0.006][-0.349, -0.006]. Both 95% intervals use 2,000 user-cluster bootstrap draws, conditional on frozen data and representation. These sparse diagnostics are not new untouched tests or validation of consumer satisfaction; missing ratings are not negative outcomes.

A separate rating-derived outcome proxy. We retain the Qwen catalogs, queries, retrieval, candidates and original assignments, but replace relevance by a frozen 32-dimensional biased matrix-factorization prediction, clipped to [0,1][0, 1]. The outcome model is trained on training ratings and selected by validation RMSE; it is not a second recommendation-side embedding. Reports, feedback, PA payoff and welfare all use the replacement. The UA sees only consumed outcomes, not the predictor; the original platform is not reoptimized.

Results and scope. At n=16n = 16, m=128m = 128, T=4096T = 4096, ν=0.1\nu= 0.1 and η=0.2\eta= 0.2, assessment improves utility over uncorrected reports by 0.00330 under fixed reporting and 0.00225 under Exp3, with paired intervals [0.00238,0.00421][0.00238, 0.00421] and [0.00197,0.00253][0.00197, 0.00253]. Net gains over the original platform are 0.01314 and 0.00858, with intervals [0.00679,0.01949][0.00679, 0.01949] and [0.00238,0.01477][0.00238, 0.01477]. Correction benefits persist, but the positive net gains contrast with the semantic-proxy results: their sign depends on the outcome model.

The rating proxy is not demonstrably better: its normalized RMSE on the complete warm-start test split is 0.2951, versus 0.2948 for a bias-only model. Predictions are not observed counterfactuals, and inherited product selection makes the two proxies non-independent market samples. The data limitations in Appendix E.§ 3 remain. The mechanism intervals measure variability over 12 simulation seeds conditional on frozen data and models, not uncertainty about real consumer welfare.

References

  1. [1]Pranjal Aggarwal, Vishvak Murahari, Tanmay Rajpurohit, Ashwin Kalyan, Karthik Narasimhan, and Ameet Deshpande. GEO: Generative engine optimization. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 5–16. Association for Computing Machinery, 2024. doi: 10.1145/3637528.3671900. URL https://doi.org/10.1145/3637528.3671900.
  2. [2]Amine Allouah, Omar Besbes, Josué D. Figueroa, Yash Kanoria, and Akshit Kumar. What is your AI agent buying? evaluation, biases, model dependence, & emerging implications for agentic e-commerce. arXiv preprint arXiv:2508.02630, 2025. doi: 10.48550/arXiv.2508.02630. URL https://arxiv.org/abs/2508.02630.
  3. [3]Raman Arora, Michael Dinitz, Teodor Vanislavlov Marinov, and Mehryar Mohri. Policy regret in repeated games. In Advances in Neural Information Processing Systems, volume 31, 2018. URL https://proceedings.neurips.cc/paper_files/paper/2018/hash/8643c8e2107ba86c4371e037059c4b7-Abstract.html.arxiv.org/abs/1811.04127
  4. [4]Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48–77, 2002. doi: 10.1137/S0097539701398375. URL https://epubs.siam.org/doi/10.1137/S0097539701398375.DOI
  5. [5]Gagan Bansal, Wenyue Hua, Zezhou Huang, Adam Fourney, Amanda Swearngin, Will Epperson, Tyler Payne, Jake M. Hofman, Brendan Lucier, Chinmay Singh, Markus Mobius, Akshay Nambi, Archana Yadav, Kevin Gao, David M. Rothschild, Aleksandrs Slivkins, Daniel G. Goldstein, Hussein Mozannar, Nicole Immorlica, Maya Murad, Matthew Vogel, Subbarao Kambhampati, Eric Horvitz, and Saleema Amershi. Magentic marketplace: An open-source environment for studying agentic markets. arXiv preprint arXiv:2510.25779, 2025. doi: 10.48550/arXiv.2510.25779. URL https://arxiv.org/abs/2510.25779.
  6. [6]Omer Ben-Porat and Moshe Tennenholtz. A game-theoretic approach to recommendation systems with strategic content providers. In Advances in Neural Information Processing Systems, volume 31, 2018. URL https://proceedings.neurips.cc/paper/2018/hash/a9a1d5317a33ae8cef33961c34144f84-Abstract.html.
  7. [7]Natalie Collina, Surbhi Goel, Aaron Roth, Emily Ryu, and Mirah Shi. Emergent alignment via competition. In International Conference on Machine Learning, 2026. URL https://arxiv.org/abs/2509.15090.
  8. [8]Vincent P. Crawford and Joel Sobel. Strategic information transmission. Econometrica, 50(6):1431–1451, 1982. doi: 10.2307/1913390. URL https://www.jstor.org/stable/1913390.DOI
  9. [9]Chrysanthos Dellarocas. The digitization of word of mouth: Promise and challenges of online feedback mechanisms. Management Science, 49(10):1407–1424, 2003. doi: 10.1287/mnsc.49.10.1407.17308. URL https://pubsonline.informs.org/doi/10.1287/mnsc.49.10.1407.17308.
  10. [10]Giorgos Filandrianos, Angeliki Dimitriou, Maria Lymperaiou, Konstantinos Thomas, and Giorgos Stamou. Bias beware: The impact of cognitive biases on LLM-driven product recommendations. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pages 22397–22426. Association for Computational Linguistics, 2025. doi: 10.18653/v1/2025.emnlp-main.1140. URL https://aclanthology.org/2025.emnlp-main.1140/.

Paper details

vlnc:W_3f2v3wj4
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 11

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

generative AI tools · View statement →

Looking for related papers…
Contents