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 published on a yearly basis
Papers
More filters
TL;DR: The authors explored the extent to which altruism, as measured by giving in a dictator game (DG), accounts for play in a noisy version of the repeated prisoner's dilemma and found that DG giving is correlated with cooperation in the repeated game when no cooperative equilibria exist, but not when cooperation is an equilibrium.
Abstract: We explore the extent to which altruism, as measured by giving in a dictator game (DG), accounts for play in a noisy version of the repeated prisoner’s dilemma. We find that DG giving is correlated with cooperation in the repeated game when no cooperative equilibria exist, but not when cooperation is an equilibrium. Furthermore, none of the commonly observed strategies are better explained by inequity aversion or efficiency concerns than money maximization. Various survey questions provide additional evidence for the relative unimportance of social preferences. We conclude that cooperation in repeated games is primarily motivated by long-term payoff maximization and that even though some subjects may have other goals, this does not seem to be the key determinant of how play varies with the parameters of the repeated game. In particular, altruism does not seem to be a major source of the observed diversity of play.
95 citations
TL;DR: A theoretical framework in which to cast the source identification problem is introduced and the ultimate achievable performance of the forensic analysis in the presence of an adversary aiming at deceiving it is derived.
Abstract: We introduce a theoretical framework in which to cast the source identification problem. Thanks to the adoption of a game-theoretic approach, the proposed framework permits us to derive the ultimate achievable performance of the forensic analysis in the presence of an adversary aiming at deceiving it. The asymptotic Nash equilibrium of the source identification game is derived under an assumption on the resources on which the forensic analyst may rely. The payoff at the equilibrium is analyzed, deriving the conditions under which a successful forensic analysis is possible and the error exponent of the false-negative error probability in such a case. The difficulty of deriving a closed-form solution for general instances of the game is alleviated by the introduction of an efficient numerical procedure for the derivation of the optimum attacking strategy. The numerical analysis is applied to a case study to show the kind of information it can provide.
95 citations
TL;DR: A two-stage game that involves three container terminals located in Karachi Port in Pakistan is discussed and it is revealed that one combination does not satisfy the superadditivity property of the characteristic function and can therefore be ruled out.
94 citations
01 Dec 2007
TL;DR: This work introduces three different payoff based processes for increasingly general scenarios and proves that after a sufficiently large number of stages, player actions constitute a Nash equilibrium at any stage with arbitrarily high probability.
Abstract: We consider repeated multi-player games in which players repeatedly and simultaneously choose strategies from a finite set of available strategies according to some strategy adjustment process. We focus on the specific class of weakly acyclic games, which is particularly relevant for multi-agent cooperative control problems. A strategy adjustment process determines how players select their strategies at any stage as a function of the information gathered over previous stages. Of particular interest are "payoff based" processes, in which at any stage, players only know their own actions and (noise corrupted) payoffs from previous stages. In particular, players do not know the actions taken by other players and do not know the structural form of payoff functions. We introduce three different payoff based processes for increasingly general scenarios and prove that after a sufficiently large number of stages, player actions constitute a Nash equilibrium at any stage with arbitrarily high probability. We also show how to modify player utility functions through tolls and incentives in so-called congestion games, a special class of weakly acyclic games, to guarantee that a centralized objective can be realized as a Nash equilibrium. We illustrate the methods with a simulation of distributed routing over a network.
94 citations
TL;DR: In this article, a new model aimed at predicting behavior in games involving a randomized allocation procedure is presented, which is designed to capture the relative importance and interaction between procedural justice and distributive justice, defined crudely in terms of the difference between one's expected payoff and average expected payoff in the group.
Abstract: This article presents a new model aimed at predicting behavior in games involving a randomized allocation procedure. It is designed to capture the relative importance and interaction between procedural justice (defined crudely in terms of the difference between one’s expected payoff and average expected payoff in the group) and distributive justice (difference between own and average actual payoffs). The model is applied to experimental games, including “randomized” variations of simple sequential bargaining games, and delivers qualitatively correct predictions. In view of the model redistribution of income can be seen as a substitute for vertical social mobility. This contributes to the explanation of greater demand for redistribution in European countries vis-a-vis the United States. I conclude with suggestions for further verification of the model and possible extensions.
94 citations