Related papers: Interconnected Contests
Colonel Blotto games with discrete strategy spaces effectively illustrate the intricate nature of multidimensional strategic reasoning. This paper studies the equilibrium set of such games where, in line with prior experimental work, the…
We study the interaction between a network designer and an adversary over a dynamical network. The network consists of nodes performing continuous-time distributed averaging. The goal of the network designer is to assist the nodes reach…
We study strong equilibria in symmetric capacitated cost-sharing games. In these games, a graph with designated source $s$ and sink $t$ is given, and each edge is associated with some cost. Each agent chooses strategically an $s$-$t$ path,…
Consider a coordination game played on a network, where agents prefer taking actions closer to those of their neighbors and to their own ideal points in action space. We explore how the welfare outcomes of a coordination game depend on…
We experimentally study effort provision and network formation in the linear-quadratic game characterized by positive externality and complementarity of effort choices among network neighbors. We compare experimental outcomes to the…
In this work, we are interested on the analysis of competing marketing campaigns between an incumbent who dominates the market and a challenger who wants to enter the market. We are interested in (a) the simultaneous decision of how many…
We construct several definitions of imbalance and playability, both of which are related to the existence of dominated strategies. Specifically, a maximally balanced game and a playable game cannot have dominated strategies for any player.…
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take part in a two-player game over a network of nodes whose…
In this paper, we investigate the multiplayer General Lotto game across multiple battlefields, a significant variant of the Colonel Blotto game. In this version, each player employs a probability distribution for resource allocation,…
We study a mathematical model to describe the evolution of a city, which is determined by the interaction of two large populations of agents, workers and firms. The map of the city is described by a network with the edges representing at…
This paper studies a communication game between an uninformed decision maker and two perfectly informed senders with conflicting interests. Senders can misreport information at a cost that increases with the size of the misrepresentation.…
We consider a sharing economy network where agents embedded in a graph share their resources. This is a fundamental model that abstracts numerous emerging applications of collaborative consumption systems. The agents generate a random…
In a model of interconnected conflicts on a network, we compare the equilibrium effort profiles and payoffs under two scenarios: uniform effort (UE) in which each contestant is restricted to exert the same effort across all the battles she…
Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such games can be evaluated through the costs of the system…
The ability of a deterministic, plastic system to learn to imitate stochastic behavior is analyzed. Two neural networks -actually, two perceptrons- are put to play a zero-sum game one against the other. The competition, by acting as a kind…
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-interested users. Most game-theoretic models applied to system…
Here we introduce a model in which individuals differ in the rate at which they seek new interactions with others, making rational decisions modeled as general symmetric two-player games. Once a link between two individuals has formed, the…
We study the robust Nash equilibrium (RNE) for a class of games in communications systems and networks where the impact of users on each other is an additive function of their strategies. Each user measures this impact, which may be…
We study a complementarity game as a systematic tool for the investigation of the interplay between individual optimization and population effects and for the comparison of different strategy and learning schemes. The game randomly pairs…
How does competition in markets for information affect the creation and division of surplus? We study this question in a search environment in which an agent searches sequentially for a high-quality good and learns about the quality of…