Nonzero-sum constrained discrete-time Markov games: the case of unbounded costs (Q287649): 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: 91A15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B22 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6583695 / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov games
Property / zbMATH Keywords: Markov games / rank
 
Normal rank
Property / zbMATH Keywords
 
occupation measure
Property / zbMATH Keywords: occupation measure / rank
 
Normal rank
Property / zbMATH Keywords
 
unbounded costs
Property / zbMATH Keywords: unbounded costs / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained Nash equilibria
Property / zbMATH Keywords: constrained Nash equilibria / rank
 
Normal rank

Revision as of 19:01, 27 June 2023

scientific article
Language Label Description Also known as
English
Nonzero-sum constrained discrete-time Markov games: the case of unbounded costs
scientific article

    Statements

    Nonzero-sum constrained discrete-time Markov games: the case of unbounded costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2016
    0 references
    Markov games
    0 references
    occupation measure
    0 references
    unbounded costs
    0 references
    constrained Nash equilibria
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references