Related papers: Approximate Core Allocations for Multiple Partners…
We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students. We study several settings, which…
Cooperative multihop communication can greatly increase network throughput, yet packet forwarding for other nodes involves opportunity and energy cost for relays. Thus one of the pre-requisite problems in the successful implementation of…
This paper studies a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is…
We study a distributed allocation process where, repeatedly in time, every player renegotiates past allocations with neighbors and allocates new revenues. The average allocations evolve according to a doubly (over time and space) averaging…
An independent set game is a cooperative game defined on graphs and dealing with profit-sharing in maximum independent set problems. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition…
I introduce cooperative product games (CPGs), a cooperative game where every player has a weight, and the value of a coalition is the product of the weights of the players in the coalition. I only look at games where the weights are at…
This paper generalizes L.S. Shapley's celebrated value allocation theory on coalition games by discovering and applying a fundamental connection between stochastic path integration driven by canonical time-reversible Markov chains and…
Agent-based modeling (ABM) is a powerful paradigm to gain insight into social phenomena. One area that ABM has rarely been applied is coalition formation. Traditionally, coalition formation is modeled using cooperative game theory. In this…
We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study…
The introduction of new services, such as Mobile Edge Computing (MEC), requires a massive investment that cannot be assumed by a single stakeholder, for instance the Infrastructure Provider (InP). Service Providers (SPs) however also have…
The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A…
We present an algorithm for detecting service provider alliances. To perform this, we modelize a cooperative game-theoretic model for competitor service providers. A choreography (a peer-to-peer service composition model) needs a set of…
This paper provides formulae and algorithms to compute the projection onto the core of a preimputation outside it. The core of a game is described using an exponential number of linear constraints, and we cannot know beforehand which are…
In competitive resource allocation formulations multiple agents compete over different contests by committing their limited resources in them. For these settings, contest games offer a game-theoretic foundation to analyze how players can…
We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for…
Coordinating the behaviour of self-interested agents in the presence of multiple Nash equilibria is a major research challenge for multi-agent systems. Pre-game communication between all the players can aid coordination in cases where the…
We consider transferable utility cooperative games with infinitely many players and the core understood in the space of bounded additive set functions. We show that, if a game is bounded below, then its core is non-empty if and only if the…
Despite some promising results in federated learning using game-theoretical methods, most existing studies mainly employ a one-level game in either a cooperative or competitive environment, failing to capture the complex dynamics among…
The core of a game $v$ on $N$, which is the set of additive games $\phi$ dominating $v$ such that $\phi(N)=v(N)$, is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular…
We consider a sharing economy network where agents embedded in a graph share their resources. This is a fundamental model that abstracts numerous emerging applications of collaborative consumption systems. The agents generate a random…