Related papers: Complementary cooperation, minimal winning coaliti…
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and…
In wireless mesh network (WMN), multiple service providers (SPs) can cooperate to share resources (e.g., relay nodes and spectrum), to serve their collective subscribed customers for better service. As a reward, SPs are able to achieve more…
Coalitional games are mathematical models suited to analyze scenarios where players can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. A fundamental problem for coalitional games is to single…
Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its players. The \emph{signaling problem} abstracts the task faced…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
Additive feature explanations rely primarily on game-theoretic notions such as the Shapley value by viewing features as cooperating players. The Shapley value's popularity in and outside of explainable AI stems from its axiomatic…
We contribute the first provable guarantees of global convergence to Nash equilibria (NE) in two-player zero-sum convex Markov games (cMGs) by using independent policy gradient methods. Convex Markov games, recently defined by Gemp et al.…
This paper investigates repeated win-lose coordination games (WLC-games). We analyse which protocols are optimal for these games, covering both the worst case and average case scenarios, i,e., optimizing the guaranteed and expected…
Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such…
We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that…
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…
This paper investigates repeated win-lose coordination games (WLC-games). We analyse which protocols are optimal for these games covering both the worst case and average case scenarios, i,e., optimizing the guaranteed and expected…
The matching game is a cooperative game where the value of every coalition is the maximum revenue of players in the coalition can make by forming pairwise disjoint partners. The multiple partners matching game generalizes the matching game…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
The Full Strategy Minority Game (FSMG) is an instance of the Minority Game (MG) which includes a single copy of every potential agent. In this work, we explicitly solve the FSMG thanks to certain symmetries of this game. Furthermore, by…
We investigate the application of the Shapley value to quantifying the contribution of a tuple to a query answer. The Shapley value is a widely known numerical measure in cooperative game theory and in many applications of game theory for…
The concept of nimbers--a.k.a. Grundy-values or nim-values--is fundamental to combinatorial game theory. Nimbers provide a complete characterization of strategic interactions among impartial games in their disjunctive sums as well as the…
We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…
In the Minority, Majority and Dollar Games (MG, MAJG, $G), synthetic agents compete for rewards, at each time-step acting in accord with the previously best-performing of their limited sets of strategies. Different components and/or aspects…
Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…