Approachability in Stackelberg stochastic games with vector costs (Q1707454): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13235-016-0198-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2471478425 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.0728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Algorithms for Markov Decision Processes with Average Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Approximations and Differential Inclusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Approximations and Differential Inclusions, Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog of the minimax theorem for vector payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Stochastic Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An actor-critic algorithm for constrained Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3527701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachable sets of vector payoffs in stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lorenz attractor exists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachability, regret and calibration: implications and equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed performance regions in Markovian systems with competing decision makers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of Measurable Selection Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Decision Processes with Arbitrary Reward Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13235-016-0198-Y / rank
 
Normal rank

Latest revision as of 05:03, 11 December 2024

scientific article
Language Label Description Also known as
English
Approachability in Stackelberg stochastic games with vector costs
scientific article

    Statements

    Approachability in Stackelberg stochastic games with vector costs (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2018
    0 references

    Identifiers

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