相关论文: Limit Your Consumption! Finding Bounds in Average-…

Mobile edge computing (MEC) networks are one of the key technologies for ultra-reliability and low-latency communications. The computing resource allocation solution needs to be carefully designed to guarantee the computing resource…

Stochastic games are a natural model for the synthesis of controllers confronted to adversarial and/or random actions. In particular, $\omega$-regular games of infinite length can represent reactive systems which are not expected to reach a…

Resource allocation problems across multiple contests are ubiquitous in adversarial settings, from military operations to market competition. While Colonel Blotto and General Lotto games have provided valuable theoretical foundations for…

With increasingly favorable economics and bundling of different grid services, energy storage systems (ESS) are expected to play a key role in integrating renewable generation. This work considers the coordination of ESS owned by customers…

We investigate performance limits of a multiple access communication system with energy harvesting nodes where the utility function is taken to be the long-term average sum-throughput. We assume a causal structure for energy arrivals and…

A game-theoretic approach for studying power control in multiple-access networks with transmission delay constraints is proposed. A non-cooperative power control game is considered in which each user seeks to choose a transmit power that…

Due to the spectrum reuse in small cell network, the inter-cell interference has great effect on MEC's performance. In this paper, for reducing the energy consumption and latency of MEC, we propose a game theory based jointing offloading…

Budget allocation for power system reliability improvement is considered among the sophisticated problems because of its nonlinear nature. This nonlinearity makes the problem intractable for large-scale power systems. This paper compares…

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…

We introduce a simple class of mean field games with absorbing boundary over a finite time horizon. In the corresponding $N$-player games, the evolution of players' states is described by a system of weakly interacting It\^o equations with…

One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If…

Wireless powered communication networks are becoming an effective solution for improving self sustainability of mobile devices. In this context, a hybrid access point transfers energy to a group of nodes, which use the harvested energy to…

With the advent of prosumers, the traditional centralized operation may become impracticable due to computational burden, privacy concerns, and conflicting interests. In this paper, an energy sharing mechanism is proposed to accommodate…

Energy storage shifts energy from off-peak periods to on-peak periods. Unlike conventional generation, storage is duration-limited: the stored energy capacity constrains the duration over which it can supply power. To understand how these…

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Frequency non-selective time-selective multiple access channels in which transmitters can freely choose their power control policy are considered. The individual objective of the transmitters is to maximize their averaged energy-efficiency.…

We characterize all common notions of behavioral equivalence by one 6-dimensional energy game, where energies bound capabilities of an attacker trying to tell processes apart. The defender-winning initial credits exhaustively determine…

This article studies the user behavior in non-atomic congestion games. We consider non-atomic congestion games with continuous and non-decreasing functions and investigate the limit of the price of anarchy when the total user volume…

We extend the classic regret minimization framework for approximating equilibria in normal-form games by greedily weighing iterates based on regrets observed at runtime. Theoretically, our method retains all previous convergence rate…