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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A43 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6714837 / rank
 
Normal rank
Property / zbMATH Keywords
 
two-player quantitative game on graph
Property / zbMATH Keywords: two-player quantitative game on graph / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov decision process
Property / zbMATH Keywords: Markov decision process / rank
 
Normal rank
Property / zbMATH Keywords
 
beyond worst-case synthesis
Property / zbMATH Keywords: beyond worst-case synthesis / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case and expected value
Property / zbMATH Keywords: worst-case and expected value / rank
 
Normal rank
Property / zbMATH Keywords
 
mean-payoff
Property / zbMATH Keywords: mean-payoff / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest path
Property / zbMATH Keywords: shortest path / rank
 
Normal rank

Revision as of 07:10, 1 July 2023

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

    Identifiers