跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09244 · v1

Attaining Optimal Values under Sure Constraints

首次提交 2026-11-06 18:06
版本更新 2026-11-06 18:06
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

A game may have, for each target below its value, a finite controller meeting that target, yet no finite controller attaining the value itself. We study finite stochastic games with a hard specification that must hold on every supported execution, including paths of probability zero. Max uses a pure finite controller; Min may use any pure public-history strategy. We distinguish three numerical questions: can a supplied target be met, can the unspecified optimum be attained, and what is one exact value? For explicit hard and Boolean soft Streett conditions, the strict and non-strict supplied-threshold problems are coNP-complete, attainment of the unsupplied supremum is PNP\mathrm P^{\mathrm{NP}}-complete, and one exact reduced fraction is FPNP\mathrm{FP}^{\mathrm{NP}}-complete under polynomial metric reductions. The proofs preserve both the value and its finite attainability when fixing a single opponent, and encode adaptive queries without computing unknown subgame values. The same construction yields matching value-comparison and exact-output lower bounds for ordinary stochastic Streett games with unrestricted randomized history strategies. We also bound the memory needed for optimal finite implementations for arbitrary Muller hard conditions and rational rewards in [0,1][0,1] determined by infinitely recurring states. One controller is sure from the entire original sure region and attains at every finitely attained start, with no attainment premise on the other states. For nn states in that region it uses 2O(nlog⁡(n+1))Q(1+log⁡R)2^{O(n\log(n+1))}Q(1+\log R) modes, where QQ is the product of the least common denominators of full original chance rows sourced in that sure region and RR clears all reward values. Its joint dependence on QQ and RR is worst-case sharp at each fixed n≥6n\ge6 when Q,R≥2Q,R\ge2. Optimal dependence on arena size and efficient general synthesis are not resolved here.

作者备注:61 pages, 6 figures. Complete proofs included. Corresponding author: Takuto Yamauchi

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 18:06 · 最新观测版本

Attaining Optimal Values under Sure Constraints

A game may have, for each target below its value, a finite controller meeting that target, yet no finite controller attaining the value itself. We study finite stochastic games with a hard specification that must hold on every supported execution, including paths of probability zero. Max uses a pure finite controller; Min may use any pure public-history strategy. We distinguish three numerical questions: can a supplied target be met, can the unspecified optimum be attained, and what is one exact value? For explicit hard and Boolean soft Streett conditions, the strict and non-strict supplied-threshold problems are coNP-complete, attainment of the unsupplied supremum is PNP\mathrm P^{\mathrm{NP}}-complete, and one exact reduced fraction is FPNP\mathrm{FP}^{\mathrm{NP}}-complete under polynomial metric reductions. The proofs preserve both the value and its finite attainability when fixing a single opponent, and encode adaptive queries without computing unknown subgame values. The same construction yields matching value-comparison and exact-output lower bounds for ordinary stochastic Streett games with unrestricted randomized history strategies. We also bound the memory needed for optimal finite implementations for arbitrary Muller hard conditions and rational rewards in [0,1][0,1] determined by infinitely recurring states. One controller is sure from the entire original sure region and attains at every finitely attained start, with no attainment premise on the other states. For nn states in that region it uses 2O(nlog⁡(n+1))Q(1+log⁡R)2^{O(n\log(n+1))}Q(1+\log R) modes, where QQ is the product of the least common denominators of full original chance rows sourced in that sure region and RR clears all reward values. Its joint dependence on QQ and RR is worst-case sharp at each fixed n≥6n\ge6 when Q,R≥2Q,R\ge2. Optimal dependence on arena size and efficient general synthesis are not resolved here.

查看此版本解读 →查看此版本原文 ↗