Related papers: Hydra games for recursively Mahlo operations
This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this is sound if Player 0 wins an infinite-duration Muller game if and only if she…
The main theorem of this paper establishes conditions under which the "chaos game" algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non contractive iterated…
A multiple integral functional is equivalent to a curvilinear integral functional, if the domain is a hyper-parallelepiped, but equivalence is only theoretical. The introduction of this kind of functionals in multitime optimal control…
We determine the optimal bound for the maximum number of moves required to reach a periodic configuration of open mancala (also called open owari), inspired by a popular African game. A mancala move can be interpreted as a map from the set…
This paper proposes a new mathematical paradigm to analyze discrete-time mean-field games. It is shown that finding Nash equilibrium solutions for a general class of discrete-time mean-field games is equivalent to solving an optimization…
We introduce parallelism into the basic algebra of games to model concurrent game algebraically. Parallelism is treated as a new kind of game operation. The resulted algebra of concurrent games can be used widely to reason the parallel…
In this paper we provide a case study of the use of relatively sophisticated mathematics and algorithms to redefine and adapt a simple traditional game/puzzle to exploit the computational power of smart devices. The focus here is not so…
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively…
Strong Parallel Repetition for Unique Games on Small Set Expanders The strong parallel repetition problem for unique games is to efficiently reduce the 1-delta vs. 1-C*delta gap problem of Boolean unique games (where C>1 is a sufficiently…
A Linear Quadratic Deterministic Continuous Time Game with many symmetric players is considered and the Linear Feedback Nash strategies are studied as the number of players goes to infinity. We show that under some conditions the limit of…
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound…
We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…
We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a…
People, robots, and companies mostly divide time and effort among projects, and \defined{shared effort games} model people investing resources in public endeavors and sharing the generated values. In linear $\theta$ sharing (effort) games,…
We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids.
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's…
We study the $k$-jump normal and $k$-jump mis\`{e}re games on rooted Galton-Watson trees, expressing the probabilities of various outcomes of these games as specific fixed points of certain functions that depend on $k$ and the offspring…
We propose a new viewpoint on variational mean-field games with diffusion and quadratic Hamiltonian. We show the equivalence of such mean-field games with a relative entropy minimization at the level of probabilities on curves. We also…