Related papers: Non-symmetric discrete Colonel Blotto game
In adversarial interactions, one is often required to make strategic decisions over multiple periods of time, wherein decisions made earlier impact a player's competitive standing as well as how choices are made in later stages. In this…
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…
We develop a new approach that computes approximate equilibrium strategies in Jotto, a popular word game. Jotto is an extremely large two-player game of imperfect information; its game tree has many orders of magnitude more states than…
The explicit construction is presented of two-player game satisfying: (i) symmetry with respect to the permutation of the players; (ii) the existence of upper bound on total payoff following from Bell inequality; (iii) the existence of…
We study a nonzero-sum game of two players which is a generalization of the antagonistic noisy duel of discrete type. The game is considered from the point of view of various criterions of optimality. We prove existence of…
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…
We address the equilibrium concept of a reverse auction game so that no one can enhance the individual payoff by a unilateral change when all the others follow a certain strategy. In this approach the combinatorial possibilities to consider…
Ensuring the security of networked systems is a significant problem, considering the susceptibility of modern infrastructures and technologies to adversarial interference. A central component of this problem is how defensive resources…
The Prisoner's Dilemma, zero-sum games, LQR team problems, and differential games have shaped game theory in controls for decades, but the field's most pressing adversarial challenges demand a richer framework, and its name is Colonel…
This paper provides theoretical bounds for empirical game theoretical analysis of complex multi-agent interactions. We provide insights in the empirical meta game showing that a Nash equilibrium of the meta-game is an approximate Nash…
In this work we consider an agent based model in order to study the wealth distribution problem where the interchange is determined with a symmetric zero sum game. Simultaneously, the agents update their way of play trying to learn the…
Equilibrium in Economics has been seldom addressed in a situation where some variables are discrete. This work introduces a problem related to lot-sizing with several players, and analyses some strategies which are likely to be found in…
In order to understand if and how strategic resource allocation can constrain the structure of pair-wise competition outcomes in competitive human competitions we introduce a new multiplayer resource allocation game, the Population Lotto…
This paper develops a unified framework for testing monotonicity of Bayesian Nash equilibrium strategies in unobserved types in games of incomplete information. We show that, under symmetric independent private types, monotonicity of…
We study the complexity of computing equilibria in binary public goods games on undirected graphs. In such a game, players correspond to vertices in a graph and face a binary choice of performing an action, or not. Each player's decision…
In this paper, we address an instance of uniquely solvable mean-field game with a common noise whose corresponding counterpart without common noise has several equilibria. We study the selection problem for this mean-field game without…
The aim of the paper is to examine the notion of simple Kantian equilibrium in $2 \times 2$ symmetric games and their quantum counterparts. We focus on finding the Kantian equilibrium strategies in the general form of the games. As a…
We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…
Finding a counterfeit coin with the different weight from a set of visually identical coin using a balance, usually a two-armed balance, known as the balance question, is an intersting and inspiring question. Its variants involve…
We study $n$-dimensional contests between two players with heterogeneous effort costs, where each dimension (battle) is modeled as a Tullock contest. Prize-allocation rules are identity-independent, budget-balanced, and weakly increasing in…