Related papers: Likelihood Equilibria in the Ising Game
We study a static game played by a finite number of agents, in which agents are assigned independent and identically distributed random types and each agent minimizes its objective function by choosing from a set of admissible actions that…
We introduce and discuss a nonlinear kinetic equation of Boltzmann type which describes the evolution of wealth in a pure gambling process, where the entire sum of wealths of two agents is up for gambling, and randomly shared between the…
We consider the stability of matchings when individuals strategically submit preference information to a publicly known algorithm. Most pure Nash equilibria of the ensuing game yield a matching that is unstable with respect to the…
We consider a stochastic game with partial, asymmetric and non-classical information, where the agents are trying to acquire as many available opportunities/locks as possible. Agents have access only to local information, the information…
This paper investigates the Nash equilibrium seeking problems for networked games with intermittent communication, where each player is capable of communicating with other players intermittently over a strongly connected and directed graph.…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
We study the complexity of computing a uniform Nash equilibrium on a non-win-lose bimatrix game. It is known that such a problem is NP-complete even if a bimatrix game is win-lose (Bonifaci et al., 2008). Fortunately, if a win-lose bimatrix…
We study stability properties of the expected utility function in Bayesian optimal experimental design. We provide a framework for this problem in a non-parametric setting and prove a convergence rate of the expected utility with respect to…
We investigate Nash Equilibrium in the quantum Battle of Sexes Game. We find the game has infinite Nash Equilibria and all of them leads to the asymmetry result. We also show that there is no unique but infinite Nash Equilibrium in it if we…
Coordination games admit two types of equilibria: pure equilibria, where all players successfully coordinate their actions, and mixed equilibria, where players frequently experience miscoordination. The existing literature shows that under…
This paper investigates the equilibrium convergence properties of a proposed algorithm for potential games with continuous strategy spaces in the presence of feedback delays, a main challenge in multi-agent systems that compromises the…
This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier. While previous…
We tackle the problem of learning equilibria in simulation-based games. In such games, the players' utility functions cannot be described analytically, as they are given through a black-box simulator that can be queried to obtain noisy…
This paper introduces a novel criterion, persuasiveness, to select equilibria in signaling games. In response to the Stiglitz critique, persuasiveness focuses on the comparison across equilibria. An equilibrium is more persuasive than an…
The uniform distribution is an important counterexample in game theory as many of the canonical game dynamics have been shown not to converge to the equilibrium in certain cases. In particular none of the canonical game dynamics converge to…
This paper considers dyadic-exchange networks in which individual agents autonomously form coalitions of size two and agree on how to split a transferable utility. Valid results for this game include stable (if agents have no unilateral…
Voters making a binary decision purchase votes from a centralized clearing house, paying the square of the number of votes purchased. The net payoff to an agent with utility $u$ who purchases $v$ votes is $\Psi (S_{n+1})u-v^{2}$, where…
One of the proposed solutions to the equilibrium selection problem for agents learning in repeated games is obtained via the notion of stochastic stability. Learning algorithms are perturbed so that the Markov chain underlying the learning…
We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic…
We consider a multi-agent noncooperative game with agents' objective functions being affected by uncertainty. Following a data driven paradigm, we represent uncertainty by means of scenarios and seek a robust Nash equilibrium solution. We…