The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

Mobile edge computing has emerged as a prevalent computing paradigm to support
applications that demand low latency and high computational capacity. Hardware …

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 …

We study the existence of pure Nash equilibria in weighted congestion games. Let 𝒞 denote
a set of cost functions. We say that 𝒞 is consistent if every weighted congestion game with …

Network slicing is a promising approach for enabling low latency computation offloading in
edge computing systems. In this paper, we consider an edge computing system under …

With the advancement of edge computing and network function virtualization, it is promising
to provide flexible and low-latency network services at the network edge. However, due to …

This paper provides a literature overview on (direct revelation) algorithmic mechanism
design in the context of machine scheduling problems. Here, one takes a game-theoretic …

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 …

We present a general technique, based on a primal-dual formulation, for analyzing the
quality of self-emerging solutions in weighted congestion games. With respect to traditional …