English
Related papers

Related papers: Robust Distributed Averaging: When are Potential-T…

200 papers

Diffusion on complex networks is often modeled as a stochastic process. Yet, recent work on strategic diffusion emphasizes the decision power of agents and treats diffusion as a strategic problem. Here we study the computational aspects of…

Computational Complexity · Computer Science 2020-01-31 Marcin Waniek , Khaled Elbassioni , Flavio L. Pinheiro , Cesar A. Hidalgo , Aamena Alshamsi

The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…

Computer Science and Game Theory · Computer Science 2016-08-24 Branislav Bosansky , Simina Branzei , Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , Troels Bjerre Sorensen

We study a repeated game between a supplier and a retailer who want to maximize their respective profits without full knowledge of the problem parameters. After characterizing the uniqueness of the Stackelberg equilibrium of the stage game…

Computer Science and Game Theory · Computer Science 2022-07-12 Nicolò Cesa-Bianchi , Tommaso Cesari , Takayuki Osogami , Marco Scarsini , Segev Wasserkrug

Federated learning is a distributed learning paradigm where multiple agents, each only with access to local data, jointly learn a global model. There has recently been an explosion of research aiming not only to improve the accuracy rates…

Computer Science and Game Theory · Computer Science 2021-06-18 Kate Donahue , Jon Kleinberg

Motivated by applications in job scheduling, queuing networks, and load balancing in cyber-physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these…

Computer Science and Game Theory · Computer Science 2025-12-24 Fatemeh Fardno , S. Rasoul Etesami

The emerging social network platforms enable users to share their own opinions, as well as to exchange opinions with others. However, adversarial network perturbation, where malicious users intentionally spread their extreme opinions,…

Computers and Society · Computer Science 2023-04-26 Yuejiang Li , Zhanjiang Chen , H. Vicky Zhao

We consider a team game reward, and we derive a stochastic Pontryagin's maximum principle for distributed stochastic differential systems with decentralized noisy information structures. Our methodology utilizes the semi martingale…

Optimization and Control · Mathematics 2013-04-12 Charalambos D. Charalambous , N. U. Ahmed

Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…

Computer Science and Game Theory · Computer Science 2022-10-05 Jibang Wu , Weiran Shen , Fei Fang , Haifeng Xu

Here we present a ground-breaking new postulate for game theory. The first part of this postulate contains the axiomatic observation that all games are created by a designer, whether they are: e.g., (dynamic/static) or…

Computer Science and Game Theory · Computer Science 2015-06-02 Jie Dong , Nicole Sawyer , David Smith

Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only on local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally…

Multiagent Systems · Computer Science 2021-03-30 Stefan Vlaski , Ali H. Sayed

An unknown positive number of items arrive at independent uniformly distributed times in the interval [0,1] to a selector, whose task is to pick online the last one. We show that under the assumption of an adversary determining the number…

Computer Science and Game Theory · Computer Science 2011-04-18 Johan Wästlund

A key challenge in multi-robot and multi-agent systems is generating solutions that are robust to other self-interested or even adversarial parties who actively try to prevent the agents from achieving their goals. The practicality of…

Artificial Intelligence · Computer Science 2017-10-19 Trong Nghia Hoang , Yuchen Xiao , Kavinayan Sivakumar , Christopher Amato , Jonathan How

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…

Information Theory · Computer Science 2016-05-09 Peida Tian , Sidharth Jaggi , Mayank Bakshi , Oliver Kosut

In Stackelberg security games when information about the attacker's payoffs is uncertain, algorithms have been proposed to learn the optimal defender commitment by interacting with the attacker and observing their best responses. In this…

Computer Science and Game Theory · Computer Science 2019-11-01 Jiarui Gan , Qingyu Guo , Long Tran-Thanh , Bo An , Michael Wooldridge

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

We revisit a one-step control problem over an adversarial packet-dropping link. The link is modeled as a set of binary channels controlled by a strategic jammer whose intention is to wage a `denial of service' attack on the plant by…

Systems and Control · Computer Science 2014-03-25 V. Ugrinovskii , C. Langbort

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has…

Computer Science and Game Theory · Computer Science 2017-12-06 Mattia Mazzoli , Angel Sanchez

The recent advancement in real-world critical infrastructure networks has led to an exponential growth in the use of automated devices which in turn has created new security challenges. In this paper, we study the robust and adaptive…

Computer Science and Game Theory · Computer Science 2020-11-10 Supriyo Ghosh , Patrick Jaillet

Consider a network game with linear best responses and spillovers between players, and let agents endogenously choose their links. A planner considers interventions to subsidize actions and/or links between players, aiming to maximize a…

Theoretical Economics · Economics 2026-02-16 Krishna Dasaratha , Anant Shah

We consider a setting where $p$ public resources are to be allocated among $n$ competing and strategic agents so as to maximize social welfare (the objects should be allocated to those who value them the most). This is called allocative…

Computer Science and Game Theory · Computer Science 2018-01-29 P Manisha , C V Jawahar , Sujit Gujar