Related papers: Binary dicots, a core of dicot games

Imitation is simple behavior which uses successful actions of others in order to deal with one's own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or…

Compositional Game Theory is a new, recently introduced model of economic games based upon the computer science idea of compositionality. In it, complex and irregular games can be built up from smaller and simpler games, and the equilibria…

Number games play a central role in alternating normal play combinatorial game theory due to their real-number-like properties (Conway 1976). Here we undertake a critical re-examination: we begin with integer and dyadic games and identify…

Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such…

Ehrenfeucht-Fraisse games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht- Fraisse games to hybrid-dynamic…

Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation. Recently found zero-determinant strategies have substantially been…

A partial differential equation is derived, describing the replicator dynamics with mutations of games with a continuous strategy space. This equation is then applied to continuous versions of symmetric 2x2 games, such as the Prisoners…

Utilitarian games such as dictator games to measure fairness have been studied in the social sciences for decades. These games have given us insight into not only how humans view fairness but also in what conditions the frequency of…

Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b-matchings, for a vertex capacity vector $b \leq 2$. We show how to separate over the core of 2-matching…

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 voting games on binary issues, where voters hold an objective over the outcome of the collective decision and are allowed, before the vote takes place, to negotiate their voting strategy with the other participants. We analyse the…

This is an introduction into John Conway's beautiful Combinatorial Game Theory, providing precise statements and detailed proofs for the fundamental parts of his theory. (1) Combinatorial game theory, (2) the GROUP of games, (3) the FIELD…

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…

A group of students in 7-9 grades are inventing combinatorial impartial games. The games are played on graphs, piles, and grids. We found winning positions, optimal strategies, and other interesting facts about the games.

Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for…

We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational) logic-based involving advanced techniques from…

In classical game theory, optimal strategies are determined for games with complete information; this requires knowledge of the opponent's goals. We analyze games when a player is mistaken about their opponents goals. For definitiveness, we…

In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…

Mis\`ere games in general have little algebraic structure, but if the games under consideration have properties then some algebraic structure re-appears. In 2023, the class of Blocking games was identified. Mis\`ere Cricket Pitch was…

This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…