Related papers: On minimum integer representations of weighted gam…
In this article, we introduce certain kinds of computable reduction games with imperfect information. One can view such a game as an extension of the notion of Turing reduction, and generalized Weihrauch reduction as well. Based on the work…
We study a very general class of games --- multi-dimensional aggregative games --- which in particular generalize both anonymous games and weighted congestion games. For any such game that is also large, we solve the equilibrium selection…
We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…
For a voting ensemble that selects an odd-sized subset of the ensemble classifiers at random for each example, applies them to the example, and returns the majority vote, we show that any number of voters may minimize the error rate over an…
We here study the Battle of the Sexes game, a textbook case of asymmetric games, on small networks. Due to the conflicting preferences of the players, analytical approaches are scarce and most often update strategies are employed in…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
Based on Holler (1982) and Armijos-Toro et al. (2021) we propose two power indices to measure the influence of the players in the class of weighted majority games in partition function form. We compare these new power indices with their…
Here we will use results of Cox, Durrett, and Perkins for voter model perturbations to study spatial evolutionary games on $Z^d$, $d\ge 3$ when the interaction kernel is finite range, symmetric, and has covariance matrix $\sigma^2I$. The…
We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion of player and their agency within open games, and the lack…
A query game is a pair of a set $Q$ of queries and a set $\mathcal{F}$ of functions, or codewords $f:Q\rightarrow \mathbb{Z}.$ We think of this as a two-player game. One player, Codemaker, picks a hidden codeword $f\in \mathcal{F}$. The…
We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…
In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…
Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…
Weighted voting games are a well-known and useful class of succinctly representable simple games that have many real-world applications, e.g., to model collective decision-making in legislative bodies or shareholder voting. Among the…
For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
We consider a setting where an agent's uncertainty is represented by a set of probability measures, rather than a single measure. Measure-by-measure updating of such a set of measures upon acquiring new information is well-known to suffer…
Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class $\mathcal{C}_\alpha$…
A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…
Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of…