Related papers: Covering games using semi-open sets

An $n$-player game $X$ in normal form can be modeled via undirected discrete graphical models where the discrete random variables represent the players and their state spaces are the set of pure strategies. There exists an edge between the…

In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…

An algebra A of operators on a Banach space X is called strictly semi-transitive if for all non-zero x,y in X there exists an operator S in A such that Sx=y or Sy=x. We show that if A is norm-closed and strictly semi-transitive, then every…

Let $G$ be a Lie group, $\Gamma\subset G$ a discrete subgroup, $X=G/\Gamma$, and $f$ an affine map from $X$ to itself. We give conditions on a submanifold $Z$ of $X$ guaranteeing that the set of points $x\in X$ with $f$-trajectories…

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 this paper spectral theorems for not necessarily continuous normal and self-adjoint random operators on a complex separable Hilbert space are proved.

This paper coins the notion of Joker games, a variant of concurrent games where the players are not strictly adversarial. Instead, Player 1 can get help from Player 2 by playing a Joker move. We formalize these games as cost games and…

We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where…

This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial asynchronism, i.e., each agent updates at least once within…

We provide conceptual proofs of the two most fundamental theorems concerning topological games and open covers: Hurewicz's Theorem concerning the Menger game, and Pawlikowski's Theorem concerning the Rothberger game.

In an influential paper, Erd\H{o}s and Selfridge introduced the Maker-Breaker game played on a hypergraph, or equivalently, on a monotone CNF. The players take turns assigning values to variables of their choosing, and Breaker's goal is to…

We study a class of semi-discrete variational problems that arise in economic matching and game theory, where agents with continuous attributes are matched to a finite set of outcomes with a one dimensional structure. Such problems appear…

The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…

In this paper, we introduce and study the concepts of semi open SOM) and semi closed (SCM) M-sets in multiset topological spaces.With this generalization of the notions of open and closed sets in M-topology, we generalize the concept of…

Let $G$ be a finite group acting linearly on $\mathbb{R}^n$. A celebrated Theorem of Procesi and Schwarz gives an explicit description of the orbit space $\mathbb{R}^n /\!/G$ as a basic closed semi-algebraic set. We give a new proof of this…

The aim of this paper is to study the topological properties of some classes of subsemimodules endowed with a subbasis closed-set topology. We show that such spaces are $T_0$. When the semimodule is finitely generated, those spaces are…

We develop a theory of combinatorial games that is appropriate for describing positions in Hex and other monotone set coloring games. We consider two natural conditions on such games: a game is monotone if all moves available to both…

We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…

This paper studies Bayesian games with general action spaces, correlated types and interdependent payoffs. We introduce the condition of ``decomposable coarser payoff-relevant information'', and show that this condition is both sufficient…

We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…