Related papers: Global solution to sensor network localization: A …

The problem of placing or selecting sensors and control nodes plays a pivotal role in the operation of dynamic networks. This paper proposes optimal algorithms and heuristics to solve the simultaneous sensor and actuator selection problem…

We propose to solve large instances of the non-convex optimization problems reformulated with canonical duality theory. To this aim we propose an interior point potential reduction algorithm based on the solution of the primal-dual total…

Wireless sensors can integrate rechargeable batteries and energy-harvesting (EH) devices to enable long-term, autonomous operation, thus requiring intelligent energy management to limit the adverse impact of energy outages. This work…

Distributed optimization and Nash equilibrium (NE) seeking problems have drawn much attention in the control community recently. This paper studies a class of non-cooperative games, known as N-cluster game, which subsumes both cooperative…

This paper investigates the problem of database-assisted spectrum access in dynamic TV white spectrum networks, in which the active user set is varying. Since there is no central controller and information exchange, it encounters dynamic…

The computational characterization of game-theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing computationally efficient tools for finding optimal ways to behave in strategic interactions.…

Zero-sum games arise in a wide variety of problems, including robust optimization and adversarial learning. However, algorithms deployed for finding a local Nash equilibrium in these games often converge to non-Nash stationary points. This…

In this paper, we propose a novel class of Nash problems for Cognitive Radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own…

The localization problem in a wireless sensor network is to determine the coordination of sensor nodes using the known positions of some nodes (called anchors) and corresponding noisy distance measurements. There is a variety of different…

Save for some special cases, current training methods for Generative Adversarial Networks (GANs) are at best guaranteed to converge to a `local Nash equilibrium` (LNE). Such LNEs, however, can be arbitrarily far from an actual Nash…

A practical challenge which arises in the operation of sensor networks is the presence of sensor faults, biases, or adversarial attacks, which can lead to significant errors incurring in the localization of the agents, thereby undermining…

We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization…

In this paper, a distributed non-model based seeking algorithm which combines the extremum seeking control (ESC) jointly with learning algorithms is proposed to seek a generalized Nash equilibrium (GNE) for a class of noncooperative games…

The property of the communication network and the constraints on the strategic space are two factors that determine the complexity of the distributed Nash equilibrium (DNE) seeking problem. The DNE seeking problem of aggregative games has…

In this paper, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative convex games with partial-decision information. We propose a distributed algorithm, where each agent refines its strategy through projected-gradient…

This paper considers node localization in static sensor networks using range-only measurements. Similar to state- of-the-art algorithms, such as ECHO and DILOC, we rely on barycentric coordinates of the nodes to transform the non-convex…

Sensor nodes are low cost, low power devices that are used to collect physical data and monitor environmental conditions from remote locations. Wireless Sensor Networks(WSN) are collection of sensor nodes, coordinating among themselves to…

Large infrastructure networks (e.g. for transportation and power distribution) require constant monitoring for failures, congestion, and other adversarial events. However, assigning a sensor to every link in the network is often infeasible…

In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking where a network of players, abstracted as a directed graph, aim to minimize their own local cost functions non-cooperatively. Considering the…

Network games have been instrumental in understanding strategic behaviors over networks for applications such as critical infrastructure networks, social networks, and cyber-physical systems. One critical challenge of network games is that…