activity
20172024
most citedNash and Wardrop equilibria in aggregative games with coupling constraints

109 citations · 168 across the 20 of their papers we have counts for

collaborators

25 papers

cs.GT2024

Bridging the Gap Between Central and Local Decision-Making: The Efficacy of Collaborative Equilibria in Altruistic Congestion Games

Bryce L Ferguson, Dario Paccagnan, Bary S R Pradelski +1

Congestion games are popular models often used to study the system-level inefficiencies caused by selfish agents, typically measured by the price of anarchy. One may expect that al…

cs.GT2023

Collaborative Decision-Making and the k-Strong Price of Anarchy in Common Interest Games

Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski +1

The control of large-scale, multi-agent systems often entails distributing decision-making across the system components. However, with advances in communication and computation tec…

cs.GT2023

Collaborative Coalitions in Multi-Agent Systems: Quantifying the Strong Price of Anarchy for Resource Allocation Games

Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski +1

The emergence of new communication technologies allows us to expand our understanding of distributed control and consider collaborative decision-making paradigms. With collaborativ…

cs.GT2023

The Cost of Informing Decision-Makers in Multi-Agent Maximum Coverage Problems with Random Resource Values

Bryce L. Ferguson, Dario Paccagnan, Jason R. Marden

The emergent behavior of a distributed system is conditioned by the information available to the local decision-makers. Therefore, one may expect that providing decision-makers wit…

math.OC2022

Model-free False Data Injection Attack in Networked Control Systems: A Feedback Optimization Approach

Xiaoyu Luo, Chongrong Fang, Jianping He +2

Security issues have gathered growing interest within the control systems community, as physical components and communication networks are increasingly vulnerable to cyber attacks.…

math.OC2021

Online Traffic Routing: Deterministic Limits and Data-driven Enhancements

Devansh Jalota, Dario Paccagnan, Maximilian Schiffer +1

Over the past decade, GPS enabled traffic applications, such as Google Maps and Waze, have become ubiquitous and have had a significant influence on billions of daily commuters' tr…

cs.GT2021

The Unintended Consequences of Minimizing the Price of Anarchy in Congestion Games

Rahul Chandan, Dario Paccagnan, Jason R. Marden

This work focuses on the design of taxes in atomic congestion games, a commonly studied model for competitive resource sharing. While most related studies focus on optimizing eithe…

cs.GT2021

In Congestion Games, Taxes Achieve Optimal Approximation

Dario Paccagnan, Martin Gairing

In this work, we consider the problem of minimising the social cost in atomic congestion games. For this problem, we provide tight computational lower bounds along with taxation me…

cs.GT2021

Tractable mechanisms for computing near-optimal utility functions

Rahul Chandan, Dario Paccagnan, Jason R. Marden

Large scale multiagent systems must rely on distributed decision making, as centralized coordination is either impractical or impossible. Recent works approach this problem under a…

math.OC2020★ 1 cited

Stochastic Strategies for Robotic Surveillance as Stackelberg Games

Xiaoming Duan, Dario Paccagnan, Francesco Bullo

This paper studies a stochastic robotic surveillance problem where a mobile robot moves randomly on a graph to capture a potential intruder that strategically attacks a location on…

eess.SY2020★ 1 cited

Urgency-aware Optimal Routing in Repeated Games through Artificial Currencies

Mauro Salazar, Dario Paccagnan, Andrea Agazzi +2

When people choose routes minimizing their individual delay, the aggregate congestion can be much higher compared to that experienced by a centrally-imposed routing. Yet centralize…

cs.SI2020★ 1 cited

Assign and Appraise: Achieving Optimal Performance in Collaborative Teams

Elizabeth Y. Huang, Dario Paccagnan, Wenjun Mei +1

Tackling complex team problems requires understanding each team member's skills in order to devise a task assignment maximizing the team performance. This paper proposes a novel qu…

cs.GT2019

Optimal Taxes in Atomic Congestion Games

Dario Paccagnan, Rahul Chandan, Bryce L Ferguson +1

How can we design mechanisms to promote efficient use of shared resources? Here, we answer this question in relation to the well-studied class of atomic congestion games, used to m…

cs.GT2019

When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price of Anarchy

Rahul Chandan, Dario Paccagnan, Jason R. Marden

The price of anarchy (PoA) is a popular metric for analyzing the inefficiency of self-interested decision making. Although its study is widespread, characterizing the PoA can be ch…

eess.SY2019

The Nash Equilibrium with Inertia in Population Games

Basilio Gentile, Dario Paccagnan, Bolutife Ogunsula +1

In the traditional game-theoretic set up, where agents select actions and experience corresponding utilities, an equilibrium is a configuration where no agent can improve their uti…

eess.SY2019

When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-Anarchy

Rahul Chandan, Dario Paccagnan, Jason R. Marden

Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game t…

math.OC2019★ 17 cited

The scenario approach meets uncertain variational inequalities and game theory

Dario Paccagnan, Marco C. Campi

Variational inequalities are modelling tools used to capture a variety of decision-making problems arising in mathematical optimization, operations research, game theory. The scena…

eess.SY2019

Optimal Price of Anarchy in Cost-Sharing Games

Rahul Chandan, Dario Paccagnan, Jason R. Marden

The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propo…

math.OC2019

Distributed control and game design: From strategic agents to programmable machines

Dario Paccagnan

Large scale systems are forecasted to greatly impact our future lives thanks to their wide ranging applications including cooperative robotics, mobility on demand, resource allocat…

cs.GT2018

Utility Design for Distributed Resource Allocation -- Part II: Applications to Submodular, Covering, and Supermodular Problems

Dario Paccagnan, Jason R. Marden

A fundamental component of the game theoretic approach to distributed control is the design of local utility functions.Relative to resource allocation problems that are additive ov…

cs.GT2018★ 30 cited

Utility Design for Distributed Resource Allocation -- Part I: Characterizing and Optimizing the Exact Price of Anarchy

Dario Paccagnan, Rahul Chandan, Jason R. Marden

Game theory has emerged as a fruitful paradigm for the design of networked multiagent systems. A fundamental component of this approach is the design of agents' utility functions s…

eess.SY2018★ 4 cited

On the Efficiency of Nash Equilibria in Aggregative Charging Games

Dario Paccagnan, Francesca Parise, John Lygeros

Several works have recently suggested to model the problem of coordinating the charging needs of a fleet of electric vehicles as a game, and have proposed distributed algorithms to…

cs.GT2017★ 5 cited

The Importance of System-Level Information in Multiagent Systems Design: Cardinality and Covering Problems

Dario Paccagnan, Jason R. Marden

A fundamental challenge in multiagent systems is to design local control algorithms to ensure a desirable collective behaviour. The information available to the agents, gathered ei…

cs.GT2017

Multiagent Maximum Coverage Problems: The Trade-off Between Anarchy and Stability

Vinod Ramaswamy, Dario Paccagnan, Jason R. Marden

The price of anarchy and price of stability are three well-studied performance metrics that seek to characterize the inefficiency of equilibria in distributed systems. The distinct…