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
Journal ArticleDOI
TL;DR: In this paper, an incomplete information game model is proposed to study the competitive behavior among individual generating companies (GENCOs), in which each GENCO is modeled as an agent and each agent makes strategic generation capacity expansion decisions based on its incomplete information on other GENCOs.
Abstract: To study the competitive behavior among individual generating companies (GENCOs), an incomplete information game model is proposed in this paper in which each GENCO is modeled as an agent. Each agent makes strategic generation capacity expansion decisions based on its incomplete information on other GENCOs. The formation of this game model falls into a bi-level optimization problem. The upper level of this problem is the GENCOs' own decision on optimal planning strategies and energy/reserve bidding strategies. The lower-level problem is the ISO's market clearing problem that minimizes the cost to supply the load, which yields price signals for GENCOs to calculate their own payoffs. A co-evolutionary algorithm combined with pattern search is proposed to optimize the search for the Nash equilibrium of the competition game with incomplete information. The Nash equilibrium is obtained if all GENCOs reach their maximum expected payoff assuming the planning strategies of other GENCOs' remain unchanged. The physical withholding of capacity is considered in the energy market and the Herfindahl-Hirschman index is utilized to measure the market concentration. The competitive behaviors are analyzed in three policy scenarios based on different market rules for reserve procurement and compensation.

136 citations

Journal ArticleDOI
TL;DR: In this article, the authors studied the effects of slowly varying small-world topology and additive spatiotemporal random variations, introduced to the payoffs of a spatial prisoner's dilemma game, on the evolution of cooperation.
Abstract: We study effects of slowly varying small-world topology and additive spatiotemporal random variations, introduced to the payoffs of a spatial prisoner's dilemma game, on the evolution of cooperation. We show that there exists an optimal fraction of shortcut links, constituting the variable complex network of participating players of the game, for which noise-induced cooperation is resonantly enhanced, thus marking a double resonance phenomenon in the studied system. The double resonance is attributed to the time-dependence of the connectivity structure that induces a tendency towards the mean-field behaviour in the limit of random graphs. We argue that random payoff disturbances and complex network topology are two potent extrinsic factors able to boost cooperation, thus representing a viable escape hatch out of evolutionary stalemate.

135 citations

Journal ArticleDOI
TL;DR: In this paper, the authors assume that the players who participate in such a game are part of some permission structure, which means there are players who need permission from one or more other players before they can act or cooperate.

135 citations

Patent
26 May 1999
TL;DR: A tamper resistant lottery ticket for preventing payoff of invalid tickets comprises a ticket body and a plurality of game files which are choosable by a lottery player as discussed by the authors, and at least one winning symbol for the ticket is positioned in a game field, and a scratch-off material covers the game fields to hide contents of the games and therefore hide the winning symbol.
Abstract: A tamper resistant lottery ticket for preventing payoff of invalid tickets comprises a ticket body and a plurality of game files which are choosable by a lottery player. At least one winning symbol for the ticket is positioned in a game field, and a scratch-off material covers the game fields to hide contents of the game fields and therefore hide the at least one winning symbol. The scratch-off material is removable by a lottery player to reveal the contents of a game field when the game field is chosen. A readable security code is printed in each of the game fields, and the security code is covered by a scratch-off material with the at least one winning symbol and is revealed when the content of the game field is chosen and the scratch-off material is removed. The security codes of the ticket may be read to ensure that the proper number of game field contents are revealed and the lottery ticket is valid.

135 citations

Proceedings ArticleDOI
28 Jul 2002
TL;DR: Two algorithms for finding approximate equilibria in structured game representations, where the interaction between the agents is sparse, are presented, one based on a hill-climbing approach and one on constraint satisfaction, and it is shown that these algorithms exploit the game structure to achieve faster computation.
Abstract: Consider the problem of a group of agents trying to find a stable strategy profile for a joint interaction. A standard approach is to describe the situation as a single multiplayer game and find an equilibrium strategy profile of that game. However, most algorithms for finding equilibria are computationally expensive; they are also centralized, requiring that all relevant payoff information be available to a single agent (or computer) who must determine the entire equilibrium profile. In this paper, we exploit two ideas to address these problems. We consider structured game representations, where the interaction between the agents is sparse, an assumption that holds in many real-world situations. We also consider the slightly relaxed task of finding an approximate equilibrium. We present two algorithms for finding approximate equilibria in these games, one based on a hill-climbing approach and one on constraint satisfaction. We show that these algorithms exploit the game structure to achieve faster computation. They are also inherently local, requiring only limited communication between directly interacting agents. They can thus be scaled to games involving large numbers of agents, provided the interaction between the agents is not too dense.

134 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