Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2016.10.011 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2555847713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games with Perfect Information and Time Average Payoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at mean-payoff and total-payoff through windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the \(K\)th largest subset problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing risk models in Markov decision processes with policies depending on target values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percentile performance criteria for limiting average Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percentile queries in multi-dimensional Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Performance for Stability in Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Stochastic Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games through Nested Fixpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence to state-action frequency polytopes for MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hoeffding's inequality for uniformly ergodic Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of cryptography (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of multi-mean-payoff and multi-energy games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy synthesis for multi-dimensional quantitative objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy and Mean-Payoff Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean-Payoff Games with Partial-Observation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time with Minimal Expected Cost! / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2016.10.011 / rank
 
Normal rank

Latest revision as of 20:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
scientific article

    Statements

    Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    two-player quantitative game on graph
    0 references
    Markov decision process
    0 references
    beyond worst-case synthesis
    0 references
    worst-case and expected value
    0 references
    mean-payoff
    0 references
    shortest path
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers