Related papers: Cookie Monster Plays Games
We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…
We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in $\mathbb{R}^d$ based on some rules. Variants include boundedness games, where one player wants to keep the positions…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
Game theory is used by all behavioral sciences, but its development has long centered around tools for relatively simple games and toy systems, such as the economic interpretation of equilibrium outcomes. Our contribution, compositional…
Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
We show the value of positions of the combinatorial game ``Toads and Frogs''. We present new values of starting positions. Moreover, we discuss the values of all positions with exactly one $\Box, \regT^{a}\Box\Box \regF^{a}, \regT^{a} \Box…
We present a general framework for carrying out some constructions. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which…
Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction…
Hedonic games -- at the interface of cooperative game theory and computational social choice -- are coalition formation games in which the players have preferences over the coalitions they can join. Kerkmann et al. [13] introduced…
A quantum version of the Matching Pennies (MP) game is proposed that is played using an Einstein-Podolsky-Rosen-Bohm (EPR-Bohm) setting. We construct the quantum game without using the state vectors, while considering only the quantum…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
In many cases the Nash equilibria are not predictive of the experimental players' behaviour. For some games of Game Theory it is proposed here a method to estimate the probabilities with which the different options will be actually chosen…
Poker is a multiplayer game of imperfect information and has been widely studied in game theory. Many popular variants of poker (e.g., Texas Hold'em and Omaha) at the edge of modern game theory research are large games. However, even toy…
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…
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…
We introduce $p$-adic manifold learning, propose an algorithm to solve it, and propose benchmark tasks from impartial games.
It is sometimes the case that one solution concept in game theory is equivalent to applying another solution concept to a modified version of the game. In such cases, does it make sense to study the former separately (as it applies to the…