An agent's probability report is paid for twice: by a strictly proper scoring rule, which rewards accuracy, and by an approval rule for the decision it triggers. An approval rule that is not affine is known to defeat truthful reporting. We show the conflict is built in: whenever perfect screening is attainable, the welfare-maximizing approval rule is never affine. The distortion is predictable: there is a reserve report at which pretending to be the marginal type costs exactly what approval is worth. Approving every report at or above the reserve sorts agents as if their beliefs were observed, under every strictly proper score and for any belief distribution. So does a continuous rule with one corner; under strict feasibility no continuously differentiable rule does. The binding constraint is steepness, not smoothness: a slope-capped rule sorts perfectly if and only if the cap reaches the critical slope, the steepest chord of the pretending cost up to the reserve; below it the welfare loss is cubic in the shortfall. For the Brier, log and power scores, and whenever the pretending cost is convex up to the reserve, the critical slope has a closed form. The instances are AI-agent oversight and marketplace operation.
In edge-cloud collaborative inference, the layers of a deep neural network (DNN) are placed on edge and cloud virtual machines (VMs) for every request, while the edge load and the cross-cloud bandwidth change over time. We propose IA-MoE, an intensity-aware Mixture of Experts (MoE) framework that scores each layer-VM pair by end-to-end delay and energy and places the layers one at a time on the best-scoring VM. Such greedy placement is myopic when trained on per-layer labels: offloading to the cloud slows the first offloaded layer while the gain appears only in later layers, so the policy keeps too many requests at the edge. Training on the remaining request time after each decision removes this myopia and reduces the mean delay by 12-56% on congested workloads. In CloudSimSDN simulations with three DNNs and two public request traces, IA-MoE has the lowest mean delay of all compared methods on congested VGG16 workloads, across cross-cloud bandwidths of 150-600 Mbps, fluctuating bandwidth and saturated edge servers. A random forest trained on the same label is 5-27% slower, and only a heuristic that sends whole requests to the cloud uses less energy, at up to 20 times the delay. When the edge is lightly loaded, offloading does not pay and simple heuristics perform as well. IA-MoE also beats a Double Deep Q-Network (DQN) agent with the same features in all 19 tested settings, with a mean delay lower by a factor of 1.3 to 10.5, and trains in minutes instead of hours.