Related papers: Strategic decentralization in binary choice compos…
As predictive models are deployed into the real world, they must increasingly contend with strategic behavior. A growing body of work on strategic classification treats this problem as a Stackelberg game: the decision-maker "leads" in the…
In this article, we revisit a communication-control co-design problem for a class of two-player stochastic differential games on an infinite horizon. Each 'player' represents two active decision makers, namely a scheduler and a remote…
A new class of multi-player competitive stochastic games in discrete-time with an affine specification of the redistribution of payoffs at exercise is proposed and examined. Our games cover as a very special case the classic two-person…
In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…
We adopt a game theoretic approach for the design and analysis of distributed resource allocation algorithms in fading multiple access channels. The users are assumed to be selfish, rational, and limited by average power constraints. We…
We study {\em bottleneck congestion games} where the social cost is determined by the worst congestion of any resource. These games directly relate to network routing problems and also job-shop scheduling problems. In typical bottleneck…
An atomic routing game is a multiplayer game on a directed graph. Each player in the game chooses a path -- a sequence of links that connect its origin node to its destination node -- with the lowest cost, where the cost of each link is a…
We consider the repeated prisoner's dilemma (PD). We assume that players make their choices knowing only average payoffs from the previous stages. A player's strategy is a function from the convex hull $\mathfrak{S}$ of the set of payoffs…
We propose a decentralized penalty method for general convex constrained multi-agent optimization problems. Each auxiliary penalized problem is solved approximately with a special parallel descent splitting method. The method can be…
Metaverse as the next-generation Internet provides users with physical-virtual world interactions. To improve the quality of immersive experience, users access to Metaverse service providers (MSPs) and purchase bandwidth resource to reduce…
Existing settings of decentralized learning either require players to have full information or the system to have certain special structure that may be hard to check and hinder their applicability to practical systems. To overcome this, we…
Gradient-based methods for two-player games produce rich dynamics that can solve challenging problems, yet can be difficult to stabilize and understand. Part of this complexity originates from the discrete update steps given by simultaneous…
We study the following repeated non-atomic routing game. In every round, nature chooses a state in an i.i.d. manner according to a publicly known distribution, which influences link latency functions. The system planner makes private route…
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player B, who wants…
This paper analyzes the fundamental limits of strate- gic communication in network settings. Strategic communication differs from the conventional communication paradigms in in- formation theory since it involves different objectives for…
Route controlled autonomous vehicles could have a significant impact in reducing congestion in the future. Before applying multi-agent reinforcement learning algorithms to route control, we can model the system using a congestion game to…
We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…
We analyse a coalition formation game between strategic service providers of a congestible service. The key novelty of our formulation is that it is a constant sum game, i.e., the total payoff across all service providers (or coalitions of…
The strategic selection of resources by selfish agents has long been a key area of research, with Resource Selection Games and Congestion Games serving as prominent examples. In these traditional frameworks, agents choose from a set of…
Stochastic games are a popular framework for studying multi-agent reinforcement learning (MARL). Recent advances in MARL have focused primarily on games with finitely many states. In this work, we study multi-agent learning in stochastic…