Related papers: Coalitions in Routing Games: A Worst-Case Perspect…
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…
This work focuses on the credit assignment problem in cooperative multi-agent reinforcement learning (MARL). Sharing the global advantage among agents often leads to insufficient policy optimization, as it fails to capture the coalitional…
We consider the following question: in a nonatomic routing game, can the tolls that induce the minimum latency flow be computed without knowing the latency functions? Since the latency functions are unknown, we assume we are given an oracle…
We consider autonomous racing of two cars and present an approach to formulate racing decisions as a non-cooperative non-zero-sum game. We design three different games where the players aim to fulfill static track constraints as well as…
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess's paradox, gives rise to the (selfish) network design…
We revisit games in partition function form, i.e. cooperative games where the payoff of a coalition depends on the partition of the entire set of players. We assume that each coalition computes its worth having probabilistic beliefs over…
The core of a cooperative game on a set of players $N$ is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection $\cF$ of $2^N$), the core may become unbounded, which makes it…
Hedonic games -- at the interface of cooperative game theory and computational social choice -- are coalition formation games in which the players have preferences over the coalitions they can join. Kerkmann et al. [13] introduced…
We put forward a new model of congestion games where agents have uncertainty over the routes used by other agents. We take a non-probabilistic approach, assuming that each agent knows that the number of agents using an edge is within a…
The aim of this article is to propose a core game theory model of transaction costs wherein it is indicated how direct costs determine the probability of loss and subsequent transaction costs. The existence of optimum is proven, and the way…
Cores of cooperative games are ubiquitous in information theory, and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include classical settings in network…
Game-theoretic centrality is a flexible and sophisticated approach to identify the most important nodes in a network. It builds upon the methods from cooperative game theory and network theory. The key idea is to treat nodes as players in a…
The optimization of facility-based systems is considered. First, the congestion game is converted into a matrix form, so that the matrix approach is applicable. Then, a facility-based system with a system performance criterion is…
Cooperative games can be distinguished as non-cooperative games in which players can freely sign binding agreements to form coalitions. These coalitions inherit a joint strategy set and seek to maximize collective payoffs. When the payoffs…
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the $N$-coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is…
Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…
Path planning is a fundamental and extensively explored problem in robotic control. We present a novel economic perspective on path planning. Specifically, we investigate strategic interactions among path planning agents using a game…
The basic optimal transportation problem consists in finding the most effective way of moving masses from one location to another, while minimizing the transportation cost. Such concept has been found to be useful to understand various…
Route controlled autonomous vehicles could have a significant impact in reducing congestion in the future. Before applying multi-agent reinforcement learning algorithms to route control, we can model the system using a congestion game to…
We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is…