The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper concentrates on seeking the generalized Nash equilibria of network aggregative games by using a distributed continuous-time algorithm. By considering the variational inequality related to the problem, we design a distributed algorithm seeking the variational equilibria, which are practically an essential part of generalized Nash equilibrium points. Then the novel distributed projected continuous-time...
We study a linear multihop network that is formed by wireless devices that can directly communicate pairwise whenever two devices are within range of each other. This Device-to-Device communication model is expected to play a significant role in future 5G wireless networks due to its advantages (e.g., cellular offloading, increased throughput and low cost/energy communication). In such networks, devices...
This paper considers a class of generalized convex games where each player is associated with a convex objective function, a private convex inequality constraint and a private convex constraint set. The component functions are potentially non-smooth. The players aim to compute a Nash equilibrium through communicating with neighboring players. We study two distributed computation algorithms and show...
Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in distributed fashion, their throughput performance will be low as these schemes may converge to...
Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant when agents compete in a networked setting. In this paper, we consider such a setting and focus on a congestion game in which agents contend with shared network constraints. We make two sets of contributions: (1) Under two types of...
When rate expectations of users in a wireless network cannot all be satisfied, one choice is to discard some users from the system, in a mechanism called admission control. However, in a data network, users have a certain tolerance to occasional rate outages. In this paper we argue that it may be preferable for users to reduce their rate objectives smoothly, by considering an outage probability tolerance,...
A game-theoretic approach to the maximization of the information rates of broadband multi-input-multi-output (MIMO) Gaussian interference channels is proposed. The problem is cast as a strategic noncooperative game with the MIMO links as players and the information rates as payoff functions. The Nash equilibrium solution of this game is a waterfilling operation and sufficient conditions for its existence...
This paper treats the problem of distributed planning in general-sum stochastic games with communication when the model is known. Our main contribution is a novel, game theoretic approach to the problem of distributed equilibrium computation and selection. We show theoretically and via experiments that our approach, when adopted by all agents, facilitates an efficient distributed equilibrium computation...
We present a distributed learning algorithm for optimising transit prices in a negotiation problem in the inter-domain routing framework. We present a combined game theoretic and distributed algorithmic analysis, where the notion of Nash equilibrium with the first approach model meets the notion of stability in the second. We show that minimum cost providers can learn how to strategically set their...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.