Metraipolis › archive › dc_d8dc24066429
Approximating the Value of Time-Bounded Weighted Timed Games — arXiv:2610.21487
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21487
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:12:18.916Z
- SHA-256 of the archived text
ee80524db6ee99358507a6a5f5e74d57d95021a21a6b80f1eae20d91890393f0- Stable URL of this page
https://metraipolis.com/documento/dc_d8dc24066429
How to cite
Approximating the Value of Time-Bounded Weighted Timed Games — arXiv:2610.21487 — arXiv (en), https://arxiv.org/abs/2610.21487 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8dc24066429 (Metraipolis archive dc_d8dc24066429, sha256 ee80524db6ee99358507a6a5f5e74d57d95021a21a6b80f1eae20d91890393f0)
BibTeX
@misc{dcd8dc24066429,
title = {Approximating the Value of Time-Bounded Weighted Timed Games — arXiv:2610.21487},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21487},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8dc24066429; sha256 ee80524db6ee99358507a6a5f5e74d57d95021a21a6b80f1eae20d91890393f0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21487. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Value Problem for weighted timed games, an extension of timed automata with weights and adversity, consists in determining, given a weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. This problem is known to be undecidable for weighted timed games, i.e., there is no algorithm that can compute the value exactly. A natural alternative is to approximate the value; however, the Approximation problem is also undecidable in general. In this paper, we prove that the Approximation problem is decidable in 4-ExpTime for weighted timed games whose executions are time-bounded. Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno). Categorie arXiv: Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2610.21487 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:46:02.643Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).