For games of simultaneous action selection and network formation, gametheoretic behavior and experimental observations are not in line: While theory typically predicts inefficient outcomes for (anti-)coordination games, experiments show that subjects tend to play efficient (non Nash) strategy profiles. A reason for this discrepancy is the tendency to model corresponding games as one-shot and de...

Previous work shows that reputation results may fail in repeated games with long-run players with equal discount factors. We restrict attention to stage games where two players, with equal discount factors, move sequentially. A pure Stackelberg action is assumed to exist. One and two sided reputation results are provided. If one of the players is a Stackelberg type with positive probability, th...

—Implementations of mobile games have become prevalent industrial technology due to the ubiquitous nature of mobile devices. However, simultaneous-movement multiplayer games – games that a player competes simultaneously with other players – are usually affected by such parameters as latency, type of game architecture and type of communication technology. This paper makes a review of the above p...

The Shapley value assigns, to each game that is adequately represented by its characteristic function, an outcome for each player. An elaboration on the Shapley value that assigns, to characteristic function games, a “partition function”outcome is broadly established and accepted, but elaborations to encompass games with externalities (represented by partition functions) are not. Here, I show t...

This paper presents a monoidal category whose morphisms are games (in the sense of game theory, not game semantics) and an associated diagrammatic language. The two basic operations of a monoidal category, namely categorical composition and tensor product, correspond roughly to sequential and simultaneous composition of games. This leads to a compositional theory in which we can reason about pr...

1 Abstract—Implementations of mobile games have become prevalent industrial technology due to the ubiquitous nature of mobile devices. However, simultaneous-movement multiplayer games – games that a player competes simultaneously with other players – are usually affected by such parameters as latency, type of game architecture and type of communication technology. This paper makes a review of t...

This paper provides an analysis of error propagation in Approximate Dynamic Programming applied to zero-sum two-player Stochastic Games. We provide a novel and unified error propagation analysis in Lp-norm of three well-known algorithms adapted to Stochastic Games (namely Approximate Value Iteration, Approximate Policy Iteration and Approximate Generalized Policy Iteratio,n). We show that we ca...

Monte Carlo Tree Search (MCTS) has recently been successfully used to create strategies for playing imperfect-information games. Despite its popularity, there are no theoretic results that guarantee its convergence to a well-defined solution, such as Nash equilibrium, in these games. We partially fill this gap by analysing MCTS in the class of zero-sum extensive-form games with simultaneous mov...

There is limited formal mathematical analysis of one type of games — dynamic sequential games with large, or even infinitely large, planning horizons, from the point view of system controls. In this paper, we use a zero-sum game theoretical approach to address the disturbance attenuation analysis of state feedback Nash strategies for Dynamic Linear Quadratic Sequential Games (LQSGs) with uncert...