相关论文: Relaxed Wythoff has All Beatty Solutions

This paper considers discounted infinite horizon mean field games by extending the probabilistic weak formulation of the game as introduced by Carmona and Lacker (2015). Under similar assumptions as in the finite horizon game, we prove…

Evolutionary social dilemma games are extended by an additional matching-pennies game that modifies the collected payoffs. In a spatial version players are distributed on a square lattice and interact with their neighbors. Firstly, we show…

Driven by recent successes in two-player, zero-sum game solving and playing, artificial intelligence work on games has increasingly focused on algorithms that produce equilibrium-based strategies. However, this approach has been less…

Positional games are a mathematical class of two-player games comprising Tic-tac-toe and its generalizations. We propose a novel encoding of these games into Quantified Boolean Formulas (QBFs) such that a game instance admits a winning…

Discretely-constrained Nash-Cournot games have attracted attention as they arise in various competitive energy production settings in which players must make one or more discrete decisions. Gabriel et al. ["Solving discretely-constrained…

In recent work, Watanabe, Eberhart, Asada, and Hasuo have shown that parity games can be seen as string diagrams, that is, as the morphisms of a symmetric monoidal category, an algebraic structure with two different operations of…

In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an…

We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…

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…

We introduce a generalized Dynkin game problem with non linear conditional expectation ${\cal E}$ induced by a Backward Stochastic Differential Equation (BSDE) with jumps. Let $\xi, \zeta$ be two RCLL adapted processes with $\xi \leq…

In this paper, we want to investigate some kind of Dynkin's game under ambiguity which is represented by Backward Stochastic Differential Equation (shortly BSDE) with standard generator function g(t, y, z). Under regular assumptions, a pair…

We prove that every two-player non-zero-sum Borel game with lower-semi-continuous payoffs admits a subgame-perfect $\ep$-equilibrium. This result complements Example 3 in Solan and Vieille (2003), which shows that a subgame-perfect…

We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a prediction on the Hider's position. The objective is to…

It is well-known that the winning region of a parity game with $n$ nodes and $k$ priorities can be computed as a $k$-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires…

The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied games in positional games theory, including results on biased games, games on random graphs and fast winning strategies. Recently, the Connector-Breaker…

The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph $G$. If $xyz$ forms a path in $G$ and there are pegs on vertices $x$ and $y$ but not…

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

This paper provides necessary and sufficient conditions for a pair of randomised stopping times to form a saddle point of a zero-sum Dynkin game with partial and/or asymmetric information across players. The framework is non-Markovian and…

In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…

An optical model of classical photons propagating through array of many beam splitters is developed to give a physical analogy of Parrondo's game and Parrondo-Harmer-Abbott game. We showed both the two games are reasonable game without…