Related papers: Interconnected Contests
We consider a situation where wireless service providers compete for heterogenous wireless users. The users differ in their willingness to pay as well as in their individual channel gains. We prove existence and uniqueness of the Nash…
This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to improve their achievable rates. Previously, it was shown that a…
Competitive interactions represent one of the driving forces behind evolution and natural selection in biological and sociological systems. For example, animals in an ecosystem may vie for food or mates; in a market economy, firms may…
This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource.…
We examine a two-person game we call Will-Testing in which the strategy space for both players is a real number. It has no equilibrium. When an infinitely large set of players plays this in all possible pairings, there is an equilibrium for…
In competitive resource allocation, a central coordinator may seek to gain an advantage not by directly controlling subordinate agents, but by strategically manipulating the information they receive. We study this problem within the…
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…
Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the actions taken by their neighbors. Extending the framework of…
This paper considers the competitive resource allocation problem in Multiple-Input Multiple-Output (MIMO) interfering channels, when users maximize their energy efficiency. Considering each transmitter-receiver pair as a selfish player,…
This paper proposes a new lens for studying threshold games played on networks when the thresholds are heterogeneous. These are games where agents have two possible actions, and prefer action 1 if and only if enough of their neighbours…
We formalize the argument that political disagreements can be traced to a "clash of narratives". Drawing on the "Bayesian Networks" literature, we model a narrative as a causal model that maps actions into consequences, weaving a selection…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…
In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two…
In this paper we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, $N$…
We consider the problem of budget allocation for competitive influence maximization over social networks. In this problem, multiple competing parties (players) want to distribute their limited advertising resources over a set of social…
We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…
This paper investigates a two-stage game-theoretical model with multiple parallel rank-order contests. In this model, each contest designer sets up a contest and determines the prize structure within a fixed budget in the first stage.…
Patterns of wins and losses in pairwise contests, such as occur in sports and games, consumer research and paired comparison studies, and human and animal social hierarchies, are commonly analyzed using probabilistic models that allow one…
We investigate the model of multiple contests held in parallel, where each contestant selects one contest to join and each contest designer decides the prize structure to compete for the participation of contestants. We first analyze the…
We investigate pooling problems in which multiple players vie with one another to maximize individual profit in a non-cooperative competitive market. This competitive setting is interesting and worthy of study because the majority of…