Parallelism or Concession? A Reconciled Analytical Model of Concurrency-Aware Procurement Negotiation for Agentic Commerce

In the paper's words

An agentic buyer with a hard fulfillment deadline can fork a procurement negotiation into many parallel seller-facing threads, but every thread consumes resources and every simultaneous acceptance creates a cancellation and commitment liability. We study a planner that jointly chooses the number of parallel negotiators n and a common procurement price cap p, coupling a product-specific acceptance curve a(p) with fulfillment loss, per-thread cost, and excess-commitment cost. We derive three structural results with fully explicit arithmetic.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Solving the fixed point over $n \geq 2$ for a worked configuration yields $(n^*, p^*) = (2,\ 13.89182)$ with expected net cost $71.28572$.

   from Abstract

2. This is an interior candidate, not the global optimum: for $n = 1$ the cost $C(1, p) = 96 - 30a(p)$ is strictly decreasing in $a$ on $[0,1)$, so under the unbounded exponential curve the single-thread cost has infimum $66$ (not attained) and already equals $69.0 \lt 71.28572$ at $a = 0.9$.

   from Abstract

3. The QuWARP cost-model assessment of workload-level reuse planning for quantum circuit simulation [10] uses an analytical cost model to size a fan-out (repeated-run workload) against resource constraints before committing compute; its treatment of amortized per-task cost parallels our per-thread cost $c_t$, and its threshold-rule style of analysis is the derivation style adopted here.

   from 2. Background and Related Work

4. Then $B = 40 + 5 = 45$, $$B\,a = 45 \times 0.3 = 13.5, \qquad c_t + e\,a = 1 + 5 \times 0.3 = 2.5,$$ ratio $= 2.5/13.5 = 0.18519$; $\ln(0.18519) = -1.68546$; $\ln(0.7) = -0.35668$; quotient $= 4.72554$, so by (4), $n^* = \lceil 4.72554 \rceil = 5$.

   from 4.3 Worked example at a fixed cap

5. Expected cost at $(n, a) = (5, 0.3)$ from (1): $(1-a)^5 = 0.16807$, $n a = 1.5$, $$C = 60 + 40 \times 0.16807 + 5 + 5 \times (1.5 - 0.16807) = 60 + 6.7228 + 5 + 6.65965 = 78.38245.$$

   from 4.3 Worked example at a fixed cap

6. Expected cost at the fixed point, from (1) with $n = 2$, $a = 6/7$, $(1-a)^2 = 1/49$, $n a = 12/7 = 1.71429$: $$C(2) = 60 + 40 \times \frac{1}{49} + 2 + 5 \times \left(\frac{12}{7} - \frac{1}{49}\right) = 60 + 0.81633 + 2 + 8.46939 = 71.28572.$$ Same-cap comparison.

   from 4.5 Joint fixed point

How it is done

1. We derive three structural results with fully explicit arithmetic.

   from Abstract

2. We use form (1) throughout.

   from 3.1 Setting and adopted conventions

3. The fixed point $(2,\ 13.89182)$ is therefore the optimum only over $n \geq 2$: the exponential curve admits no finite cap bound (unlike the draft-B quantile curve, which is capped at $p_{\max}$), so the global optimum over $n \in \mathbb{N}_{+}$, $p \geq c$ is the boundary case $n = 1$ with the cap pushed arbitrarily high and cost approaching $66$.

   from 4.5 Joint fixed point

4. We have not verified that any empirically relevant offer distribution satisfies this density condition, we write down no dispersed-offer objective $C(n,p)$, and we compute no exponent or scaling of the optimal team size.

   from 4.6 Dispersed offers

What would falsify it

1. The central claims are falsifiable as follows.

   from 6.2 Falsifiability

2. (i) If observed marginal cost reductions across $n$ remain roughly constant or increase, contradicting the geometric decay of (3), the binomial acceptance model is refuted for that market.

   from 6.2 Falsifiability

3. (iii) If the optimal cap rises rather than falls with $n$ in controlled experiments, the substitution result (6) is refuted.

   from 6.2 Falsifiability

Where the claim stops

1. Under draft A's convention — purchase cost $p_{\text{cap}}\,P(X \geq 1)$ with no failure loss and an excess penalty $C_e\max(0, \mathbb{E}[X]-1)$ — a different calibration ($\alpha = 0.10$, $p_{\min} = 10$, $p_{\text{cap}} = 15$, $c = 0.50$, $L_f = 2.00$, $C_e = 1.00$) yields $n^* = 1$ with a low expected cost under that convention's objective functional; we do not reproduce the draft-A objective's arithmetic here and so refrain from quoting a specific figure.

   from 6.1 Limitations

2. A worked fixed point over $n \geq 2$ ($n^* = 2$, $p^* = 13.89182$, cost $71.28572$) and a same-cap comparison ($70.28574$ for one thread) show that concurrency pays only when failure risk is material; with the unbounded exponential curve the single-thread boundary case ($n = 1$, cost $\to 66$) in fact dominates, so the interior fixed point is optimal only within $n \geq 2$ or under a bounded cap.

   from 7. Conclusion

3. Concurrency pays only when the cap is bounded or failure risk is material at the prevailing cap.

   from Abstract

Where to read

1. Abstract315 words · 1 min
2. 1. Introduction299 words · 1 min
3. 2. Background and Related Work467 words · 2 min
4. 3. Methods432 words · 2 min
5. 4. Analysis1,432 words · 6 min
6. 5. Results336 words · 1 min
7. 6. Discussion357 words · 2 min
8. 7. Conclusion182 words · 1 min
9. Appendix A. Divergence report211 words · 1 min