activity
20232026
most citedGlobal solution to sensor network localization: A non-convex potential game approach and its distributed implementation

4 citations · 8 across the 19 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2026

Wasserstein Robust Performative Prediction via Lagrangian Relaxation

Siyi Wang, Zifan Wang, Karl H. Johansson

In machine learning, predictive models are trained on historical data. Their deployment may incentivize agents to strategically adapt their behavior, thereby inducing a model-depen…

math.OC2025

Risk-Averse Learning with Varying Risk Levels

Siyi Wang, Zifan Wang, Karl H. Johansson

In safety-critical decision-making, the environment may evolve over time, and the learner adjusts its risk level accordingly. This work investigates risk-averse online optimization…

math.OC2025

Wasserstein Distributionally Robust Nash Equilibrium Seeking with Heterogeneous Data: A Lagrangian Approach

Zifan Wang, Georgios Pantazis, Sergio Grammatico +2

We study a class of distributionally robust games where agents are allowed to heterogeneously choose their risk aversion with respect to distributional shifts of the uncertainty. I…

math.OC2025

First- and Zeroth-Order Learning in Asynchronous Games

Zifan Wang, Xinlei Yi, Michael M. Zavlanos +1

This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial…

math.OC2025

Projected Gradient Descent for Constrained Decision-Dependent Optimization

Zifan Wang, Changxin Liu, Thomas Parisini +2

This paper considers the decision-dependent optimization problem, where the data distributions react in response to decisions affecting both the objective function and linear const…

math.OC2024

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

Gehui Xu, Guanpu Chen, Baris Fidan +4

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. W…

math.OC2024

Learning of Nash Equilibria in Risk-Averse Games

Zifan Wang, Yi Shen, Michael M. Zavlanos +1

This paper considers risk-averse learning in convex games involving multiple agents that aim to minimize their individual risk of incurring significantly high costs. Specifically,…

math.OC2024★ 4 cited

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

Gehui Xu, Guanpu Chen, Yiguang Hong +3

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor…

math.OC2023

Non-convex potential games for finding global solutions to sensor network localization

Gehui Xu, Guanpu Chen, Yiguang Hong +3

Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and th…

math.OC2023★ 1 cited

Constrained Optimization with Decision-Dependent Distributions

Zifan Wang, Changxin Liu, Thomas Parisini +2

In this paper we deal with stochastic optimization problems where the data distributions change in response to the decision variables. Traditionally, the study of optimization prob…

math.OC2023

Convergence Analysis of the Best Response Algorithm for Time-Varying Games

Zifan Wang, Yi Shen, Michael M. Zavlanos +1

This paper studies a class of strongly monotone games involving non-cooperative agents that optimize their own time-varying cost functions. We assume that the agents can observe ot…