Related papers: On Skew-Symmetric Games
This paper provides sufficient conditions for the existence of solutions for two-person zero-sum games with inf/sup-compact payoff functions and with possibly noncompact decision sets for both players. Payoff functions may be unbounded, and…
This paper introduces semi-competitive differential game logic dGLsc, which enables verification of safety-critical applications that involve interactions between two agents. In dGLsc, these interactions are specified as games on hybrid…
Two selection games from the literature, $G_c(\mathcal O,\mathcal O)$ and $G_1(\mathcal O_{zd},\mathcal O)$, are known to characterize countable dimension among certain spaces. This paper studies their perfect- and limited-information…
We study symmetric bimatrix games that also have the common-payoff property, i.e., the two players receive the same payoff at any outcome of the game. Due to the symmetry property, these games are guaranteed to have symmetric Nash…
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
This work introduces the concept of Variable Size Game Theory (VSGT), in which the number of players in a game is a strategic decision made by the players themselves. We start by discussing the main examples in game theory: dominance,…
We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic…
Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction to the concept of coinduction, we revisit on infinite…
We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…
Decision making in modern large-scale and complex systems such as communication networks, smart electricity grids, and cyber-physical systems motivate novel game-theoretic approaches. This paper investigates big strategic (non-cooperative)…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
Potential game is an emerging notion and framework for studying N-player games, especially with heterogeneous players. In this paper, we build an analytical framework for dynamic potential games. We prove that a game is a dynamic potential…
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…
The UNIQUE GAMES problem is a central problem in algorithms and complexity theory. Given an instance of UNIQUE GAMES, the STRONG UNIQUE GAMES problem asks to find the largest subset of vertices, such that the UNIQUE GAMES instance induced…
Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
In this work, after given the definition of soft sets and their basic operations we define two person soft games which can apply to problems contain vagueness and uncertainty. We then give four solution methods of the games which are soft…
Let $RG$ be the group ring of a finite group $G$ over a commutative ring $R$ with $1$. An element $x$ in $RG$ is said to be skew-symmetric with respect to an involution $\sigma$ of $RG$ if $\sigma(x)=-x.$ A structure theorem for the…