Related papers: Distributed $n$-player approachability and consens…
In this paper, we present a framework for the analysis of self-organized distributed coalition formation process for spectrum sharing in interference channel for large-scale ad hoc networks. In this approach, we use the concept of coalition…
In this paper, we study the distributed generalized Nash equilibrium seeking problem of non-cooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action…
Cooperation in repeated public goods game is hardly achieved, unless contingent behavior is present. Surely, if mechanisms promoting positive assortment between cooperators are present, then cooperators may beat defectors, because…
Resource allocation in adversarial environments is a fundamental challenge across various domains, from corporate competition to military strategy. This article examines the impact of compromising an opponent's strategic intent in the…
We consider a scenario in which leaders are required to recruit teams of followers. Each leader cannot recruit all followers, but interaction is constrained according to a bipartite network. The objective for each leader is to reach a state…
We initiate the study of game dynamics in the population protocol model: $n$ agents each maintain a current local strategy and interact in pairs uniformly at random. Upon each interaction, the agents play a two-person game and receive a…
This paper considers a game-theoretic framework for distributed machine learning problems over networks where the information acquisition at a node is modeled as a rational choice of a player. In the proposed game, players decide both the…
We consider the problem of cooperation in distributed wireless networks of selfish and free transmitters aiming at maximizing their energy-efficiency. The strategy of each transmitter consists in choosing his power control (PC) policy. Two…
This paper studies cooperative games where coalitions are formed online and the value generated by the grand coalition must be irrevocably distributed among the players at each timestep. We investigate the fundamental issue of strategic…
In this paper, we consider a network allocation problem motivated by peer-to-peer cloud storage models. The setting is that of a network of units (e.g. computers) that collaborate and offer each other space for the back up of the data of…
A solution function for convex transferable utility games encourages the grand coalition if no player prefers (in a precise sense defined in the text) any coalition to the grand coalition. We show that the Shapley value encourages the grand…
Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…
In this paper, we study a distributed continuous-time design for aggregative games with coupled constraints in order to seek the generalized Nash equilibrium by a group of agents via simple local information exchange. To solve the problem,…
The spread of new ideas, behaviors or technologies has been extensively studied using epidemic models. Here we consider a model of diffusion where the individuals' behavior is the result of a strategic choice. We study a simple coordination…
Coordination games describe social or economic interactions in which the adoption of a common strategy has a higher payoff. They are classically used to model the spread of conventions, behaviors, and technologies in societies. Here we…
Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users…
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with…
We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A $(k,t)$-robust equilibrium is a strategy profile such that no coalition of size $k$ can improve the payoff of one its member by…
The matching game is a cooperative game where the value of every coalition is the maximum revenue of players in the coalition can make by forming pairwise disjoint partners. The multiple partners matching game generalizes the matching game…
Exchange of services and resources in, or over, networks is attracting nowadays renewed interest. However, despite the broad applicability and the extensive study of such models, e.g., in the context of P2P networks, many fundamental…