Pith. sign in

REVIEW 1 cited by

When do discounted-optimal policies also optimize the gain?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.08048 v1 pith:KDKOZD3S submitted 2023-04-17 eess.SY cs.SYmath.OC

classification eess.SYcs.SYmath.OC
keywords discounted-optimalpoliciesthresholdaddressboundcomputabilitydeterministicdiscount
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this technical note, we establish an upper-bound on the threshold on the discount factor starting from which all discounted-optimal deterministic policies are gain-optimal, that we prove to be tight on an example. To address computability issues of that theoretical threshold, we provide a weaker bound which is tractable on ergodic MDPs in polynomial time.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Thresholds for sensitive optimality and Blackwell optimality in stochastic games

    cs.GT 2025-06 conditional novelty 7.0 of 10

    For perfect-information stochastic games, this paper derives the first explicit upper bounds on the d-sensitive discount threshold (for d≥0) and improved upper bounds on the Blackwell threshold.

Pith tools