Related papers: Post-selection games
In this work, we explore a new direction by complementing the game-theoretic applications of nonlocal correlations through appropriately formulated games using temporal quantum correlations. In the context of Bayesian games, we show the way…
Programs increasingly rely on randomization in applications such as cryptography and machine learning. Analyzing randomized programs has been a fruitful research direction, but there is a gap when programs also exploit nondeterminism (for…
We extend the formalism of Conjectural Variations games to Stackelberg games involving multiple leaders and a single follower. To solve these nonconvex games, a common assumption is that the leaders compute their strategies having perfect…
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different…
We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
Following the solution to the One-Round Voronoi Game in arXiv:2011.13275, we naturally may want to consider similar games based upon the competitive locating of points and subsequent dividing of territories. In order to appease the tears of…
Bound entanglement, being entangled yet not distillable, is essential to our understandings of the relations between nonlocality and entanglement besides its applications in certain quantum information tasks. Recently, bound entangled…
A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…
It is shown that Popescu-Rohrlich nonlocal boxes (beating the Tsirelson bound for Bell inequality) do exist in the existing structures of both quantum and classical theory. In particular, we design an explicit example of measure-and-prepare…
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…
In this article we prove the existence of classical solutions to a system of mean field games arising in the study of exhaustible resource production under market competition. Individual trajectories are modeled by a controlled diffusion…
We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry…
In this work, we study a particular class of Bell inequalities involving only direct equality-comparisons of outcomes. This arises naturally when outcomes are difficult to characterize. For instance, if measurements yield smells, it may be…
Poker is a challenging problem for artificial intelligence, with non-deterministic dynamics, partial observability, and the added difficulty of unknown adversaries. Modelling all of the uncertainties in this domain is not an easy task. In…
As part of a challenge to critics of Bell's analysis of the EPR argument, framed in the form of a bet, R. D. Gill formulated criteria to assure that all non-locality is precluded from simulation-algorithms used to test Bell's theorem. This…
We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with…
We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both…
In this paper we connect selection principles on a topological space to corresponding selection principles on one of its hyperspaces. We unify techniques and generalize theorems from the known results about selection principles for common…