scispace - formally typeset
Search or ask a question
Topic

Stochastic game

About: Stochastic game is a research topic. Over the lifetime, 9493 publications have been published within this topic receiving 202664 citations.


Papers
More filters
Posted Content
TL;DR: Global games are games of incomplete information whose type space is determined by the players each observing a noisy signal of the underlying state as mentioned in this paper, allowing analysis of a number of economic models of coordination failure.
Abstract: Global games are games of incomplete information whose type space is determined by the players each observing a noisy signal of the underlying state. With strategic complementarities, global games often have a unique, dominance solvable equilibrium, allowing analysis of a number of economic models of coordination failure. For symmetric binary action global games, equilibrium strategies in the limit (as noise becomes negligible) are simple to characterize in terms of 'diffuse' beliefs over the actions of others. We describe a number of economic applications that fall in this category. We also explore the distinctive roles of public and private information in this setting, review results for general global games, discuss the relationship between global games and a literature on higher order beliefs in game theory and describe the relationship to local interaction games and dynamic games with payoff shocks.

125 citations

Journal ArticleDOI
TL;DR: Using the semi-tensor product method, this paper investigates the algebraic formulation and strategy optimization for a class of evolutionary networked games with ''myopic best response adjustment'' rule, and presents a number of new results.

125 citations

Journal ArticleDOI
TL;DR: In this article, the authors characterize a class of simple adaptive strategies, in the repeated play of a game, having the Hannanconsistency property: in the long run, the player is guaranteed an average payoff as large as the best-reply payoff to the empirical distribution of play of the other players; i.e., there is no "regret."
Abstract: We exhibit and characterize an entire class of simple adaptive strategies, in the repeated play of a game, having the Hannan-consistency property: In the long-run, the player is guaranteed an average payoff as large as the best-reply payoff to the empirical distribution of play of the other players; i.e., there is no "regret." Smooth fictitious play (Fudenberg and Levine [1995]) and regret-matching (Hart and Mas-Colell [1998]) are particular cases. The motivation and application of this work come from the study of procedures whose empirical distribution of play is, in the long-run, (almost) a correlated equilibrium. The basic tool for the analysis is a generalization of Blackwell's [1956a] approachability strategy for games with vector payoffs.

124 citations

Journal ArticleDOI
TL;DR: A stochastic game-theoretic approach is proposed to analyze the optimal strategies that a power grid defender can adopt to protect the grid against coordinated attacks, and an optimal load shedding technique is devised to quantify the physical impacts of coordinated attacks.
Abstract: Due to the global reliance on the power grid, coordinated cyber-physical attacks on its critical infrastructure can lead to disastrous human and economic losses. In this paper, a stochastic game-theoretic approach is proposed to analyze the optimal strategies that a power grid defender can adopt to protect the grid against coordinated attacks. First, an optimal load shedding technique is devised to quantify the physical impacts of coordinated attacks. Taking these quantified impacts as input parameters, the interactions between a malicious attacker and the defender are modeled using a resource allocation stochastic game. The game is shown to admit a Nash equilibrium and a novel learning algorithm is introduced to enable the two players to reach their equilibrium strategies while maximizing their respective minimum rewards in a sequence of stages. The convergence of the proposed algorithm to a Nash equilibrium point is proved and its properties are studied. Simulation results of the stochastic game model on the WSCC 9-bus system and the IEEE 118-bus system are contrasted with those of static games, and show that different defense resources owned lead to different defense strategies.

124 citations

Journal ArticleDOI
A. W. Merz1
TL;DR: In this article, a third-order pursuit-evasion game with both pursuers and evaders having the same speed and minimum turn radius is described. And the game of kind is first solved for the barrier or envelope of capturable states, and then solved for optimal controls of the two pursuers as functions of the relative position.
Abstract: This paper describes a third-order pursuit—evasion game in which both players have the same speed and minimum turn radius. The game of kind is first solved for thebarrier or envelope of capturable states. When capture is possible, the game of degree is then solved for the optimal controls of the two players as functions of the relative position. The solution is found to include a universal surface for the pursuer and a dispersal surface for the evader.

122 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
81% related
Incentive
41.5K papers, 1M citations
81% related
Heuristics
32.1K papers, 956.5K citations
80% related
Linear programming
32.1K papers, 920.3K citations
79% related
Empirical research
51.3K papers, 1.9M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023364
2022738
2021462
2020512
2019460
2018483