Related papers: A probabilistic look at the infinite hat-guessing …
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called "codemaker", chooses a secret code and…
This work introduces the concept of Variable Size Game Theory (VSGT), in which the number of players in a game is a strategic decision made by the players themselves. We start by discussing the main examples in game theory: dominance,…
Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products,…
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…
In this article we will propose a completely new point of view for solving one of the most important paradoxes concerning game theory. The solution develop shifts the focus from the result to the strategy s ability to operate in a cognitive…
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…
A major open problem in the area of infinite-duration games is to characterize winning conditions that are determined in finite-memory strategies. Infinite-duration games are usually studied over edge-colored graphs, with winning conditions…
We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.
We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…
We consider how to make probability forecasts of binary labels. Our main mathematical result is that for any continuous gambling strategy used for detecting disagreement between the forecasts and the actual labels, there exists a…
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…
Determining an individual's strategic reasoning capability based solely on choice data is a complex task. This complexity arises because sophisticated players might have non-equilibrium beliefs about others, leading to non-equilibrium…
We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity…
We analyze the general version of the classic guessing game Mastermind with $n$ positions and $k$ colors. Since the case $k \le n^{1-\varepsilon}$, $\varepsilon>0$ a constant, is well understood, we concentrate on larger numbers of colors.…
An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…
Strategic decision-making in uncertain and adversarial environments is crucial for the security of modern systems and infrastructures. A salient feature of many optimal decision-making policies is a level of unpredictability, or randomness,…
We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
Relying on recent generalizations of the Fra\"iss\'e theory to a broader category-theoretic context, we study the class of abstract finite games played between two players and show the existence of an infinitetly countable game which is…
This paper studies a language-based opacity enforcement in a two-player, zero-sum game on a graph. In this game, player 1 (P1) wins if it can achieve a secret temporal goal described by the language of a finite automaton, no matter what…