Related papers: Characterizing the ELS Values with Fixed-Populatio…
Persistent homology (PH) -- the conventional method in topological data analysis -- is computationally expensive, requires further vectorization of its signatures before machine learning (ML) can be applied, and captures information along…
Feature-based SPL analysis and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally…
The Elo rating system, which was originally proposed by Arpad Elo for chess, has become one of the most important rating systems in sports, economics and gaming nowadays. Its original formulation is based on two-player zero-sum games, but…
For nearly three decades, spatial games have produced a wealth of insights to the study of behavior and its relation to population structure. However, as different rules and factors are added or altered, the dynamics of spatial models often…
We consider the problem of payoff division in indivisible coalitional games, where the value of the grand coalition is a natural number. This number represents a certain quantity of indivisible objects, such as parliamentary seats, kidney…
The Shapley value (SV) and Least core (LC) are classic methods in cooperative game theory for cost/profit sharing problems. Both methods have recently been proposed as a principled solution for data valuation tasks, i.e., quantifying the…
The Shapley value, which is arguably the most popular approach for assigning a meaningful contribution value to players in a cooperative game, has recently been used intensively in explainable artificial intelligence. Its meaningfulness is…
A solution concept on a class of transferable utility coalitional games is a multifunction satisfying given criteria of economic rationality. Every solution associates a set of payoff allocations with a coalitional game. This general…
The Shapley value is the prevalent solution for fair division problems in which a payout is to be divided among multiple agents. By adopting a game-theoretic view, the idea of fair division and the Shapley value can also be used in machine…
Animal behavior and evolution can often be described by game-theoretic models. Although in many situations, the number of players is very large, their strategic interactions are usually decomposed into a sum of two-player games. Only…
In this paper we study collective decision making on a multi-population, represented by a regular network of groups of individuals. Each group consists of a collection of players and every player can choose between two options. A group is…
We introduce a new class of network allocation games called graphical distance preservation games. Here, we are given a graph, called a topology, and a set of agents that need to be allocated to its vertices. Moreover, every agent has an…
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…
We consider game-theoretically secure distributed protocols for coalition games that approximate the Shapley value with small multiplicative error. Since all known existing approximation algorithms for the Shapley value are randomized, it…
Policy makers focus on stable strategies as the ones adopted by rational players. If there are many such solutions an important question is how to select amongst them. We study this question for the Multicommodity Flow Coalition Game, used…
Some well-known solutions for cooperative games with transferable utility (TU-games), such as the Banzhaf value, the Myerson value, and the Aumann-Dreze value, fail to satisfy efficiency. Despite their desirable normative properties, this…
In the classical context, the cooperative game theory concept of the Shapley value has been adapted for post hoc explanations of machine learning models. However, this approach does not easily translate to eXplainable Quantum ML (XQML).…
Shapley operators of undiscounted zero-sum two-player games are order-preserving maps that commute with the addition of a constant. We characterize the fixed point sets of Shapley operators, in finite dimension (i.e., for games with a…
We consider MultiCriteria Decision Analysis models which are defined over discrete attributes, taking a finite number of values. We do not assume that the model is monotonically increasing with respect to the attributes values. Our aim is…
We study evolutionary game dynamics in finite populations. We analyze an evolutionary process, which we call pairwise comparison, for which we adopt the ubiquitous Fermi distribution function from statistical mechanics. The inverse…