Related papers: Symmetries of Quasi-Values
Several extensions of the equal division value and the equal surplus division value to the family of games with a priori unions are proposed in Alonso-Meijide et al. (2020) ``On egalitarian values for cooperative games with a priori…
Computing Nash equilibrium in multi-agent games is a longstanding challenge at the interface of game theory and computer science. It is well known that a general normal form game in N players and k strategies requires exponential space…
In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with a priori unions. In the case of the equal…
We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic…
Mean-field games have been studied under the assumption of very large number of players. For such large systems, the basic idea consists to approximate large games by a stylized game model with a continuum of players. The approach has been…
Structural Causal Models (SCM) are a powerful framework for describing complicated dynamics across the natural sciences. A particularly elegant way of interpreting SCMs is do-Shapley, a game-theoretic method of quantifying the average…
Shapley value is a classic notion from game theory, historically used to quantify the contributions of individuals within groups, and more recently applied to assign values to data points when training machine learning models. Despite its…
The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values for some of the coalitions are not known. The main focus of…
We extend the coopetition index introduced by Aleandri and Dall'Aglio (2025) for simple games to the broader class of monotone transferable utility (TU) games and to all non-empty coalitions, including singletons. The new formulation allows…
Cooperative game theory methods, notably Shapley values, have significantly enhanced machine learning (ML) interpretability. However, existing explainable AI (XAI) frameworks mainly attribute average model predictions, overlooking…
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…
We demonstrate that parallel repetition of the multiplayer anchored optimal value, $\omega \big( G_{\bot} \big)^{\otimes n}$, decays exponentially. Central to our approach are several probabilistic computations, pertaining to: (1) the…
We consider repeated zero-sum games with incomplete information on the side of Player 2 with the total payoff given by the non-normalized sum of stage gains. In the classical examples the value $V_N$ of such an $N$-stage game is of the…
We introduce a modification of Perron's method, where semi-solutions are considered in a carefully defined asymptotic sense. With this definition, we can show, in a rather elementary way, that in a zero-sum game or a control problem (with…
Suppose $F$ is a field with valuation $v$ and valuation ring $O_{v}$, $E$ is a finite field extension and $w$ is a quasi-valuation on $E$ extending $v$. We study quasi-valuations on $E$ that extend $v$; in particular, their corresponding…
We show that the quotient associated to a quasi-Hamiltonian space has a symplectic structure even when 1 is not a regular value of the momentum map: it is a disjoint union of symplectic manifolds of possibly different dimensions, which…
We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…
A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\pi$ over $V$, the other player imposes a permutation $\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in…
In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…