1 Summary We discuss strategies in non-zero sum games of perfect information on graphs. The study of non-zero sum games on graphs is motivated by the advent of computational tasks on the worldwide web and related security requirements which have thrown up many interesting areas of interaction between game theory and computer science. For example, signing contracts on the web requires interactio...

We analyze in...nitely repeated prisoners’ dilemma games with imperfect private monitoring, and construct sequential equilibria where strategies are measurable with respect to players’ beliefs regarding their opponents’ continuation strategies. We show that, when monitoring is almost perfect, the symmetric e¢cient outcome can be approximated in any prisoners’ dilemma game, while every individua...

The distinction between games of chance and games of skill is not well-defined at present. We introduce the concept of chanciness for non-deterministic two-player zero-sum games with sequential moves and perfect information. chanciness quantifies how strongly a game is influenced by chance events. We demonstrate that the relative influence of chance on game outcomes varies with the skill of the...

Thin plate structures are more widely used in many engineering applications as one of the structural members. Generally, buckling strength of thin shell structures is the ultimate load carrying capacity of these structures. The presence of cracks in a thin shell structure can considerably affect its load carrying capacity. Hence, in this work, static buckling strength of a thin square plate wit...

We show that supermodular games satisfying sequential better-reply security possess a pure strategy perfect equilibrium and a strategically stable set of pure strategy equilibria. We illustrate that in continuous supermodular games, perfect equilibria may contain weakly dominated actions. Moreover, in discontinuous supermodular games satisfying sequential better-reply security, perfect equilibr...

ion Refinement for Games with Incomplete Information∗ Rayna Dimitrova, Bernd Finkbeiner Universität des Saarlandes {dimitrova,finkbeiner}@cs.uni-sb.de ABSTRACT.Counterexample-guided abstraction refinement (CEGAR) is used in automated software analysis to find suitable finite-state abstractions of infinite-state systems. In this paper, we extend CEGAR to games with incomplete information, as the...

The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a nec...

Monte-Carlo Tree Search (MCTS) is a class of game tree search algorithms that have recently proven successful for deterministic games of perfect information, particularly the game of Go. Determinization is an AI technique for making decisions in stochastic games of imperfect information by analysing several instances of the equivalent deterministic game of perfect information. In this paper we ...

The standard way of making probability mathematical begins with measure theory. This article reviews an alternative that begins with game theory. We discuss how probabilities can be calculated game-theoretically, how probability theorems can be proven and interpreted game-theoretically, and how this approach differs from the measure-theoretic approach.