相关论文: Bilateral symmetry and modified Pascal triangles i…
The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…
Parrondo games with one-dimensional spatial dependence were introduced by Toral and extended to the two-dimensional setting by Mihailovi\'c and Rajkovi\'c. $MN$ players are arranged in an $M\times N$ array. There are three games, the fair,…
A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…
Trusting in others and reciprocating that trust with trustworthy actions are crucial to successful and prosperous societies. The Trust Game has been widely used to quantitatively study trust and trustworthiness, involving a sequential…
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…
We present a new tool for the study of multiplayer stochastic games, namely the modified game, which is a normal-form game that depends on the discount factor, the initial state, and for every player a partition of the set of states and a…
This paper introduces a variant of the impartial combinatorial game nim, called tree nim, as well as a particular case of tree nim called tripod nim. A certain existence-uniqueness result and a periodicity result are proven about the…
Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and the natural extension…
In many situations, both in human and artificial societies, cooperating agents have different status with respect to the activity and it is not uncommon that certain actions are only allowed to coalitions that satisfy certain criteria,…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
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…
This paper presents a universal representation of symmetric (permutation-invariant) functions with multidimensional variable-size variables. These representations help justify approximation methods that aggregate information from each…
The mean field games (MFG) paradigm was introduced to provide tractable approximations of games involving very large populations. The theory typically rests on two key assumptions: homogeneity, meaning that all players share the same…
We study the dynamics of a family of replicator maps, depending on two parameters. Such studies are motivated by the analysis of the dynamics of evolutionary games under selections. From the dynamics viewpoint, we prove the existence of…
Open parity games are proposed as a compositional extension of parity games with algebraic operations, forming string diagrams of parity games. A potential application of string diagrams of parity games is to describe a large parity game…
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…
We present a unified approach, based on dominating families in binary relations, for the study of topological properties defined in terms of selection principles and the games associated to them.
We study bipartite correlations in Bell-type games. We show that in a setup where the information carriers are allowed to locally deform the manifold on which the game is played, stronger correlations may be obtained than those maximally…
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as…
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…