Related papers: Concurrent Strategies on Games with Algebras

Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two…

Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate the how the rounds are…

Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the risk that the solutions we compute are not robust to errors in this specification. Ordinal games provide an attractive alternative: they require…

The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world,…

Patterns of wins and losses in pairwise contests, such as occur in sports and games, consumer research and paired comparison studies, and human and animal social hierarchies, are commonly analyzed using probabilistic models that allow one…

Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without being equal in general. This paper provides a survey of…

This paper models games where the strategies are nodes of a graph G (we denote them as G-games) and in presence of coalition structures. The cases of one-shot and repeated games are presented. In the latter situation, coalitions are assumed…

Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…

It is known that a player in a noncooperative game can benefit by publicly restricting his possible moves before play begins. We show that, more generally, a player may benefit by publicly committing to pay an external party an amount that…

Inspired by asynchronous cooperative Parrondo's games we introduce two new types of games in which all players simultaneously play game A or game B or a combination of these two games. These two types of games differ in the way a…

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

We introduce a new family of Parrondo's games of alternating losing strategies in order to get a winning result. In our version of the games we consider an ensemble of players and use "social" rules in which the probabilities of the games…

Synchronous linear constraint system games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated to these games encode information about the existence of…

In this paper we analyse tiebreak results from some tennis players in order to investigate whether we are able to identify some strategy in this crucial moment of the game. We compared the observed results with a binomial distribution…

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…

Decision making in modern large-scale and complex systems such as communication networks, smart electricity grids, and cyber-physical systems motivate novel game-theoretic approaches. This paper investigates big strategic (non-cooperative)…

Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…

We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…

A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…

We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…