Related papers: On Existence, Mixtures, Computation and Efficiency…
We formulate a vector cost alternative to the scalarization method for weighting and combining multi-objective costs. The algorithm produces solutions to bimatrix games that are simultaneously pure, unique Nash equilibria and Pareto optimal…
We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding locations to find multiple items hidden by a hider. Each hiding location has a maximum hiding capacity and a probability of detecting its hidden…
We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study…
The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency…
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 propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
We consider multi-dimensional payoff functions in partially observable Markov decision processes. We study the structure of the set of expected payoff vectors of all strategies (policies) and study what kind are needed to achieve a given…
A distortion function, which captures the payoff gap between a player's actual payoff and her true payoff, is introduced and used to analyze games. In our proposed framework, we argue that players' actual payoff functions should be used to…
We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordination games and anti-coordination games. We consider three…
We consider potential games with mixed-integer variables, for which we propose two distributed, proximal-like equilibrium seeking algorithms. Specifically, we focus on two scenarios: i) the underlying game is generalized ordinal and the…
Computing equilibria of games is a central task in computer science. A large number of results are known for \emph{Nash equilibrium} (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form…
A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented, the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems.…
Shared-constraint games are noncooperative $N$-player games where players are coupled through a common coupling constraint. It is known that such games admit two kinds of equilibria -- generalized Nash equilibria (GNE) and variational…
Game Theory has been frequently applied in biological research since 1970s. While the key idea of Game Theory is Nash Equilibrium, it is critical to understand and figure out the payoff matrix in order to calculate Nash Equilibrium. In this…
Computing Nash equilibria for strategic multi-agent systems is challenging for expensive black box systems. Motivated by the ubiquity of games involving exploitation of common resources, this paper considers the above problem for potential…
Computing Nash equilibrium policies is a central problem in multi-agent reinforcement learning that has received extensive attention both in theory and in practice. However, provable guarantees have been thus far either limited to fully…
We study the problem of achieving decentralized coordination by a group of strategic decision makers choosing to engage or not in a task in a stochastic setting. First, we define a class of symmetric utility games that encompass a broad…
Public goods games study the incentives of individuals to contribute to a public good and their behaviors in equilibria. In this paper, we examine a specific type of public goods game where players are networked and each has binary actions,…