NON ZERO-SUM STOPPING GAMES OF SYMMETRICAL MARKOV-PROCESSES

被引：17
|
作者：
NAGAI, H
机构：
来源：
PROBABILITY THEORY AND RELATED FIELDS | 1987年 / 75卷 / 04期
关键词：
D O I：
10.1007/BF00320329
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
引用
收藏
页码：487 / 497
页数：11
相关论文
共 50 条
  • [41] A Natural Actor-Critic Framework for Zero-Sum Markov Games
    Alacaoglu, Ahmet
    Viano, Luca
    He, Niao
    Cevher, Volkan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022, : 307 - 366
  • [42] Zero-sum constrained stochastic games with independent state processes
    Eitan Altman
    Konstantin Avrachenkov
    Richard Marquez
    Gregory Miller
    Mathematical Methods of Operations Research, 2005, 62 : 375 - 386
  • [43] Zero-sum games for continuous-time jump Markov processes in polish spaces: Discounted payoffs
    Guo, Xianping
    Hernandez-Lerma, Onesimo
    ADVANCES IN APPLIED PROBABILITY, 2007, 39 (03) : 645 - 668
  • [44] Zero-Sum Games for Finite-Horizon Semi-Markov Processes Under the Probability Criterion
    Huang, Xiangxiang
    Guo, Xianping
    Wen, Xin
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (09) : 5560 - 5567
  • [45] STOPPING TIMES FOR RECURRENT MARKOV-PROCESSES
    BAXTER, JR
    CHACON, RV
    ILLINOIS JOURNAL OF MATHEMATICS, 1976, 20 (03) : 467 - 475
  • [46] Zero-sum ergodic stochastic games
    Jaskiewicz, Anna
    Nowak, Andrzej S.
    2005 44TH IEEE CONFERENCE ON DECISION AND CONTROL & EUROPEAN CONTROL CONFERENCE, VOLS 1-8, 2005, : 1741 - 1746
  • [47] The testable implications of zero-sum games
    Lee, SangMok
    JOURNAL OF MATHEMATICAL ECONOMICS, 2012, 48 (01) : 39 - 46
  • [48] TRAINING AUTOMATA IN ZERO-SUM GAMES
    VAPNIK, VN
    CHERVONE.AY
    AUTOMATION AND REMOTE CONTROL, 1967, (07) : 1094 - &
  • [49] EVOLUTIONARY DYNAMICS OF ZERO-SUM GAMES
    AKIN, E
    LOSERT, V
    JOURNAL OF MATHEMATICAL BIOLOGY, 1984, 20 (03) : 231 - 258
  • [50] On the complexity of succinct zero-sum games
    Fortnow, L
    Impagliazzo, R
    Kabanets, V
    Umans, C
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 323 - 332
12345