Related papers: Conway games, algebraically and coalgebraically

In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation…

The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…

Behavioral diversity, expert imitation, fairness, safety goals and others give rise to preferences in sequential decision making domains that do not decompose additively across time. We introduce the class of convex Markov games that allow…

A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…

Human computation games (HCGs) are a crowdsourcing approach to solving computationally-intractable tasks using games. In this paper, we describe the need for generalizable HCG design knowledge that accommodates the needs of both players and…

Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and…

We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…

We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…

We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…

We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables…

Traditionally social sciences are interested in structuring people in multiple groups based on their individual preferences. This pa- per suggests an approach to this problem in the framework of a non- cooperative game theory. Definition of…

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview, technical section in it, devoted to a proof of the…

Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…

Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' actions. In concave games, where players' strategy sets are…

We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…

The present article is a brief informal survey of computability logic --- the game-semantically conceived formal theory of computational resources and tasks. This relatively young nonclassical logic is a conservative extension of classical…