相关论文: A game on partial orderings

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a…

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves. Payoff is determined by a Borel measurable function $f$ on the set of possible…

In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…

We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…

n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…

Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they…

Cooperative games are an important class of problems in game theory, where the goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector…

We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…

In a game of incomplete information, an infinite state space can create problems. When the space is uncountably large, the strategy spaces of the players may be unwieldly, resulting in a lack of measurable equilibria. When the knowledge of…

The Kolmogorov complexity function K can be relativized using any oracle A, and most properties of K remain true for relativized versions. In section 1 we provide an explanation for this observation by giving a game-theoretic interpretation…

We consider positively supported Borel measures for which all moments exist. On the set of compactly supported measures in this class a partial order is defined via eventual dominance of the moment sequences. Special classes are identified…

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

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…

A finite impartial game is a two-player game in which the players take turns making moves and the game ends after finitely many moves. In this paper, we study a class of finite impartial games introduced by H.~Lenstra, which we call coin…

This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given $m$ random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the…

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…

We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore…

Deterministic game-solving algorithms are conventionally analyzed in the light of their average-case complexity against a distribution of random game-trees, where leaf values are independently sampled from a fixed distribution. This…

A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is…