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 studies distributed solutions for an optimal resource allocation problem over networked systems with connected graph communication topologies. The problem setting consists of a group of agents in a network cooperatively meeting a demand by supplying a resource whose commitment incurs a cost on them. The objective in the optimal resource allocation problem is to obtain a commitment value...
We formulate a class of divisible resource allocation problems among a collection of suppliers and demanders as double-sided auction games. The auction mechanism adopted in this paper inherits some properties of the VCG style auction mechanism, like the incentive compatibility and the efficiency of Nash Equilibrium (NE). In this paper, we propose a novel dynamic process to implement the efficient...
We present a convergence result for a nonhomogeneous Markov chain that arises in the study of networks employing the additive-increase multiplicative decrease (AIMD) algorithm. We then use this result to solve the network utility maximisation (NUM) problem.
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.