Potential games are noncooperative games for which there exist auxiliary functions, called
potentials, such that the maximizers of the potential are also Nash equilibria of the …

We characterize the Price of Anarchy (POA) in weighted congestion games, as a function of
the allowable resource cost functions. Our results provide as thorough an understanding of …

In this paper, some new criteria for detecting whether a finite game is potential are proposed
by solving potential equations. The verification equations with the minimal number for …

We consider the efficiency of taxation in congestion games with polynomial latency functions
along the line of research initiated by Caragiannis et al.[ACM Transactions on Algorithms …

Resource selection games provide a model for a diverse collection of applications where a
set of resources is matched to a set of demands. Examples include routing in traffic and in …

This paper studies the monotonicity of equilibrium costs and equilibrium loads in nonatomic
congestion games, in response to variations of the demands. The main goal is to identify …

In this paper, we consider the choice behavior of players in a static game and discuss
solutions to static games of complete information problem via semi-tensor product (STP) …

As independent and decentralized entities often share common resources, it is necessary to
allocate common costs across these subunits. When there is a lack of specific price …

Learning in stochastic games is arguably the most standard and fundamental setting in multi-
agent reinforcement learning (MARL). In this paper, we consider decentralized MARL in …

Joint use of resources with usage-dependent cost raises the question: who pays how much?
We study cost sharing in resource selection games where the strategy spaces are either …