Related papers: Algorithms for Communication Problems for Mobile A…
We consider the problem of fairly dividing a set of heterogeneous divisible resources among agents with different preferences. We focus on the setting where the resources correspond to the edges of a connected graph, every agent must be…
Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or…
We develop a hybrid system model to describe the behavior of multiple agents cooperatively solving an optimal coverage problem under energy depletion and repletion constraints. The model captures the controlled switching of agents between…
This paper considers the problem of optimally balancing motion energy and communication transmission energy of a mobile robot tasked with transmitting a given number of data bits to a remote station, while navigating to a prespecified…
This paper presents a new cooperative wireless communication network strategy that incorporates energy cooperation and data cooperation. The model establishment, design goal formulations, and algorithms for throughput maximization of the…
In this work, we propose distributed and networked energy management scenarios to optimize the production and reservation of energy among a set of distributed energy nodes. In other words, the idea is to optimally allocate the generated and…
The problem of joint transfer of information and energy for wireless links has been recently investigated in light of emerging applications such as RFID and body area networks. Specifically, recent work has shown that the additional…
This study considers a wireless network where an access point (AP) broadcasts timely updates to numerous mobile users. The timeliness of information owned by a user is characterized by the age of information. Frequently broadcasting the…
Communication systems for multicasting information and energy simultaneously to more than one user are investigated. In the system under study, a transmitter sends the same message and signal to multiple receivers over distinct and…
We study a simple but compelling model of $n$ interacting agents via time-dependent, unidirectional communication. The model finds wide application in a variety of fields including synchronization, swarming and distributed decision making.…
We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements, can be solved in polynomial time. The problem is relevant…
Wireless energy transfer is an emerging technology that is used in networks of battery-powered devices in order to deliver energy and keep the network functional. Existing state-of-the-art studies have mainly focused on applying this…
We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform generalized version of single-message broadcast algorithms…
In network formation games, agents form edges with each other to maximize their utility. Each agent's utility depends on its private beliefs and its edges in the network. Strategic agents can misrepresent their beliefs to get a better…
We consider a problem where multiple agents must learn an action profile that maximises the sum of their utilities in a distributed manner. The agents are assumed to have no knowledge of either the utility functions or the actions and…
Complex scheduling problems require a large amount computation power and innovative solution methods. The objective of this paper is the conception and implementation of a multi-agent system that is applicable in various problem domains.…
In the standard Mechanism Design framework (Hurwicz-Reiter), there is a central authority that gathers agents' messages and subsequently determines the allocation and tax for each agent. We consider a scenario where, due to communication…
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is…
In a noncooperative dynamic game, multiple agents operating in a changing environment aim to optimize their utilities over an infinite time horizon. Time-varying environments allow to model more realistic scenarios (e.g., mobile devices…
The cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the $K$ packets making up the file. Nodes make broadcast transmissions that are received by…