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
Proceedings Article
03 Mar 2003
TL;DR: A technique for communicating binary data comprising adding the transmitted data signals to develop a check sum, transmitting the check sum immediately following the "end-of-transmission" signal, and comparing said received signal sum with said check sum to verify message integrity.
Abstract: A technique for communicating binary data comprising adding the transmitted data signals to develop a check sum, transmitting the check sum immediately following the "end-of-transmission" signal, receiving the transmitted data signals together with said check sum, adding the data signals received to develop a received signal sum, and comparing said received signal sum with said check sum to verify message integrity. Both method and apparatus are disclosed.

83 citations

Journal ArticleDOI
TL;DR: In this paper, Du et al. investigated the phase transition-like behavior of quantum games and suggested a method which would help to illuminate the origin of such a kind of behaviour, and they found that, for different settings of the numerical values in the payoff table, even though the classical game behaves the same, the quantum game exhibits different and interesting phase-transition-like behaviour.
Abstract: The discontinuous dependence of the properties of a quantum game on its entanglement has been shown to be very much like phase transitions viewed in the entanglement-payoff diagram (J Du et al 2002 Phys. Rev. Lett. 88 137902). In this paper we investigate such phase-transition-like behaviour of quantum games, by suggesting a method which would help to illuminate the origin of such a kind of behaviour. For the particular case of the generalized Prisoners' Dilemma, we find that, for different settings of the numerical values in the payoff table, even though the classical game behaves the same, the quantum game exhibits different and interesting phase-transition-like behaviour.

82 citations

Posted Content
TL;DR: In this article, the authors explore the implications of distinguishing between the concepts of intrinsic marginal contributions and externalities for games in partition function form, and provide upper and lower bounds to players' payoffs when affected by external effects.
Abstract: For games in partition function form, we explore the implications of distinguishing between the concepts of intrinsic marginal contributions and externalities. If one requires efficiency for the grand coalition, we provide several results concerning extensions of the Shapley value. Using the axioms of efficiency, anonymity, marginality and monotonicity, we provide upper and lower bounds to players' payoffs when affected by external effects, and a characterization of an ''externality-free'' value. If the grand coalition does not form, we characterize a payoff configuration on the basis of the principle of balanced contributions. We also analyze a game of coalition formation that yields sharp predictions

82 citations

Book ChapterDOI
23 Aug 2010
TL;DR: It is shown that the problem of determining if an energy game with imperfect information with fixed initial credit has a winning strategy is decidable, while the question of the existence of some initial credit such that the game has awinning strategy is undecidable.
Abstract: We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistinguishable states, giving players partial knowledge of the state. In an energy game, the weights represent resource consumption and the objective of the game is to maintain the sum of weights always nonnegative. In a mean-payoff game, the objective is to optimize the limit-average usage of the resource. We show that the problem of determining if an energy game with imperfect information with fixed initial credit has a winning strategy is decidable, while the question of the existence of some initial credit such that the game has a winning strategy is undecidable. This undecidability result carries over to meanpayoff games with imperfect information. On the positive side, using a simple restriction on the game graph (namely, that the weights are visible), we show that these problems become EXPTIME-complete.

82 citations

Journal ArticleDOI
TL;DR: Flexibility of the suppliers' capability is also found to affect the PPD decisions and the use of platform commonality and modularity has been found generally beneficial not only to the supply chain as a whole but also to individual players that are eventually configured into the game.
Abstract: This paper is concerned with optimizing the configuration of a set of platform products and the associated supply chain consisting of one manufacturer and multiple suppliers using a three-move dynamic game-theoretic approach. The variants in the product family share a common platform for developing/configuring variant modules which are substitutable in the sense that high-end module options can functionally replace low-end ones at higher prices. As the customer in the supply chain, the manufacturer takes its leading role by making the first move to give decisions on platform products development (PPD) and supplier selection. The concerned suppliers make the second move to optimize their decisions including price discounts and their ordering policies. The manufacturer finishes the game by taking the last move to make his ordering decisions. The ranges of the rational reactions for the players are derived from the analyses of their payoff models, and an enumerative algorithm is developed to find the subgame perfect equilibrium of the game through the technique of backward induction. The game model and the proposed solution procedure are illustrated through a series of simulation experiments and sensitivity analyses using a numerical example. The results have allowed us to draw some meaningful interpretations and useful managerial insights. The use of platform commonality and modularity has been found generally beneficial not only to the supply chain as a whole but also to individual players that are eventually configured into the game. Flexibility of the suppliers' capability is also found to affect the PPD decisions

82 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