Related papers: Banach-Mazur game played in partially ordered sets
We discuss partial specifications in first-order logic FO and also in a Turing-complete extension of FO. We compare the compositional and game-theoretic approaches to the systems.
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
We consider a class of deterministic mean field games, where the state associated with each player evolves according to an ODE which is linear w.r.t. the control. Existence, uniqueness, and stability of solutions are studied from the point…
The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…
In a finite two player game consider the matrix of one player's payoff difference between any two consecutive pure strategies. Define the half space induced by a column vector of this matrix as the set of vectors that form an obtuse angle…
A Bayesian game is said to have nested information if the players are ordered, and each player knows the types of all players that follow her in that order. We prove that all multiplayer Bayesian games with finite actions spaces, bounded…
In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascending subsequence of length a or a descending one of length d.…
We consider an extension of a noncooperative game problem where players have joint binding constraints. In this case, justification of a generalized equilibrium point needs a reasonable mechanism for attaining this state. We suggest to…
Absolute Universes of combinatorial games, as defined in a recent paper by the same authors, include many standard short normal- mis\`ere- and scoring-play monoids. In this note we show that the class is categorical, by extending Joyal's…
This paper contains a reformulation of any $n$-player finite, static game into a framework of distributed, dynamical system based on agents' payoff-based deviations. The reformulation generalizes the method employed in the second part of…
Traditional game theory assumes that the players in the game are aware of the rules of the game. However, in practice, often the players are unaware or have only partial knowledge about the game they are playing. They may also have…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
We show that the Brier game of prediction is mixable and find the optimal learning rate and substitution function for it. The resulting prediction algorithm is applied to predict results of football and tennis matches. The theoretical…
We study the computational complexity of solving stochastic games with mean-payoff objectives. Instead of identifying special classes in which simple strategies are sufficient to play $\epsilon$-optimally, or form $\epsilon$-Nash…
We consider a symmetric two-player contest, in which the choice set of effort is constrained. We apply a fundamental property of the payoff function to show that, under standard assumptions, there exists a unique Nash equilibrium in pure…
For an ascending correspondence $F:X\to 2^X$ with chain-complete values on a complete lattice $X$, we prove that the set of fixed points is a complete lattice. This strengthens Zhou's fixed point theorem. For chain-complete posets that are…
We consider Schmidt's game on the space of compact subsets of a given metric space equipped with the Hausdorff metric, and the space of continuous functions equipped with the supremum norm. We are interested in determining the generic…
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding…